On Pareto optimality in social distance games
From MaRDI portal
Publication:2093365
DOI10.1016/J.ARTINT.2022.103768OpenAlexW2604324589MaRDI QIDQ2093365FDOQ2093365
Authors: Alkida Balliu, Giovanna Melideo, Dennis Olivetti, Michele Flammini 
Publication date: 8 November 2022
Published in: Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.artint.2022.103768
Cites Work
- Worst-case equilibria
- Selfish Routing in Capacitated Networks
- Core in a simple coalition formation game
- The Price of Stability for Network Design with Fair Cost Allocation
- The stability of hedonic coalition structures
- Clustering to minimize the maximum intercluster distance
- On the Complexity of Cooperative Solution Concepts
- Computational complexity in additive hedonic games
- Simple priorities and core stability in hedonic games
- Computing desirable partitions in additively separable hedonic games
- Hedonic Coalitions: Optimality and Stability
- Harmony in the small-world
- Computing Stable Outcomes in Hedonic Games
- On proportional allocation in hedonic games
- Nash stability in additively separable hedonic games and community structures
- Axioms for Centrality
- Pareto optimality in coalition formation
- On the price of stability of social distance games
- Nash stability in fractional hedonic games
- On non-cooperativeness in social distance games
- Strategyproof mechanisms for additively separable hedonic games and fractional hedonic games
- Hedonic games
- Price of Pareto optimality in hedonic games
- Optimal partition of a tree with social distance
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)
