On Pareto optimality in social distance games
From MaRDI portal
Publication:2093365
Cites work
- Axioms for Centrality
- Clustering to minimize the maximum intercluster distance
- Computational complexity in additive hedonic games
- Computing Stable Outcomes in Hedonic Games
- Computing desirable partitions in additively separable hedonic games
- Core in a simple coalition formation game
- Harmony in the small-world
- Hedonic Coalitions: Optimality and Stability
- Hedonic games
- Nash stability in additively separable hedonic games and community structures
- Nash stability in fractional hedonic games
- On non-cooperativeness in social distance games
- On proportional allocation in hedonic games
- On the Complexity of Cooperative Solution Concepts
- On the price of stability of social distance games
- Optimal partition of a tree with social distance
- Pareto optimality in coalition formation
- Price of Pareto optimality in hedonic games
- Selfish Routing in Capacitated Networks
- Simple priorities and core stability in hedonic games
- Strategyproof mechanisms for additively separable hedonic games and fractional hedonic games
- The Price of Stability for Network Design with Fair Cost Allocation
- The stability of hedonic coalition structures
- Worst-case equilibria
Cited in
(3)
This page was built for publication: On Pareto optimality in social distance games
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2093365)