Probabilistic assignment: an extension approach

DOI10.1007/s00355-018-1110-zzbMath1397.91301OpenAlexW2539856977MaRDI QIDQ1649093

Wonki Jo Cho

Publication date: 5 July 2018

Published in: Social Choice and Welfare (Search for Journal in Brave)

Full work available at URL: https://www.research.manchester.ac.uk/portal/en/publications/probabilistic-assignment-an-extension-approach(afe0a8cd-4ff8-4c8d-a2fa-da99703945fe).html

zbMATH Keywords

lotteriesprobabilistic assignmentlexicographic preferencesbject allocation

Mathematics Subject Classification ID

Resource and cost allocation (including fair division, apportionment, etc.) (91B32)

Related Items

Ordinal Bayesian incentive compatibility in random assignment model, Extended random assignment mechanisms on a family of good sets, Partial strategyproofness: relaxing strategyproofness for the random assignment problem, A modified deferred acceptance algorithm for conditionally lexicographic-substitutable preferences, The impossibility of strategy-proof, Pareto efficient, and individually rational rules for fractional matching, Random assignments on preference domains with a tier structure

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Probabilistic assignment of objects: characterizing the serial rule
• When is the probabilistic serial assignment uniquely efficient and envy-free?
• Why do popular mechanisms lack efficiency in random environments?
• Incentives in the probabilistic serial mechanism
• A solution to the random assignment problem on the full preference domain
• Random assignment: redefining the serial rule
• The probabilistic serial mechanism with private endowments
• Random assignment of multiple indivisible objects
• Random assignment under weak preferences
• Equivalence of efficiency notions for ordinal assignment problems
• Risk aversion and risk vulnerability in the continuous and discrete case
• A sufficient condition for the equivalence of strategy-proofness and nonmanipulability by preferences adjacent to the sincere one
• On a conjecture by Gale about one-sided matching problems
• A note on object allocation under lexicographic preferences
• Probabilistic assignment of indivisible goods with single-peaked preferences
• Asymptotic Equivalence of Probabilistic Serial and Random Priority Mechanisms
• Manipulation of Schemes that Mix Voting with Chance
• Two axiomatic approaches to the probabilistic serial mechanism
• Risk Aversion in the Small and in the Large
• A new solution to the random assignment problem.
• Incentive properties for ordinal mechanisms