Stable and Pareto optimal group activity selection from ordinal preferences
type: Item
instance of: scholarly article
title: Stable and Pareto optimal group activity selection from ordinal preferences
zbMATH Open document ID: 1418.91038
author: Andreas Darmann
published in: International Journal of Game Theory
publication date: 2018-12-28T00:00:00Z
Mathematics Subject Classification ID: 91A12
Mathematics Subject Classification ID: 91B08
Mathematics Subject Classification ID: 91-04
zbMATH DE Number: 6997136
zbMATH Keywords: GASP
zbMATH Keywords: complexity
zbMATH Keywords: ordinal preferences
zbMATH Keywords: stable assignment
MaRDI profile type: Publication
full work available at URL: s00182-018-0612-3
OpenAlex ID: W2792014113
cites work: Q3056948
cites work: Computing desirable partitions in additively separable hedonic games
cites work: Pareto optimality in coalition formation
cites work: NP-completeness in hedonic games
cites work: Core in a simple coalition formation game
cites work: The stability of hedonic coalition structures
cites work: A social choice approach to ordinal group activity selection
cites work: Group activity selection problem with approval preferences
cites work: Simple priorities and core stability in hedonic games
cites work: On the complexity of comparing evolutionary trees
cites work: The roommates problem revisited
cites work: Nash Stability in Additively Separable Hedonic Games Is NP-Hard
cites work: Roles and Teams Hedonic Game
DOI: 10.1007/S00182-018-0612-3
description: scientific article; zbMATH DE number 6997136