We analyze ways by which people decompose into groups in distributed systems. We are interested in systems in which an agent can increase its utility by connecting to other agents, but must also pay a cost that increases with the size of the sys- tem. The right balance is achieved by the right size group of agents. We formulate and analyze three intuitive and realistic games and show how simple changes in the protocol can dras- tically improve the price of anarchy of these games. In partic- ular, we identify two important properties for a low price of anarchy: agreement in joining the system, and the possibil- ity of appealing a rejection from a system. We show that the latter property is especially important if there are some pre- existing constraints regarding who may collaborate (or com- municate) with whom.
|Title of host publication||Proceedings of the AAAI Conference on Artificial Intelligence (AAAI-13), July 2013|
|Number of pages||7|
|Publication status||Published - Jul 2013|
Bibliographical noteAccepted at AAAI 2013: Twenty-Seventh Conference on Artificial Intelligence, Bellevue, Washington, USA
ASJC Scopus subject areas
- Artificial Intelligence