Computing Stable Outcomes in Hedonic Games

DOI10.1007/978-3-642-16170-4_16MaRDI QIDQ3162517zbMATH OpenOpenAlexFDO

Authors Martin Gairing, Rahul Savani

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

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

Recommendations

• Computing Stable Outcomes in Symmetric Additively Separable Hedonic Games
• Computational complexity in additive hedonic games
• Computing equilibria in multi-player games
• Computing Simply Stable Equilibria
• Farsighted stability in hedonic games
• On myopic stability concepts for hedonic games
• Computing Equilibria of Dynamic Games
• On the price of stability of some simple graph-based hedonic games
• Computing equilibria in discounted dynamic games

Cites work

• Approximate Local Search in Combinatorial Optimization
• Coalition formation games with separable preferences.
• Computational complexity in additive hedonic games
• Convergence and Approximation in Potential Games
• Hedonic Coalitions: Optimality and Stability
• How easy is local search?
• scientific article; zbMATH DE number 5595162 (Why is no real title available?)
• scientific article; zbMATH DE number 1016966 (Why is no real title available?)
• Local search: simple, successful, but sometimes sluggish
• NP-completeness in hedonic games
• On the Power of Nodes of Degree Four in the Local Max-Cut Problem
• Simple Local Search Problems that are Hard to Solve
• The stability of hedonic coalition structures

Cited in

(22)

• Computational complexity in additive hedonic games
• Coordination games on graphs
• Dynamics in matching and coalition formation games with structural constraints
• On Pareto optimality in social distance games
• On a simple hedonic game with graph-restricted communication
• Hedonic expertise games
• The Parallel Complexity of Coloring Games
• The price of stability of simple symmetric fractional hedonic games
• Selfish transportation games
• Settling the complexity of local max-cut (almost) completely
• Computing desirable partitions in additively separable hedonic games
• On non-trivial Nash stable partitions in additive hedonic games with symmetric 0/1-utilities
• Nash stable outcomes in fractional hedonic games: existence, efficiency and computation
• Dynamics of Profit-Sharing Games
• Coordination games on weighted directed graphs
• Unique End of Potential Line
• Computing Stable Outcomes in Symmetric Additively Separable Hedonic Games
• Generalized graph k-coloring games
• Hedonic diversity games: a complexity picture with more than two colors
• Node-max-cut and the complexity of equilibrium in linear weighted congestion games
• From Leiden to pleasure island: the constant Potts model for community detection as a hedonic game
• Nash stability in additively separable hedonic games and community structures

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3162517)