Computing Stable Outcomes in Symmetric Additively Separable Hedonic Games

DOI10.1287/moor.2018.0960zbMath1437.91018arXiv1509.05322OpenAlexW2963693668WikidataQ127737652 ScholiaQ127737652MaRDI QIDQ5108232

Martin Gairing, Rahul Savani

Publication date: 30 April 2020

Published in: Mathematics of Operations Research (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1509.05322

zbMATH Keywords

local searchvotingcoalition formationhedonic gamesPLS-completeness

Mathematics Subject Classification ID

Noncooperative games (91A10) Games involving graphs (91A43) Voting theory (91B12) Algorithmic game theory and complexity (91A68)

Related Items (5)

Distance hedonic games ⋮ Unique end of potential line ⋮ On the price of stability of some simple graph-based hedonic games ⋮ Strategyproof mechanisms for friends and enemies games ⋮ Strategyproof Mechanisms for Additively Separable and Fractional Hedonic Games

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Computing desirable partitions in additively separable hedonic games
• Hedonic coalition formation games: a new stability notion
• Noncooperative formation of coalitions in hedonic games
• The stability of hedonic coalition structures
• Researching with whom? Stability and manipulation
• On top responsiveness and strict core stability
• Computational complexity in additive hedonic games
• How easy is local search?
• Coalition formation games with separable preferences.
• NP-completeness in hedonic games
• A hardness result for core stability in additive hedonic games
• Precise complexity of the core in dichotomous and additive hedonic games
• On myopic stability concepts for hedonic games
• Core in a simple coalition formation game
• Simple priorities and core stability in hedonic games
• Pareto optimality in coalition formation
• Settling the Complexity of Local Max-Cut (Almost) Completely
• Computing Stable Outcomes in Hedonic Games
• Simple Local Search Problems that are Hard to Solve
• The Price of Stability for Network Design with Fair Cost Allocation
• On the Power of Nodes of Degree Four in the Local Max-Cut Problem
• The complexity of pure Nash equilibria
• Local Search: Simple, Successful, But Sometimes Sluggish
• Hedonic Coalitions: Optimality and Stability
• Nash Stable Outcomes in Fractional Hedonic Games: Existence, Efficiency and Computation
• Approximate Local Search in Combinatorial Optimization
• Hedonic Games
• Convergence and Approximation in Potential Games

This page was built for publication: Computing Stable Outcomes in Symmetric Additively Separable Hedonic Games