skip to main content
10.1145/1160633.1160679acmconferencesArticle/Chapter ViewAbstractPublication PagesaamasConference Proceedingsconference-collections
Article

Integrating parallel interactions into cooperative search

Published:08 May 2006Publication History

ABSTRACT

In this paper we incorporate autonomous agents' capability to perform parallel interactions into the cooperative search model, resulting in a new method which outperforms the currently used ones. As a framework for our analysis we use the electronic marketplace, where buyer agents have the incentive to search cooperatively. The new search technique is quite intuitive, however its analysis and the process of extracting the optimal search strategy are associated with several significant complexities. These difficulties are derived mainly from the unbounded search space and simultaneous dual affects of decisions taken in different world states. We provide a comprehensive analysis of the model, highlighting, demonstrating and proving important characteristics of the optimal search strategy. Consequently, we manage to come up with an efficient modular algorithm for extracting the optimal cooperative search strategy for any given environment. A computational based comparative illustration of the system performance using the new search technique versus the traditional methods is given, emphasizing the main differences in the optimal strategy's structure and the advantage of using the proposed model.

References

  1. Y. Bakos. Reducing buyer search costs: Implications for electronic marketplaces. Management Sci, 42:1676--92, 1997.]]Google ScholarGoogle ScholarCross RefCross Ref
  2. J. Benhabib and C. Bull. Job search: The choice of intensity. J. of Political Economy, 91:747--764, 1983.]]Google ScholarGoogle ScholarCross RefCross Ref
  3. S. Breban and J. Vassileva. Long-term coalitions for the electronic marketplace. In B. Spencer, ed., Proceedings of E-Commerce Applications Workshop, 2001.]]Google ScholarGoogle Scholar
  4. S. Choi and J. Liu. Optimal time-constrained trading strategies for autonomous agents. In Proc. of MAMA' 2000, 2000.]]Google ScholarGoogle Scholar
  5. M. Dias. TraderBots: A New Paradigm for Robust and Efficient Multirobot Coordination in Dynamic Environments. PhD thesis, Robotics Institute, CMU, 2004.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. S. Gal, M. Landsberger, and B. Levykson. A compound strategy for search in the labor market. International Economic Review, 22(3):597--608, 1981.]]Google ScholarGoogle ScholarCross RefCross Ref
  7. T. Ito, H. Ochi, and T. Shintani. A group-buy protocol based on coalition formation for agent-mediated e-commerce. International Journal of Computer and Information Science (IJCIS), 3(1): 11--20, 2002.]]Google ScholarGoogle Scholar
  8. R. Keeney and H. Raiffa. Decisions with Multiple Objectives: Preferences and Value Tradeoffs. John Wiley & Sons, New York, 1976.]]Google ScholarGoogle Scholar
  9. J. Kephart and A. Greenwald. Shopbot economics. JAAMAS, 5(3):255--287, 2002.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. K. Lermann and O. Shehory. Coalition formation for large scale electronic markets. In Proceedings of ICMAS'2000, pages 216--222, Boston, 2000.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. S. Lippman and J. McCall. The economics of job search: A survey. Economic Inquiry, 14:155--189, 1976.]]Google ScholarGoogle ScholarCross RefCross Ref
  12. J. McMillan and M. Rothschild. Search. In Robert J. Aumann and Amsterdam Sergiu Hart, editors, Handbook of Game Theory with Economic Applications, pages 905--927, 1994.]]Google ScholarGoogle ScholarCross RefCross Ref
  13. P. Morgan. Search and optimal sample size. Review of Economic Studies, 50(4):659--675, 1983.]]Google ScholarGoogle ScholarCross RefCross Ref
  14. T. Sandholm, K. Larson, M. R. Andersson, O. Shehory, and F. Tohme. Coalition structure generation with worst case guarantees. Artificial Int. Journal, 111:209--238, 1999.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. D. Sarne and S. Kraus. The search for coalition formation in costly environments. In Proc. of CIA, pages 117--136, 2003.]]Google ScholarGoogle ScholarCross RefCross Ref
  16. D. Sarne and S. Kraus. Cooperative exploration in the electronic marketplace. In Proceedings of AAAI 2005, pages 158--163, 2005.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  17. G. Stigler. The economics of information. Journal of Political Economy, 69(3):213--225, 1961.]]Google ScholarGoogle ScholarCross RefCross Ref
  18. S. Talukdar, L. Baerentzen, A. Gove, and P. S. de Souza. Asynchronous teams: Cooperation schemes for autonomous agents. Heuristics, 4(4):295--321, 1998.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  19. N. Tsvetovat, K. Sycara, Y. Chen, and J. Ying. Customer coalitions in electronic markets. In Proceedings of AMEC 2000, pages 121--138, Barcelona, 2000.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  20. J. Yamamoto and K. Sycara. A stable and efficient buyer coalition formation scheme for e-marketplaces. In Proc. of the Fifth International Conference on Autonomous Agents, pages 576--583, 2001.]] Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. Integrating parallel interactions into cooperative search

      Recommendations

      Comments

      Login options

      Check if you have access through your login credentials or your institution to get full access on this article.

      Sign in
      • Published in

        cover image ACM Conferences
        AAMAS '06: Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems
        May 2006
        1631 pages
        ISBN:1595933034
        DOI:10.1145/1160633

        Copyright © 2006 ACM

        Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

        Publisher

        Association for Computing Machinery

        New York, NY, United States

        Publication History

        • Published: 8 May 2006

        Permissions

        Request permissions about this article.

        Request Permissions

        Check for updates

        Qualifiers

        • Article

        Acceptance Rates

        Overall Acceptance Rate1,155of5,036submissions,23%

      PDF Format

      View or Download as a PDF file.

      PDF

      eReader

      View online with eReader.

      eReader