English
Related papers

Related papers: Friend- and Enemy-oriented Hedonic Games With Stra…

200 papers

We study uncoordinated matching markets with additional local constraints that capture, e.g., restricted information, visibility, or externalities in markets. Each agent is a node in a fixed matching network and strives to be matched to…

Computer Science and Game Theory · Computer Science 2014-09-16 Martin Hoefer , Lisa Wagner

In this paper, we study non-obvious manipulability (NOM), a relaxed form of strategyproofness, in the context of Hedonic Games (HGs) with Friends Appreciation (FA) preferences. In HGs, the aim is to partition agents into coalitions…

Computer Science and Game Theory · Computer Science 2025-01-03 Michele Flammini , Maria Fomenko , Giovanna Varricchio

In hedonic diversity games (HDGs), recently introduced by Bredereck, Elkind and Igarashi (2019), each agent belongs to one of two classes (men and women, vegetarians and meat-eaters, junior and senior researchers), and agents' preferences…

Computer Science and Game Theory · Computer Science 2019-11-21 Niclas Boehmer , Edith Elkind

We consider the complexity of maximizing egalitarian welfare in Friends and Enemies Games -- a subclass of hedonic games in which every agent partitions other agents into friends and enemies. We investigate two classic scenarios proposed in…

Computer Science and Game Theory · Computer Science 2025-12-24 Edith Elkind , Michele Flammini , Giovanna Varricchio

Additively separable hedonic games and fractional hedonic games have received considerable attention. They are coalition forming games of selfish agents based on their mutual preferences. Most of the work in the literature characterizes the…

Artificial Intelligence · Computer Science 2017-06-29 Michele Flammini , Gianpiero Monaco , Qiang Zhang

We consider coalition formation games in which each player has preferences over the other players and his preferences over coalitions are based on the best player ($\mathcal{B}$-/B-hedonic games) or the worst player ($\mathcal{W}$/W-hedonic…

Computer Science and Game Theory · Computer Science 2011-12-06 Haris Aziz , Paul Harrenstein , Evangelia Pyrga

In hedonic games, players form coalitions based on individual preferences over the group of players they could belong to. Several concepts to describe the stability of coalition structures in a game have been proposed and analysed in the…

Computer Science and Game Theory · Computer Science 2021-07-30 Hendrik Fichtenberger , Anja Rey

In coalition formation games self-organized coalitions are created as a result of the strategic interactions of independent agents. For each couple of agents $(i,j)$, weight $w_{i,j}=w_{j,i}$ reflects how much agents $i$ and $j$ benefit…

Computer Science and Game Theory · Computer Science 2018-04-19 Gianpiero Monaco , Luca Moscardelli , Yllka Velaj

We study hedonic games with dichotomous preferences. Hedonic games are cooperative games in which players desire to form coalitions, but only care about the makeup of the coalitions of which they are members; they are indifferent about the…

Computer Science and Game Theory · Computer Science 2015-09-24 Haris Aziz , Paul Harrenstein , Jérôme Lang , Michael Wooldridge

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

Hedonic games are fundamental models for investigating the formation of coalitions among a set of strategic agents, where every agent has a certain utility for every possible coalition of agents it can be part of. To avoid the…

Computer Science and Game Theory · Computer Science 2026-02-17 Merlin de la Haye , Pascal Lenzner , Farehe Soheil , Marcus Wunderlich

In this paper, we study a variant of hedonic games, called \textsc{Seat Arrangement}. The model is defined by a bijection from agents with preferences for each other to vertices in a graph $G$. The utility of an agent depends on the…

Computer Science and Game Theory · Computer Science 2025-07-30 Hans L. Bodlaender , Tesshu Hanaka , Lars Jaffke , Hirotaka Ono , Yota Otachi , Tom C. van der Zanden

Hedonic games provide a general model of coalition formation, in which a set of agents is partitioned into coalitions, with each agent having preferences over which other players are in her coalition. We prove that with additively separable…

Computer Science and Game Theory · Computer Science 2017-06-05 Dominik Peters

Coalition formation is concerned with the question of how to partition a set of agents into disjoint coalitions according to their preferences. Deviating from most of the previous work, we consider an online variant of the problem, where…

Computer Science and Game Theory · Computer Science 2025-03-11 Martin Bullinger , René Romen

A community needs to be partitioned into disjoint groups; each community member has an underlying preference over the groups that they would want to be a member of. We are interested in finding a stable community structure: one where no…

Computer Science and Game Theory · Computer Science 2018-11-13 Ayumi Igarashi , Jakub Sliwinski , Yair Zick

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

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

Coalition formation studies how to partition a set of agents into disjoint coalitions under consideration of their preferences. We study the classical objective of stability in a variant of additively separable hedonic games where agents…

Computer Science and Game Theory · Computer Science 2026-02-25 Fabian Frank , Matija Novaković , René Romen

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 introduce a two-player game involving two tokens located at points of a fixed set. The players take turns to move a token to an unoccupied point in such a way that the distance between the two tokens is decreased. Optimal strategies for…

Probability · Mathematics 2016-04-13 Maria Deijfen , Alexander E. Holroyd , James B. Martin