A social choice approach to ordinal group activity selection
type: Item
instance of: scholarly article
title: A social choice approach to ordinal group activity selection
zbMATH Open document ID: 1393.91054
author: Andreas Darmann
published in: Mathematical Social Sciences
publication date: 2018-06-20T00:00:00Z
Mathematics Subject Classification ID: 91B14
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 6891896
zbMATH Keywords: social choice
zbMATH Keywords: ordinal group activity
zbMATH Keywords: Borda scores
zbMATH Keywords: Condorcet criterion
MaRDI profile type: Publication
full work available at URL: j.mathsocsci.2018.01.005
OpenAlex ID: W2792753607
cites work: Popular matchings
cites work: Computing desirable partitions in additively separable hedonic games
cites work: NP-completeness in hedonic games
cites work: Core in a simple coalition formation game
cites work: Q5282956
cites work: Popular Matchings in the Marriage and Roommates Problems
cites work: The stability of hedonic coalition structures
cites work: Handbook of social choice and welfare. Vol. 1.
cites work: How hard is it to tell which is a Condorcet committee?
cites work: Group Activity Selection from Ordinal Preferences
cites work: It is difficult to tell if there is a Condorcet spanning tree
cites work: Stable and Pareto optimal group activity selection from ordinal preferences
cites work: The Monotone Satisfiability Problem with Bounded Variable Appearances
cites work: Maximizing Nash product social welfare in allocating indivisible goods
cites work: Simple priorities and core stability in hedonic games
cites work: Condorcet winning sets
cites work: An Analysis of Simple Voting Systems for Electing Committees
cites work: The Condorcet criterion and committee selection
cites work: On the complexity of comparing evolutionary trees
cites work: Popular matchings in the stable marriage problem
cites work: Sets of alternatives as Condorcet winners
cites work: The traveling group problem
cites work: Nash Stability in Additively Separable Hedonic Games Is NP-Hard
cites work: Roles and Teams Hedonic Game
cites work: Popular ranking
DOI: 10.1016/J.MATHSOCSCI.2018.01.005
description: scientific article; zbMATH DE number 6891896