A Distributed Cooperative Approach for Optimizing a Family of Network Games
The present study considers a distributed cooperative approach for network problems where agents have personal preferences over outcomes. Such problems can be described by Asymmetric Constraints where the joint action of agents yields different gains to each participant Grubshtein et al. (2010). The proposed method constructs and solves an Asymmetric Distributed Constraints Optimization Problem whose solutions guarantee a minimal gain for each agent, which is at least as high as the agents’ Bayesian equilibrium gain. The paper focuses on a special class of Network Games and proves that the proposed method produces optimal results in terms of the number of agents whose gain improves over their equilibrium gain and that the resulting solutions are Pareto Efficient. Extensive empirical evaluation of the studied network problem shows that the number of improving agents is not negligible and that under some configurations up to 70% of the agents improve their gain while none of the agents receive a payoff lower than their equilibrium gain.
KeywordsMaximal Gain Actual Gain Bayesian Nash Equilibrium Network Game Minimal Gain
Unable to display preview. Download preview PDF.
- Axelrod, R.: The evolution of cooperation. Basic Books, New York (1984); ISBN 0465021212 Google Scholar
- Baba, S., Iwasaki, A., Yokoo, M., Silaghi, M., Hirayama, K., Matsui, T.: Cooperative problem solving against adversary: Quantified distributed constraint satisfaction problem. In: Proceedings of the 9th International Conference on Autonomous Agents and Multi-Agent Systems (AAMAS 2010), Toronto, Canada, pp. 781–788 (May 2010)Google Scholar
- Grubshtein, A., Zivan, R., Meisels, A., Grinshpoun, T.: Local search for distributed asymmetric optimization. In: Proceedings of the 9th International Conference on Autonomous Agents and Multi-Agent Systems (AAMAS 2010), Toronto, Canada, pp. 1015–1022 (May 2010)Google Scholar
- Maheswaran, R.T., Pearce, J.P., Tambe, M.: Distributed algorithms for DCOP: A graphical-game-based approach. In: Proceedings of Parallel and Distributed Computing Systems PDCS, pp. 432–439 (September 2004)Google Scholar
- Maheswaran, R.T., Tambe, M., Bowring, E., Pearce, J.P., Varakantham, P.: Taking DCOP to the real world: Efficient complete solutions for distributed multi-event scheduling. In: Kudenko, D., Kazakov, D., Alonso, E. (eds.) AAMAS 2004. LNCS (LNAI), vol. 3394, pp. 310–317. Springer, Heidelberg (2005)Google Scholar
- Meisels, A.: Distributed Search by Constrained Agents: Algorithms, Performance, Communication. Springer, Heidelberg (1848); ISBN 1848000391Google Scholar
- Modi, J., Veloso, M.: Multiagent meeting scheduling with rescheduling. In: Proc. 5th Workshop on Distributed Constraints Reasoning DCR 2004, Toronto (September 2004)Google Scholar
- Moulin, H.: Axioms of Cooperative Decision Making. Cambridge University Press, Cambridge (1991)Google Scholar
- Roughgarden, T.: Selfish Routing and the Price of Anarchy. MIT Press, Cambridge (2005); ISBN 0262182432Google Scholar