Agents' strategies for the dual parallel search in partnership formation applications

In many two-sided search applications, autonomous agents can enjoy the advantage of parallel search, powered by their ability to handle an enormous amount of information, in a short time, and the capability to maintain interaction with several other agents in parallel. The adoption of the new technique by an agent suggests a reduction in the average cost per interaction with other agents, resulting in an improved overall utility. Nevertheless, when all agents use parallel search in Multi-Agent Systems (MAS) applications, the analysis must take into consideration mainly equilibrium dynamics which shape their strategies. In this paper we introduce a dual parallel two-sided search model and supply the appropriate analysis for finding the agents' equilibrium strategies. As a framework application for our analysis we suggest and utilize the classic voice communication partnerships application in an electronic marketplace. By identifying the specific characteristics of the equilibria, we manage to supply efficient means for the agents to calculate their distributed equilibrium strategies. We show that in some cases equilibrium dynamics might eventually drive the agents into strategies by which all of them end up with a smaller expected utility. Nonetheless, in most environments the technique has many advantages in improving the agents expected utility.

[1]  Kristina Lerman,et al.  Coalition formation for large-scale electronic markets , 2000, Proceedings Fourth International Conference on MultiAgent Systems.

[2]  Sarit Kraus,et al.  Stable repeated strategies for information exchange between two autonomous agents , 2004, Artif. Intell..

[3]  S. Hart,et al.  Handbook of Game Theory with Economic Applications , 1992 .

[4]  Sarit Kraus,et al.  Time-variant distributed agent matching applications , 2004, Proceedings of the Third International Joint Conference on Autonomous Agents and Multiagent Systems, 2004. AAMAS 2004..

[5]  P. Morgan Search and Optimal Sample Sizes , 1983 .

[6]  Katia P. Sycara,et al.  Middle-Agents for the Internet , 1997, IJCAI.

[7]  Matthias Klusch,et al.  Larks: Dynamic Matchmaking Among Heterogeneous Software Agents in Cyberspace , 2002, Autonomous Agents and Multi-Agent Systems.

[8]  John McMillan,et al.  Chapter 27 Search , 1994 .

[9]  Toramatsu Shintani,et al.  A Group Buy Protocol based on Coalition Formation for Agent-mediated E-Commerce , 2002 .

[10]  Sarit Kraus,et al.  Agent's Multiple Inquiries for Enhancing the Partnership Formation Process , 2004, CIA.

[11]  METHODS FOR SUBJECTIVE DETERMINATION OF TRANSMISSION QUALITY Summary , 2022 .

[12]  Lones Smith,et al.  Assortative Matching and Search , 2000 .

[13]  Sarit Kraus,et al.  The Search for Coalition Formation in Costly Environments , 2003, CIA.

[14]  K. Burdett,et al.  Two-Sided Search with Nontransferable Utility☆☆☆ , 1998 .