On Pareto optimality in social distance games
From MaRDI portal
Publication:2093365
DOI10.1016/j.artint.2022.103768OpenAlexW2604324589MaRDI QIDQ2093365
Dennis Olivetti, Giovanna Melideo, Alkida Balliu, 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
Related Items
Cites Work
- Unnamed Item
- Computing desirable partitions in additively separable hedonic games
- On proportional allocation in hedonic games
- The stability of hedonic coalition structures
- Nash stability in additively separable hedonic games and community structures
- Computational complexity in additive hedonic games
- Clustering to minimize the maximum intercluster distance
- Harmony in the small-world
- On the price of stability of social distance games
- Strategyproof mechanisms for additively separable hedonic games and fractional hedonic games
- Price of Pareto optimality in hedonic games
- Optimal partition of a tree with social distance
- Core in a simple coalition formation game
- Simple priorities and core stability in hedonic games
- Pareto optimality in coalition formation
- Nash Stability in Fractional Hedonic Games
- Computing Stable Outcomes in Hedonic Games
- The Price of Stability for Network Design with Fair Cost Allocation
- Hedonic Coalitions: Optimality and Stability
- On the Complexity of Cooperative Solution Concepts
- On Non-Cooperativeness in Social Distance Games
- Axioms for Centrality
- Hedonic Games
- Selfish Routing in Capacitated Networks
This page was built for publication: On Pareto optimality in social distance games
