Results 211 to 220 of about 25,885 (231)

Graphical Hedonic Games of Bounded Treewidth

Proceedings of the AAAI Conference on Artificial Intelligence, 2016
Hedonic games are a well-studied model of coalition formation, in which selfish agents are partitioned into disjoint sets and agents care about the make-up of the coalition they end up in. The computational problems of finding stable, optimal, or fair outcomes tend to be computationally intractable in even severely restricted instances ...
openaire   +1 more source

Refugee Allocation in the Setting of Hedonic Games

2019
In recent work, Aziz et al. [4] consider refugee allocation as a matching problem, akin to the well-known hospitals-residents problem. They consider a wide range of stability conditions. Hedonic games are a well-studied class of coalition formation games, that encompass the classical matching problems.
Benno Kuckuck, Jörg Rothe, Anke Weißenfeld   +2 more
openaire   +1 more source

Novel Hedonic Games and Lottery Systems

International Joint Conference on Autonomous Agents and Multiagent Systems, 2019
We present here work on two types of matching problems, namely Hedonic Games, also known as Coalition Formation Games, and on quota-based lottery systems such as the one used in Singapore to allocate public housing. We introduce two Hedonic Games, and investigate the computational complexity of finding optimal partitions of agents into coalitions, or ...
openaire   +2 more sources

Nash Stability in Hedonic Skill Games

International Joint Conference on Autonomous Agents and Multiagent Systems
This article deals with hedonic skill games, the strategic counterpart of coalitional skill games which model collaboration among entities through the abstract notions of tasks and the skills required to complete them. We show that deciding whether an instance of the game admits a Nash stable outcome is NP-complete in the weighted tasks setting.
Gourves L., Monaco G.
openaire   +3 more sources

Envy based fairness in hedonic games

Proceedings of the Genetic and Evolutionary Computation Conference Companion, 2018
Hedonic games are coalition formation games where agents have hedonic preferences for coalition structures. The main focus of hedonic games has been on notion of stability. In this paper, however, we consider envy based fairness in hedonic games.
openaire   +1 more source

Computing Stable Outcomes in Hedonic Games

2010
We study the computational complexity of finding stable outcomes in symmetric additively-separable hedonic games. These coalition formation games are specified by an undirected edge-weighted graph: nodes are players, an outcome of the game is a partition of the nodes into coalitions, and the utility of a node is the sum of incident edge weights in the ...
Martin Gairing, Rahul Savani
openaire   +1 more source

An Empirical Distribution of the Number of Subsets in the Core Partitions of Hedonic Games

SN Operations Research Forum, 2021
Sheida Etemadidavan, Andrew J Collins
exaly  

On the price of stability of some simple graph-based hedonic games

Theoretical Computer Science, 2021
Panagiotis Kanellopoulos
exaly  

Hedonic diversity games: A complexity picture with more than two colors

Artificial Intelligence, 2023
Robert Ganian, Thekla Hamm, Dušan Knop
exaly  

Price of Pareto Optimality in hedonic games

Artificial Intelligence, 2020
Angelo Fanelli, Michele Flammini
exaly