Hedonic Coalition Formation in Networks

Coalition formation is a fundamental problem in the organization of many multi-agent systems. In large populations, the formation of coalitions is often restricted by structural visibility and locality constraints under which agents can reorganize. We capture and study this aspect using a novel network-based model for dynamic locality within the popular framework of hedonic coalition formation games. We analyze the effects of network-based visibility and structure on the convergence of coalition formation processes to stable states. Our main result is a tight characterization of the structures based on which dynamic coalition formation can stabilize quickly. Maybe surprisingly, polynomial-time convergence can be achieved if and only if coalition formation is based on complete or star graphs.

[1]  Martin Hoefer,et al.  Local matching dynamics in social networks , 2011, Inf. Comput..

[2]  Jana Hajduková,et al.  Coalition Formation Games: a Survey , 2006, IGTR.

[3]  Martin Hoefer,et al.  Locally Stable Marriage with Strict Preferences , 2012, SIAM J. Discret. Math..

[4]  Xuemin Shen,et al.  Handbook of Peer-to-Peer Networking , 2009 .

[5]  David Manlove,et al.  The Stable Roommates Problem with Globally Ranked Pairs , 2007, WINE.

[6]  Martin Hoefer,et al.  Matching Dynamics with Constraints , 2014, WINE.

[7]  Roger B. Myerson,et al.  Graphs and Cooperation in Games , 1977, Math. Oper. Res..

[8]  Matthew O. Jackson,et al.  The Stability of Hedonic Coalition Structures , 2002, Games Econ. Behav..

[9]  Haris Aziz,et al.  Existence of stability in hedonic coalition formation games , 2012, AAMAS.

[10]  J. Drèze,et al.  HEDONIC COALITIONS: OPTIMALITY AND STABILITY , 1980 .

[11]  Katarína Cechlárová.  Stable Partition Problem , 2016, Encyclopedia of Algorithms.

[12]  Edith Elkind,et al.  Bounding the Cost of Stability in Games over Interaction Networks , 2013, AAAI.

[13]  William S. Zwicker,et al.  Coalition formation games with separable preferences , 2003, Math. Soc. Sci..

[14]  Paul Harrenstein,et al.  Fractional Hedonic Games , 2014, AAMAS.

[15]  F. Mathieu.  Acyclic Preference-Based Systems , 2010 .

[16]  Stefano Leucci,et al.  Locality-based network creation games , 2014, SPAA.

[17]  Stefano Leucci,et al.  Locality-Based Network Creation Games , 2016, ACM Trans. Parallel Comput..

[18]  G. Owen.  Values of graph-restricted games , 1986 .

[19]  David Manlove,et al.  Socially Stable Matchings in the Hospitals/Residents Problem , 2013, WADS.

[20]  Sergei Vassilvitskii,et al.  Social Networks and Stable Matchings in the Job Market , 2009, WINE.

[21]  Rahul Savani,et al.  Computing Stable Outcomes in Hedonic Games , 2010, SAGT.

[22]  Felix Brandt,et al.  Stable partitions in additively separable hedonic games , 2011, AAMAS.

[23]  Eric McDermid,et al.  Maximum Locally Stable Matchings , 2013, Algorithms.

[24]  Tayfun Sönmez,et al.  Core in a simple coalition formation game , 2001, Soc. Choice Welf..