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.

Paper Citation

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},
}

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