When should there be a "Me" in "Team"?: distributed multi-agent optimization under uncertainty

Increasing teamwork between agents typically increases the performance of a multi-agent system, at the cost of increased communication and higher computational complexity. This work examines joint actions in the context of a multi-agent optimization problem where agents must cooperate to balance exploration and exploitation. Surprisingly, results show that increased teamwork can hurt agent performance, even when communication and computation costs are ignored, which we term the team uncertainty penalty. This paper introduces the above phenomena, analyzes it, and presents algorithms to reduce the effect of the penalty in our problem setting.

[1]  Neil Immerman,et al.  The Complexity of Decentralized Control of Markov Decision Processes , 2000, UAI.

[2]  Connections between cooperative control and potential games illustrated on the consensus problem , 2007, 2007 European Control Conference (ECC).

[3]  Milind Tambe,et al.  Solving Multiagent Networks using Distributed Constraint Optimization , 2008, AI Mag..

[4]  Weixiong Zhang,et al.  Distributed stochastic search and distributed breakout: properties, comparison and applications to constraint optimization problems in sensor networks , 2005, Artif. Intell..

[5]  Milind Tambe,et al.  Argumentation as distributed constraint satisfaction: applications and results , 2001, AGENTS '01.

[6]  Yang Xu,et al.  An integrated token-based algorithm for scalable coordination , 2005, AAMAS '05.

[7]  Makoto Yokoo,et al.  DCOPs meet the realworld: exploring unknown reward matrices with applications to mobile sensor networks , 2009, IJCAI 2009.

[8]  Norman M. Sadeh,et al.  Examining DCSP coordination tradeoffs , 2006, AAMAS '06.

[9]  H. Robbins Some aspects of the sequential design of experiments , 1952 .

[10]  Victor R. Lesser,et al.  Solving distributed constraint optimization problems using cooperative mediation , 2004, Proceedings of the Third International Joint Conference on Autonomous Agents and Multiagent Systems, 2004. AAMAS 2004..

[11]  Edmund H. Durfee,et al.  Blissful Ignorance: Knowing Just Enough to Coordinate Well , 1995, ICMAS.

[12]  Boi Faltings,et al.  A Scalable Method for Multiagent Constraint Optimization , 2005, IJCAI.

[13]  Paul Scerri,et al.  A POMDP Approach to Token-Based Team Coordination , 2005 .

[14]  Makoto Yokoo,et al.  Adopt: asynchronous distributed constraint optimization with quality guarantees , 2005, Artif. Intell..

[15]  C. Sidner,et al.  Plans for Discourse , 1988 .

[16]  Nikos A. Vlassis,et al.  Collaborative Multiagent Reinforcement Learning by Payoff Propagation , 2006, J. Mach. Learn. Res..

[17]  Milind Tambe,et al.  Distributed Algorithms for DCOP: A Graphical-Game-Based Approach , 2004, PDCS.

[18]  Milind Tambe,et al.  Towards Flexible Teamwork , 1997, J. Artif. Intell. Res..

[19]  Nicholas R. Jennings,et al.  Decentralised Coordination of Mobile Sensors Using the Max-Sum Algorithm , 2009, IJCAI.

[20]  Roie Zivan Anytime Local Search for Distributed Constraint Optimization , 2008, AAAI.

[21]  Hector J. Levesque,et al.  On Acting Together , 1990, AAAI.