A unified framework for strong price of anarchy in clustering games
From MaRDI portal
(Redirected from Publication:3449509)
Recommendations
Cites work
- Algorithmic Game Theory
- Anti-coordination games and stable graph colorings
- Coordination games on graphs (extended abstract)
- Core in a simple coalition formation game
- Correlation clustering
- Farsighted stability in hedonic games
- Hedonic Coalitions: Optimality and Stability
- Nash stability in fractional hedonic games
- Noncooperative formation of coalitions in hedonic games
- On coalition formation: durable coalition structures.
- Potential games
- Strong price of anarchy
- Strong price of anarchy, utility games and coalitional dynamics
- The max k-cut game and its strong equilibria
- The stability of hedonic coalition structures
- Worst-case equilibria
Cited in
(9)- On the price of stability of social distance games
- Coordination games on graphs
- Price of Pareto optimality in hedonic games
- Strong price of anarchy, utility games and coalitional dynamics
- Computing stable coalitions: approximation algorithms for reward sharing
- A Game-Theoretic Approach to Pairwise Clustering and Matching
- Generalized graph k-coloring games
- On the performance of mildly greedy players in k-coloring games
- Topological price of anarchy bounds for clustering games on networks
This page was built for publication: A unified framework for strong price of anarchy in clustering games
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3449509)