Computing desirable partitions in additively separable hedonic games

From MaRDI portal
Publication:360127

DOI10.1016/j.artint.2012.09.006zbMath1270.91010OpenAlexW2102617746MaRDI QIDQ360127

Hans Georg Seedig, Felix Brandt, Haris Aziz

Publication date: 26 August 2013

Published in: Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: http://www.sciencedirect.com/science/article/pii/S000437021200118X




Related Items (25)

Altruistic Hedonic GamesToward the complexity of the existence of wonderfully stable partitions and strictly core stable coalition structures in enemy-oriented hedonic gamesA social choice approach to ordinal group activity selectionForming \(k\) coalitions and facilitating relationships in social networksCoordination games on graphsAdditively separable hedonic games with social contextFinding and Recognizing Popular Coalition StructuresThe three-dimensional stable roommates problem with additively separable preferencesEfficient Equilibria in Polymatrix Coordination GamesComputing Stable Outcomes in Symmetric Additively Separable Hedonic GamesTopological distance gamesDynamics in matching and coalition formation games with structural constraintsOn non-trivial Nash stable partitions in additive hedonic games with symmetric 0/1-utilitiesTwo hardness results for core stability in hedonic coalition formation gamesOn the price of stability of some simple graph-based hedonic gamesDuplication monotonicity in the allocation of indivisible goodsStable and Pareto optimal group activity selection from ordinal preferencesLocal fairness in hedonic games via individual threshold coalitionsCoalitional games induced by matching problems: complexity and islands of tractability for the Shapley valuePrice of Pareto optimality in hedonic gamesThe Price of Stability of Simple Symmetric Fractional Hedonic GamesAnswers set programs for non-transferable utility games: expressiveness, complexity and applicationsBorda-induced hedonic games with friends, enemies, and neutral playersStrategyproof Mechanisms for Additively Separable and Fractional Hedonic GamesOn Pareto optimality in social distance games




This page was built for publication: Computing desirable partitions in additively separable hedonic games