research-article

Free access

Coalitional affinity games

Authors:

Simina Brânzei,

Kate LarsonAuthors Info & Claims

AAMAS '09: Proceedings of The 8th International Conference on Autonomous Agents and Multiagent Systems - Volume 2

Pages 1319 - 1320

Published: 10 May 2009 Publication History

PDF eReader

Abstract

We present and analyze coalitional affinity games, a family of hedonic games that explicitly model the value that an agent receives from being associated with other agents. We provide a characterization of the social-welfare maximizing coalition structures, and study the stability properties of affinity games, using the core solution concept. Interestingly, we observe that members of the core do not necessarily maximize social welfare. We introduce a new measure, the stability-gap to capture this difference. Using the stability gap, we show that for an interesting class of coalitional affinity games, the difference between the social welfare of a stable coalition structure and a social-welfare maximizing coalition structure is bounded by a factor of 2, and that this bound is tight.

References

[1]

X. Deng and C. H. Papadimitriou. On the complexity of cooperative solution concepts. Mathematics of Operations Research, 19(2):257--266, 1994.

Digital Library

Google Scholar

[2]

N. Nisan, T. Roughgarden, E. Tardos, and V. Vazirani, editors. Algorithmic Game Theory. Cambridge University Press, 2007.

Digital Library

Google Scholar

[3]

B. Peleg and P. Sudhölter. Introduction to the Theory of Cooperative Games. Springer, 2003.

Crossref

Google Scholar

Cited By

View all

Ismaili AHazon NWatanabe EYokoo MKraus SElkind EVeloso MAgmon NTaylor M(2019)Complexity and Approximations in Robust Coalition Formation via Max-Min k-PartitioningProceedings of the 18th International Conference on Autonomous Agents and MultiAgent Systems10.5555/3306127.3332002(2036-2038)Online publication date: 8-May-2019
https://dl.acm.org/doi/10.5555/3306127.3332002
Skibski OMichalak TRahwan T(2018)Axiomatic characterization of game-theoretic centralityJournal of Artificial Intelligence Research10.1613/jair.1.1120262:1(33-68)Online publication date: 1-May-2018
https://dl.acm.org/doi/10.1613/jair.1.11202
Balliu AFlammini MOlivetti DSingh SMarkovitch S(2017)On pareto optimality in social distance gamesProceedings of the Thirty-First AAAI Conference on Artificial Intelligence10.5555/3298239.3298293(349-355)Online publication date: 4-Feb-2017
https://dl.acm.org/doi/10.5555/3298239.3298293
Show More Cited By

Index Terms

Coalitional affinity games
1. Computing methodologies
  1. Artificial intelligence
    1. Distributed artificial intelligence

Recommendations

The effect of collusion in congestion games
STOC '06: Proceedings of the thirty-eighth annual ACM symposium on Theory of Computing

In this paper we initiate the study of how collusion alters the quality of solutions obtained in competitive games. The price of anarchy aims to measure the cost of the lack of coordination by comparing the quality of a Nash equilibrium to that of a ...
Coalitional affinity games and the stability gap
IJCAI'09: Proceedings of the 21st International Joint Conference on Artificial Intelligence

We present and analyze coalitional affinity games, a family of hedonic games that explicitly model the value that an agent receives from being associated with other agents. We provide a characterization of the social-welfare maximizing coalition ...
Stackelberg Strategies and Collusion in Network Games with Splittable Flow

We study the impact of collusion in network games with splittable flow and focus on the well established price of anarchy as a measure of this impact. We first investigate symmetric load balancing games and show that the price of anarchy is at most m, ...

Comments

Information & Contributors

Information

Published In

AAMAS '09: Proceedings of The 8th International Conference on Autonomous Agents and Multiagent Systems - Volume 2

May 2009

730 pages

ISBN:9780981738178

General Chairs:
Carles Sierra
Artificial Intelligence Research Institute of the Spanish Research Council (Spain)
,
Cristiano Castelfranchi
ISTC-CNR (Italy)
,
Program Chairs:
Keith S. Decker
University of Delaware
,
Jaime Simão Sichman
Politecnic School, University of São Paulo (Brazil)

Publisher

International Foundation for Autonomous Agents and Multiagent Systems

Richland, SC

Publication History

Published: 10 May 2009

Author Tag

coalitions

Qualifiers

Research-article

Acceptance Rates

Overall Acceptance Rate 1,155 of 5,036 submissions, 23%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

7
Total Citations
View Citations
172
Total Downloads

Downloads (Last 12 months)30
Downloads (Last 6 weeks)2

Reflects downloads up to 22 Dec 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Ismaili AHazon NWatanabe EYokoo MKraus SElkind EVeloso MAgmon NTaylor M(2019)Complexity and Approximations in Robust Coalition Formation via Max-Min k-PartitioningProceedings of the 18th International Conference on Autonomous Agents and MultiAgent Systems10.5555/3306127.3332002(2036-2038)Online publication date: 8-May-2019
https://dl.acm.org/doi/10.5555/3306127.3332002
Skibski OMichalak TRahwan T(2018)Axiomatic characterization of game-theoretic centralityJournal of Artificial Intelligence Research10.1613/jair.1.1120262:1(33-68)Online publication date: 1-May-2018
https://dl.acm.org/doi/10.1613/jair.1.11202
Balliu AFlammini MOlivetti DSingh SMarkovitch S(2017)On pareto optimality in social distance gamesProceedings of the Thirty-First AAAI Conference on Artificial Intelligence10.5555/3298239.3298293(349-355)Online publication date: 4-Feb-2017
https://dl.acm.org/doi/10.5555/3298239.3298293
Sless LHazon NKraus SWooldridge MBazzan AHuhns MLomuscio AScerri P(2014)Forming coalitions and facilitating relationships for completing tasks in social networksProceedings of the 2014 international conference on Autonomous agents and multi-agent systems10.5555/2615731.2615776(261-268)Online publication date: 5-May-2014
https://dl.acm.org/doi/10.5555/2615731.2615776
Aziz HBrandt FSeedig H(2013)Computing desirable partitions in additively separable hedonic gamesArtificial Intelligence10.1016/j.artint.2012.09.006195(316-334)Online publication date: 1-Feb-2013
https://dl.acm.org/doi/10.1016/j.artint.2012.09.006
Bodine-Baron ELee CChong AHassibi BWierman A(2011)Peer effects and stability in matching marketsProceedings of the 4th international conference on Algorithmic game theory10.5555/2050805.2050821(117-129)Online publication date: 17-Oct-2011
https://dl.acm.org/doi/10.5555/2050805.2050821
Aziz HBrandt FSeedig HSonenberg LStone PTumer KYolum P(2011)Stable partitions in additively separable hedonic gamesThe 10th International Conference on Autonomous Agents and Multiagent Systems - Volume 110.5555/2030470.2030497(183-190)Online publication date: 2-May-2011
https://dl.acm.org/doi/10.5555/2030470.2030497

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Index Terms

Recommendations

The effect of collusion in congestion games