Abstract
This paper investigates cooperative search strategies for agents engaged in costly search in a complex environment. Searching cooperatively, several search goals can be satisfied within a single search effort. Given the searchers’ preferences, the goal is to conduct a search in a way that the expected overall utility out of the set of opportunities found (e.g., products when operating in a market) minus the costs associated with finding that set is maximized. This search scheme, given in the context of a group search, applies also to scenarios where a single agent has to search for a set of items for satisfying several different goals. The uniqueness of the proposed mechanism is in the ability to partition the group of agents/goals into sub-groups where the search continues for each group autonomously. As we show throughout the paper, this strategy is favorable as it weakly dominates (i.e., can improve but never worsen) cooperative and autonomous search techniques. The paper presents a comprehensive analysis of the new search method and highlights the specific characteristics of the optimal search strategy. Furthermore, we introduce innovative algorithms for extracting the optimal search strategy in a range of common environments, that eliminates the computational overhead associated with the use of the partitioning technique.
Similar content being viewed by others
References
Bakos Y. (1997) Reducing buyer search costs: Implications for electronic marketplaces. Management Science 43(12): 1676–1692
Baye M., Morgan J., Scholten P. (2004) Tempoal price dispersion: Evidence from an online consumer electronics market. Journal of Interactive Marketing 18(4): 101–115
Baye M., Morgan J., Scholten P. (2006) Persistent price dispersion in online markets. In: Jansen D. (eds) The new economy and beyond. Edward Elgar Press, Northampton MA
Benhabib J., Bull C. (1983) Job search: The choice of intensity. Journal of Political Economy 91(5): 747–764
Breban, S., & Vassileva, J. (2001). Long-term coalitions for the electronic marketplace. In B. Spencer (Ed.), Proceedings of e-commerce applications workshop. Canadian AI Conference, Ottawa.
Brynjolfsson E., Hu E., Smith M. (2003) Consumer surplus in the digital economy: Estimating the value of increased product variety at online bookseller. Management Science 49(11): 1580–1596
Burdett K., Malueg D. A. (1981) The theory of search for several goods. Journal of Economic Theory 24(3): 362–376
Carlson J. A., McAfee R. P. (1984) Joint search for several goods. Journal of Economic Theory 32(2): 337–345
Choi, S., & Liu, J. (2000). Optimal time-constrained trading strategies for autonomous agents. In Proceedings of MAMA’2000, Wollongong, Australia.
Clay K., Krishnan R., Wolff E., Fernandes D. (2002) Retail strategies on the web: Price and non-price competition in the online book industry. Journal of Industrial Economics 50: 351–367
David, E., Azoulay-Schwartz, R., & Kraus, S. (2002). Protocols and strategies for automated multi-attribute auctions. In AAMAS ’02: Proceedings of the 1st international joint conference on autonomous agents and multiagent systems (pp. 77–85). Bologna, Italy.
Dias, M. (2004). traderBots: A new paradigm for robust and efficient multirobot coordination in dynamic environments. Ph.D. thesis, Robotics Institute, CMU.
Gal S., Landsberger M., Levykson B. (1981) A compound strategy for search in the labor market. International Economic Review 22(3): 597–608
Gatti J. R. J. (1999) Multi-commodity consumer search. Journal of Economic Theory 86(2): 219–244
Goldman, C. V., & Zilberstein, S. (2003). Optimizing information exchange in cooperative multi-agent systems. In AAMAS ’03: Proceedings of the second international joint conference on Autonomous agents and multiagent systems (pp. 137–144). New York, NY: ACM Press.
Hart P. E., Nilsson N. J., Raphael B. (1968) A formal basis for the heuristic determination of minimum cost paths. IEEE Transactions on Systems, Science and Cybernetics 4(2): 100–107
Ito T., Ochi H., Shintani T. (2002) 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
Kahan J. P., Rapoport A. (1984) Theories of coalition formation. Lawrence Erlbaum Associates, Hillsdale, NJ
Keeney R., Raiffa H. (1976) Decisions with multiple objectives: Preferences and value tradeoffs. Wiley, New York
Kephart J., Greenwald A. (2002) Shopbot economics. Journal of Autonomous Agents and Multi-Agent Systems 5(3): 255–287
Leech D. (1987) Ownership concentration and the theory of the firm: A simple-game-theoretic approach. The Journal of Industrial Economics 35(3): 225–240
Lermann, K., & Shehory, O. (2000). Coalition formation for large scale electronic markets. In ICMAS’2000 (pp. 216–222). Boston, MA.
Li, C., Chawla, S., Rajan, U., & Sycara, K. (2003). Mechanisms for coalition formation and cost sharing in an electronic marketplace. In EC03 (pp. 68–77). Pittsburgh, PA.
Lippman S., McCall J. (1976) The economics of job search: A survey. Economic Inquiry 14(2–3): 155–189
Maes P., Guttman R. H., Moukas A. (1999) Agents that buy and sell. Communications of the ACM 42(3): 81–91
Manisterski, E. (2007). Protocols and strategies for agents teamwork. PhD thesis, Bar Ilan University, Ramat-Gan, Israel.
Manisterski, E., Sarne, D., & Kraus, S. (2007). Enhancing mas cooperative search through coalition partitioning. In Manuela M. Veloso (Ed.) IJCAI (pp. 1415–1421).
Manisterski, E., Sarne, D., & Kraus, S. (2008). Cooperative Search with Concurrent Interactions. In Journal of Artificial Intelligence Research (JAIR), (32:1–36).
McMillan, J., & Rothschild, M. (1994). Search. In Robert J. Aumann & Sergiu Hart (Eds.) Handbook of game theory with economic applications (pp. 905–927).
Michiardi P., Molva R. (2005) Analysis of coalition formation and cooperation strategies in mobile ad hoc networks. Ad Hoc Networks 3: 2005
Morgan P. (1983) Search and optimal sample size. Review of Economic Studies 50(4): 659–675
Morgan P., Manning R. (1985) Optimal search. Econometrica 53(4): 923–944
Ogston, E., Overeinder, B., Van Steen, M., & Brazier, F. (2003). A method for decentralized clustering in large multi-agent systems. In AAMAS03 (pp. 789–796). Melbourne, Australia.
Ohta, N., Iwasaki, A., Yokoo, M., Maruono, K., Conitzer, V., & Sandholm, T. (2006). A compact representation scheme for coalitional games in open anonymous environments. In AAAI06, Boston, MA.
Rahwan, T., Ramchurn, S. D., Dang, V. D., Giovannucci, A., & Jennings, N. R. (2007). Anytime optimal coalition structure generation. In 22nd Conference on artificial intelligence (AAAI) (pp. 1184–1190). February 2007.
Rothschild M. (1974) Searching for the lowest price when the distribution of prices is unknown. Journal of Political Economy 82(4): 689–711
Sandholm T., Larson K., Andersson M. R., Shehory O., Tohme F. (1999) Coalition structure generation with worst case guarantees. Artificial Intelligence 111(1–2): 209–238
Sarne, D., & Kraus, S. (2003). The search for coalition formation in costly environments. In Proceedings of CIA (pp. 117–136).
Sarne, D., & Kraus, S. (2005). Cooperative exploration in the electronic marketplace. In Proceedings of AAAI 2005 (pp. 158–163). Pittsburgh, PA.
Shehory O., Kraus S. (1998) Methods for task allocation via agent coalition formation. Artificial Intelligence 101(1–2): 165–200
Stigler G. (1961) The economics of information. Journal of Political Economy 69(3): 213–225
Talukdar S., Baerentzen L., Gove A., de Souza P. S. (1998) Asynchronous teams: Cooperation schemes for autonomous agents. Heuristics 4(4): 295–321
Tsvetovat, N., Sycara, K., Chen, Y., & Ying, J. (2000). Customer coalitions in electronic markets. In Conference on Electronic Commerce (pp. 121–138). Minnesota, MN.
Yamamoto, J., & Sycara, K. (2001). A stable and efficient buyer coalition formation scheme for e-marketplaces. In Proceedings of the 5th international conference on autonomous agents (pp. 576–583). Montreal, CA.
Yun Yeh D. (1986) A dynamic programming approach to the complete set partitioning problem. BIT 26(4): 467–474
Author information
Authors and Affiliations
Corresponding author
Additional information
This work was supported in part by NSF grant no IIS0705587, the Israeli Science Foundation grants no 1685 and 1401/09 and BSF grant 2008-404. Kraus is also affiliated with UMIACS. Preliminary parts of the analysis given in this paper appeared in [27].
Rights and permissions
About this article
Cite this article
Sarne, D., Manisterski, E. & Kraus, S. Multi-goal economic search using dynamic search structures. Auton Agent Multi-Agent Syst 21, 204–236 (2010). https://doi.org/10.1007/s10458-009-9111-z
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10458-009-9111-z