Probabilistic assignment: an extension approach

DOI10.1007/S00355-018-1110-ZzbMATH Open1397.91301OpenAlexW2539856977MaRDI QIDQ1649093FDOQ1649093

Authors: 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

Recommendations

• A Probabilistic Approach to Solving Assignment Problems
• Probabilistic analysis of the generalised assignment problem
• Efficient rules for probabilistic assignment
• Extensions of the sequential stochastic assignment problem
• The Probabilistic Analysis of a Heuristic for the Assignment Problem
• scientific article; zbMATH DE number 1802784
• Consistency in the probabilistic assignment model
• Impossibilities for probabilistic assignment

zbMATH Keywords

lexicographic preferenceslotteriesprobabilistic assignmentbject allocation

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (13)

• Extended random assignment mechanisms on a family of good sets
• Upper-contour strategy-proofness in the probabilistic assignment problem
• Ordinal Bayesian incentive compatibility in random assignment model
• The object allocation problem with random priorities
• A Probabilistic Approach to Solving Assignment Problems
• Partial strategyproofness: relaxing strategyproofness for the random assignment problem
• Efficient rules for probabilistic assignment
• A modified deferred acceptance algorithm for conditionally lexicographic-substitutable preferences
• On rank dominance of tie‐breaking rules
• The impossibility of strategy-proof, Pareto efficient, and individually rational rules for fractional matching
• Random assignments on preference domains with a tier structure
• Random assignment: redefining the serial rule
• The extended serial correspondence on a rich preference domain

This page was built for publication: Probabilistic assignment: an extension approach

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1649093)