Stable and Pareto optimal group activity selection from ordinal preferences

DOI10.1007/s00182-018-0612-3zbMath1418.91038OpenAlexW2792014113MaRDI QIDQ1757088

Andreas Darmann

Publication date: 28 December 2018

Published in: International Journal of Game Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00182-018-0612-3

zbMATH Keywords

complexityordinal preferencesstable assignmentGASP

Mathematics Subject Classification ID

Cooperative games (91A12) Individual preferences (91B08) Software, source code, etc. for problems pertaining to game theory, economics, and finance (91-04)

Related Items (3)

Simplified group activity selection with group size constraints ⋮ A social choice approach to ordinal group activity selection ⋮ Manipulability in a group activity selection problem

Cites Work

• Unnamed Item
• Computing desirable partitions in additively separable hedonic games
• The stability of hedonic coalition structures
• Group activity selection problem with approval preferences
• A social choice approach to ordinal group activity selection
• NP-completeness in hedonic games
• The roommates problem revisited
• Core in a simple coalition formation game
• Simple priorities and core stability in hedonic games
• Pareto optimality in coalition formation
• Roles and Teams Hedonic Game
• Nash Stability in Additively Separable Hedonic Games Is NP-Hard
• On the complexity of comparing evolutionary trees

This page was built for publication: Stable and Pareto optimal group activity selection from ordinal preferences