Hedonic diversity games revisited

DOI10.1007/978-3-030-87756-9_23OpenAlexW3209945420MaRDI QIDQ2695455

Andreas Darmann

Publication date: 31 March 2023

Full work available at URL: https://doi.org/10.1007/978-3-030-87756-9_23

zbMATH Keywords

computational complexitycoalition formationstable outcomesapproval and Borda scores

Mathematics Subject Classification ID

Decision theory (91B06) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Resource and cost allocation (including fair division, apportionment, etc.) (91B32) Social choice (91B14) Matching models (91B68)

Related Items (2)

Hedonic diversity games: a complexity picture with more than two colors ⋮ Stability and welfare in (dichotomous) hedonic diversity games

Cites Work

• Unnamed Item
• Maximizing Nash product social welfare in allocating indivisible goods
• The stability of hedonic coalition structures
• Clustering to minimize the maximum intercluster distance
• A social choice approach to ordinal group activity selection
• NP-completeness in hedonic games
• The traveling group problem
• Nash Stability in Fractional Hedonic Games
• Hedonic Coalitions: Optimality and Stability
• Handbook of Computational Social Choice

This page was built for publication: Hedonic diversity games revisited