COOPERATION MECHANISM FOR A NETWORK GAME

Alon Grubshtein, Amnon Meisels

2011

Abstract

Many real world Multi Agent Systems encompass a large population of self interested agents which are connected with one another in an intricate network. If one is willing to accept the common axioms of Game Theory one can assume that the population will arrange itself into an equilibrium state. The present position paper proposes to use a mediating cooperative distributed algorithm instead. A setting where agents have to choose one action out of two - download information or free-ride their neighbors’ effort - has been studied recently. The present position paper proposes a method for constructing a Distributed Constraint Optimization Problem (DCOP) for a Network Game. The main result is that one can show that by cooperatively minimizing the constructed DCOP for a global solution all agents stand to gain at least as much as their equilibrium gain, and often more. This provides a mechanism for cooperation in a Network Game that is beneficial for all participating agents.

References

  1. Axelrod, R. (1984). The evolution of cooperation. Basic Books, New York.
  2. Galeotti, A., Goyal, S., Jackson, M. O., Vega-Redondo, F., and Yariv, L. (2010). Network games. Review of Economic Studies, 77(1):218-244.
  3. Grubshtein, A. and Meisels, A. (2010). Cost of cooperation for scheduling meetings. Computer Science and Information Systems (ComSIS), 7(3):551-567.
  4. Grubshtein, A., Zivan, R., Meisels, A., and Grinshpoun, T. (2010). Local search for distributed asymmetric optimization. In Proc. of the 9th Intern. Conf. on Autonomous Agents & Multi-Agent Systems (AAMAS'10), pages 1015-1022, Toronto, Canada.
  5. Halpern, J. Y. and Rong, N. (2010). Cooperative equilibrium (extended abstract). In Proc. of the 9th International Conference on Autonomous Agents and Multiagent Systems(AAMAS 2010), Toronto, Canada.
  6. Jackson, M. O. (2008). Social and Economic Networks. Princeton University Press.
  7. Kearns, M. J., Littman, M. L., and Singh, S. P. (2001). Graphical models for game theory. In UAI 7801: Proc. of the 17th Conf. in Uncertainty in Artificial Intelligence, pages 253-260.
  8. Maheswaran, R. T., Pearce, J. P., and Tambe, M. (2004). Distributed algorithms for DCOP: A graphical-gamebased approach. In Proc. Parallel and Distributed Computing Systems PDCS), pages 432-439.
  9. Meir, R., Polukarov, M., Rosenschein, J. S., and Jennings, N. (2010). Convergence to equilibria of plurality voting. In The Twenty-Fourth National Conference on Artificial Intelligence (AAAI'10).
  10. Meisels, A. (2007). Distributed Search by Constrained Agents: Algorithms, Performance, Communication. Springer Verlag.
  11. Monderer, D. and Tennenholtz, M. (2009). Strong mediated equilibrium. Artificial Intelligence, 173(1):180-195.
  12. Moulin, H. (1991). Axioms of Cooperative Decision Making. Cambridge University Press.
  13. Nisan, N., Roughgarden, T., Tardos, E., and Vazirani, V. V. (2007). Algorithmic Game Theory. Cambridge University Press.
  14. Osborne, M. and Rubinstein, A. (1994). A Course in Game Theory. The MIT Press.
  15. Petcu, A., Faltings, B., and Parkes, D. (2008). M-DPOP: Faithful distributed implementation of efficient social choice problems. Journal of AI Research (JAIR), 32:705-755.
  16. Roughgarden, T. (2005). Selfish Routing and the Price of Anarchy. The MIT Press.
  17. Zhang, W., Xing, Z., Wang, G., and Wittenburg, L. (2005). Distributed stochastic search and distributed breakout: properties, comparishon and applications to constraints optimization problems in sensor networks. Artificial Intelligence, 161:1-2:55-88.
Download


Paper Citation


in EndNote Style

TY - CONF
JO - Proceedings of the 3rd International Conference on Agents and Artificial Intelligence - Volume 2: ICAART,
TI - COOPERATION MECHANISM FOR A NETWORK GAME
SN - 978-989-8425-41-6
AU - Grubshtein A.
AU - Meisels A.
PY - 2011
SP - 336
EP - 341
DO - 10.5220/0003276303360341


in Harvard Style

Grubshtein A. and Meisels A. (2011). COOPERATION MECHANISM FOR A NETWORK GAME . In Proceedings of the 3rd International Conference on Agents and Artificial Intelligence - Volume 2: ICAART, ISBN 978-989-8425-41-6, pages 336-341. DOI: 10.5220/0003276303360341


in Bibtex Style

@conference{icaart11,
author={Alon Grubshtein and Amnon Meisels},
title={COOPERATION MECHANISM FOR A NETWORK GAME},
booktitle={Proceedings of the 3rd International Conference on Agents and Artificial Intelligence - Volume 2: ICAART,},
year={2011},
pages={336-341},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0003276303360341},
isbn={978-989-8425-41-6},
}