Strategy-proofness, solidarity, and consistency for multiple assignment problems
type: Item
instance of: scholarly article
title: Strategy-proofness, solidarity, and consistency for multiple assignment problems
zbMATH Open document ID: 1083.91046
author: Bettina Klaus
author: Eiichi Miyagawa
published in: International Journal of Game Theory
publication date: 2003-11-23T00:00:00Z
Mathematics Subject Classification ID: 91A40
Mathematics Subject Classification ID: 91B14
Mathematics Subject Classification ID: 91B32
zbMATH DE Number: 2006694
zbMATH Keywords: Serial dictatorship
zbMATH Keywords: strategy-proofness
zbMATH Keywords: population-monotonicity
zbMATH Keywords: consistency
MaRDI profile type: Publication
full work available at URL: s001820100088
OpenAlex ID: W1987891901
DOI: 10.1007/S001820100088
Recommended article: Coalitional strategy-proof and resource-monotonic solutions for multiple assignment problems
Recommended article: Efficiency and strategy-proofness in object assignment problems with multi-demand preferences
Recommended article: Strategy-proof stochastic assignment
Recommended article: Strategy-proof assignment on the full preference domain
Recommended article: Upper-contour strategy-proofness in the probabilistic assignment problem
Recommended article: Partial strategyproofness: relaxing strategyproofness for the random assignment problem
Recommended article: Strategy-proof assignment of multiple resources
Recommended article: Strategy-proofness and identical preferences lower bound in allocation problem of indivisible objects
Recommended article: Efficiency and strategy-proofness in multi-unit object allocation problems with non-quasi-linear preferences: a positive result
Recommended article: Consistency and monotonicity in assignment problems
description: scientific article; zbMATH DE number 2006694