A Unified Framework for Strong Price of Anarchy in Clustering Games
From MaRDI portal
Publication:3449509
DOI10.1007/978-3-662-47666-6_48zbMath1404.68078MaRDI QIDQ3449509
Michal Feldman, Ophir Friedler
Publication date: 4 November 2015
Published in: Automata, Languages, and Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-662-47666-6_48
Related Items
Generalized graph \(k\)-coloring games, Topological price of anarchy bounds for clustering games on networks, Coordination games on graphs, Price of Pareto optimality in hedonic games, Computing Stable Coalitions: Approximation Algorithms for Reward Sharing
Cites Work
- Unnamed Item
- Unnamed Item
- Noncooperative formation of coalitions in hedonic games
- The stability of hedonic coalition structures
- Correlation clustering
- On coalition formation: durable coalition structures.
- Potential games
- Core in a simple coalition formation game
- Farsighted stability in hedonic games
- Anti-coordination Games and Stable Graph Colorings
- Coordination Games on Graphs (Extended Abstract)
- Nash Stability in Fractional Hedonic Games
- Strong Price of Anarchy, Utility Games and Coalitional Dynamics
- The Max k-Cut Game and Its Strong Equilibria
- Hedonic Coalitions: Optimality and Stability
- Algorithmic Game Theory