Game theoretical applications for multi-agent systems

We consider game-theoretic principles for design of cooperative and competitive (non-cooperative self-interested) multi-agent systems. Using economic concepts of tatonnement and economic core, we show that cooperative multi-agent systems should be designed in games with dominant strategies that may lead to social dilemmas. Non-cooperative multi-agent systems, on the other hand, should be designed for games with no clear dominant strategies and high degree of problem complexity. Further, for non-cooperative multi-agent systems, the number of learning agents should be carefully managed so that solutions in the economic core can be obtained. We provide experimental results for the design of cooperative and non-cooperative MAS from telecommunication and manufacturing industries.

[1]  Siddhartha Bhattacharyya,et al.  Multi-agent learning for adaptive scheduling , 1997 .

[2]  Randall Davis,et al.  Frameworks for Cooperation in Distributed Problem Solving , 1988, IEEE Transactions on Systems, Man, and Cybernetics.

[3]  Robert H. Crites,et al.  Multiagent reinforcement learning in the Iterated Prisoner's Dilemma. , 1996, Bio Systems.

[4]  Philippe Duley.  Zola n’écrirait pas dans Courrier international , 2012 .

[5]  A. Kirman,et al.  Equilibrium Analysis: Variations on Themes by Edgeworth and Walras , 1976 .

[6]  Sarit Kraus,et al.  Negotiation and Cooperation in Multi-Agent Environments , 1997, Artif. Intell..

[7]  Tami Tamir,et al.  Approximate Strong Equilibrium in Job Scheduling Games , 2008, SAGT.

[8]  Suwatchai Kamonsantiroj,et al.  An auction-based dynamic bandwidth allocation with sensitivity in a wireless networked control system , 2009, Comput. Ind. Eng..

[9]  Mahmoud Naghshineh,et al.  Channel assignment schemes for cellular mobile telecommunication systems: A comprehensive survey , 2000, IEEE Communications Surveys & Tutorials.

[10]  Tim Roughgarden,et al.  Cooperation in competition: efficiently representing and reasoning about coalitional games , 2008 .

[11]  Ben Y. Zhao,et al.  Utilization and fairness in spectrum assignment for opportunistic spectrum access , 2006, Mob. Networks Appl..

[12]  Parag C. Pendharkar,et al.  The theory and experiments of designing cooperative intelligent systems , 2007, Decis. Support Syst..

[13]  Soundar R. T. Kumara,et al.  Distributed energy balanced routing for wireless sensor networks , 2009, Comput. Ind. Eng..

[14]  Shimon Y. Nof,et al.  A collaborative sensor network middleware for automated production systems , 2009, Comput. Ind. Eng..

[15]  Lothar Thiele,et al.  Multiobjective evolutionary algorithms: a comparative case study and the strength Pareto approach , 1999, IEEE Trans. Evol. Comput..

[16]  Brahim Chaib-draa,et al.  An overview of distributed artificial intelligence , 1996 .

[17]  Michael P. Wellman,et al.  Conjectural Equilibrium in Multiagent Learning , 1998, Machine Learning.

[18]  Afsaneh Haddadi,et al.  Belief-desire-intention agent architectures , 1996 .

[19]  Mark S. Fox,et al.  An investigation into distributed constraint-directed factory scheduling , 1990, Sixth Conference on Artificial Intelligence for Applications.

[20]  Victor R. Lesser,et al.  Cooperative Multiagent Systems: A Personal View of the State of the Art , 1999, IEEE Trans. Knowl. Data Eng..

[21]  Pablo A. Miranda,et al.  e-Work based collaborative optimization approach for strategic logistic network design problem , 2009, Comput. Ind. Eng..

[22]  Victor R. Lesser,et al.  Coalitions Among Computationally Bounded Agents , 1997, Artif. Intell..

[23]  Parag C. Pendharkar.  A multi-agent approach for dynamic channel allocation , 2008, Int. Trans. Oper. Res..

[24]  Tung Bui,et al.  Building agent-based corporate information systems: An application to telemedicine , 2000, Eur. J. Oper. Res..