Computing Stable Outcomes in Hedonic Games

DOI10.1007/978-3-642-16170-4_16zbMath1310.91042OpenAlexW3138175020MaRDI QIDQ3162517

Rahul Savani, Martin Gairing

Publication date: 19 October 2010

Published in: Algorithmic Game Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-16170-4_16

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Games involving graphs (91A43) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (14)

Coordination Games on Weighted Directed Graphs ⋮ Coordination games on graphs ⋮ Hedonic expertise games ⋮ Computing Stable Outcomes in Symmetric Additively Separable Hedonic Games ⋮ Selfish Transportation Games ⋮ Dynamics in matching and coalition formation games with structural constraints ⋮ On non-trivial Nash stable partitions in additive hedonic games with symmetric 0/1-utilities ⋮ Settling the Complexity of Local Max-Cut (Almost) Completely ⋮ Generalized graph \(k\)-coloring games ⋮ The Parallel Complexity of Coloring Games ⋮ The Price of Stability of Simple Symmetric Fractional Hedonic Games ⋮ Unique End of Potential Line ⋮ Dynamics of Profit-Sharing Games ⋮ On Pareto optimality in social distance games

Cites Work

• Unnamed Item
• Unnamed Item
• The stability of hedonic coalition structures
• Computational complexity in additive hedonic games
• How easy is local search?
• Coalition formation games with separable preferences.
• NP-completeness in hedonic games
• Simple Local Search Problems that are Hard to Solve
• On the Power of Nodes of Degree Four in the Local Max-Cut Problem
• Local Search: Simple, Successful, But Sometimes Sluggish
• Hedonic Coalitions: Optimality and Stability
• Approximate Local Search in Combinatorial Optimization
• Convergence and Approximation in Potential Games

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