Probabilistic assignment: an extension approach
type: Item
instance of: scholarly article
title: Probabilistic assignment: an extension approach
zbMATH Open document ID: 1397.91301
author: Wonki Jo Cho
published in: Social Choice and Welfare
publication date: 2018-07-05T00:00:00Z
full work available at URL: probabilistic-assignment-an-extension-approach(afe0a8cd-4ff8-4c8d-a2fa-da99703945fe).html
Mathematics Subject Classification ID: 91B32
zbMATH DE Number: 6898720
zbMATH Keywords: probabilistic assignment
zbMATH Keywords: bject allocation
zbMATH Keywords: lotteries
zbMATH Keywords: lexicographic preferences
MaRDI profile type: Publication
OpenAlex ID: W2539856977
cites work: Two axiomatic approaches to the probabilistic serial mechanism
cites work: Q5834711
cites work: Random assignment: redefining the serial rule
cites work: Probabilistic assignment of objects: characterizing the serial rule
cites work: A new solution to the random assignment problem.
cites work: Risk aversion and risk vulnerability in the continuous and discrete case
cites work: Q4797834
cites work: Asymptotic Equivalence of Probabilistic Serial and Random Priority Mechanisms
cites work: Q5561637
cites work: Incentive properties for ordinal mechanisms
cites work: When is the probabilistic serial assignment uniquely efficient and envy-free?
cites work: Equivalence of efficiency notions for ordinal assignment problems
cites work: Manipulation of Schemes that Mix Voting with Chance
cites work: Probabilistic assignment of indivisible goods with single-peaked preferences
cites work: A solution to the random assignment problem on the full preference domain
cites work: Why do popular mechanisms lack efficiency in random environments?
cites work: Random assignment of multiple indivisible objects
cites work: Incentives in the probabilistic serial mechanism
cites work: Risk Aversion in the Small and in the Large
cites work: A note on object allocation under lexicographic preferences
cites work: A sufficient condition for the equivalence of strategy-proofness and nonmanipulability by preferences adjacent to the sincere one
cites work: Q5817856
cites work: Q5844986
cites work: Random assignment under weak preferences
cites work: The probabilistic serial mechanism with private endowments
cites work: On a conjecture by Gale about one-sided matching problems
DOI: 10.1007/S00355-018-1110-Z
Recommended article: A Probabilistic Approach to Solving Assignment Problems
Recommended article: Probabilistic analysis of the generalised assignment problem
Recommended article: Efficient rules for probabilistic assignment
Recommended article: Extensions of the sequential stochastic assignment problem
Recommended article: The Probabilistic Analysis of a Heuristic for the Assignment Problem
Recommended article: Q3147236
Recommended article: Consistency in the probabilistic assignment model
Recommended article: Impossibilities for probabilistic assignment
description: scientific article; zbMATH DE number 6898720