English
Related papers

Related papers: Stable Outcomes in Modified Fractional Hedonic Gam…

200 papers

Hedonic games are an archetypal problem in coalition formation, where a set of selfish agents want to partition themselves into stable coalitions. In this work, we focus on two natural constraints on the possible outcomes. First, we require…

Computer Science and Game Theory · Computer Science 2026-03-24 Foivos Fioravantes , Harmender Gahlawat , Nikolaos Melissinos , Šimon Schierreich

In many economic, social and political situations individuals carry out activities in groups (coalitions) rather than alone and on their own. Examples range from households and sport clubs to research networks, political parties and trade…

Computer Science and Game Theory · Computer Science 2012-12-12 Gerhard J. Woeginger

We study coalition formation in the framework of fractional hedonic games (FHGs). The objective is to maximize social welfare in an online model where agents arrive one by one and must be assigned to coalitions immediately and irrevocably.…

Computer Science and Game Theory · Computer Science 2025-10-22 Martin Bullinger , René Romen , Alexander Schlenga

Additively Separable Hedonic Game (ASHG) are coalition-formation games where we are given a graph whose vertices represent $n$ selfish agents and the weight of each edge $uv$ denotes how much agent $u$ gains (or loses) when she is placed in…

Data Structures and Algorithms · Computer Science 2024-02-19 Tesshu Hanaka , Noleen Köhler , Michael Lampis

This paper studies the Nash stability in hedonic coalition formation games. We address the following issue: for a general problem formulation, is there any utility allocation method ensuring a Nash-stable partition? We propose the…

Computer Science and Game Theory · Computer Science 2017-11-02 Cengis Hasan , Jean-Marie Gorce , Eitan Altman

An important aspect in systems of multiple autonomous agents is the exploitation of synergies via coalition formation. In this paper, we solve various open problems concerning the computational complexity of stable partitions in additively…

Computer Science and Game Theory · Computer Science 2015-02-06 Haris Aziz , Felix Brandt , Hans Georg Seedig

This paper considers dyadic-exchange networks in which individual agents autonomously form coalitions of size two and agree on how to split a transferable utility. Valid results for this game include stable (if agents have no unilateral…

Optimization and Control · Mathematics 2014-06-04 Dean Richert , Jorge Cortes

We study how stability can be maintained even after any set of at most k players leave their groups, in the context of hedonic games. While stability properties ensure an outcome to be robust against players' deviations, it has not been…

Computer Science and Game Theory · Computer Science 2019-03-21 Ayumi Igarashi , Kazunori Ota , Yuko Sakurai , Makoto Yokoo

Nguyen et al. [1] introduced altruistic hedonic games in which agents' utilities depend not only on their own preferences but also on those of their friends in the same coalition. We propose to extend their model to coalition formation…

Computer Science and Game Theory · Computer Science 2023-01-16 Anna Maria Kerkmann , Simon Cramer , Jörg Rothe

We initiate the study of control in hedonic games, where an external actor influences coalition formation by adding or deleting agents. We consider three basic control goals (1) enforcing that an agent is not alone (NA); (2) enforcing that…

Computer Science and Game Theory · Computer Science 2026-02-24 Jiehua Chen , Jakob Guttmann , Merisa Mustajbašić , Sofia Simola

We consider a team formation setting where agents have varying levels of expertise in a global set of required skills, and teams are ranked with respect to how well the expertise of teammates complement each other. We model this setting as…

Computer Science and Game Theory · Computer Science 2020-11-04 Bugra Caskurlu , Fatih Erdem Kizilkaya , Berkehan Ozen

We study relationships between different relaxed notions of core stability in hedonic games, which are a class of coalition formation games. Our unified approach applies to a newly introduced family of hedonic games, called $\alpha$-hedonic…

Computer Science and Game Theory · Computer Science 2024-12-10 Tom Demeulemeester , Jannik Peters

We study coalition structure formation with intra and inter-coalition externalities in the introduced family of nested non-cooperative simultaneous finite games. A non-cooperative game embeds a coalition structure formation mechanism, and…

Computer Science and Game Theory · Computer Science 2021-07-05 Dmitry Levando

This paper investigates the potential benefits of cooperation in scenarios where finitely many agents compete for shared resources, leading to congestion and thereby reduced rewards. By appropriate coordination the members of the…

Computer Science and Game Theory · Computer Science 2024-10-10 Riya Sultana , Veeraruna Kavitha

Distributed Nash equilibrium (NE) seeking problem for multi-coalition games has attracted increasing attention in recent years, but the research mainly focuses on the case without agreement demand within coalitions. This paper considers a…

Optimization and Control · Mathematics 2021-12-10 Jialing Zhou , Yuezu Lv , Guanghui Wen , Jinhu Lv , Dezhi Zheng

An important task in the analysis of multiagent systems is to understand how groups of selfish players can form coalitions, i.e., work together in teams. In this paper, we study the dynamics of coalition formation under bounded rationality.…

Computer Science and Game Theory · Computer Science 2011-03-03 John Augustine , Ning Chen , Edith Elkind , Angelo Fanelli , Nick Gravin , Dmitry Shiryaev

Hedonic games formalize coalition formation scenarios where players evaluate an outcome based on the coalition they are contained in. Due to a large number of possible coalitions, compact representations of these games are crucial. We…

Computer Science and Game Theory · Computer Science 2022-02-01 Anja Rey , Lisa Rey

We propose an abstract approach to coalition formation that focuses on simple merge and split rules transforming partitions of a group of players. We identify conditions under which every iteration of these rules yields a unique partition.…

Computer Science and Game Theory · Computer Science 2009-03-03 Krzysztof R. Apt , Andreas Witzel

Autonomous wireless agents such as unmanned aerial vehicles or mobile base stations present a great potential for deployment in next-generation wireless networks. While current literature has been mainly focused on the use of agents within…

Information Theory · Computer Science 2016-11-17 Walid Saad , Zhu Han , Tamer Basar , Merouane Debbah , Are Hjørungnes

We introduce a natural variant of weighted voting games, which we refer to as k-Prize Weighted Voting Games. Such games consist of n players with weights, and k prizes, of possibly differing values. The players form coalitions, and the i-th…

Computer Science and Game Theory · Computer Science 2023-03-03 Wei-Chen Lee , David Hyland , Alessandro Abate , Edith Elkind , Jiarui Gan , Julian Gutierrez , Paul Harrenstein , Michael Wooldridge