Local fairness in hedonic games via individual threshold coalitions

DOI10.1016/j.tcs.2021.03.027OpenAlexW3146946551MaRDI QIDQ2034790

Nhan-Tam Nguyen, Jörg Rothe, Anna Maria Kerkmann

Publication date: 23 June 2021

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2021.03.027

zbMATH Keywords

fairnesscomputational complexitycooperative game theorycoalition formationhedonic gameprice of local fairness

Mathematics Subject Classification ID

Cooperative games (91A12)

Related Items

In memory of Jérôme Monnot

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Distributed fair allocation of indivisible goods
• Computing desirable partitions in additively separable hedonic games
• Hedonic coalition formation games: a new stability notion
• The efficiency of fair division
• The stability of hedonic coalition structures
• Clustering to minimize the maximum intercluster distance
• Stability in coalition formation games
• On maximin share allocations in matroids
• Approximate maximin shares for groups of agents
• NP-completeness in hedonic games
• The roommates problem revisited
• Borda-induced hedonic games with friends, enemies, and neutral players
• Core in a simple coalition formation game
• Simple priorities and core stability in hedonic games
• A survey of approximability and inapproximability results for social welfare optimization in multiagent resource allocation
• Nash Stability in Fractional Hedonic Games
• The Price of Fairness
• COALITION FORMATION GAMES: A SURVEY
• Approximation Algorithms for Computing Maximin Share Allocations
• Fairness and Rank-Weighted Utilitarianism in Resource Allocation
• Hedonic Coalitions: Optimality and Stability
• Fair Allocation of Indivisible Goods
• Hedonic Games

This page was built for publication: Local fairness in hedonic games via individual threshold coalitions