The extended serial correspondence on a rich preference domain

DOI10.1007/S00182-013-0388-4MaRDI QIDQ2453497zbMATH OpenOpenAlexFDO

Authors Eun Jeong Heo

Publication date 6 June 2014

Published in International Journal of Game Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00182-013-0388-4

zbMATH Keywords

sd-efficiencysd no-envyextended serial correspondencerich support on a partitionsingle-peaked preference profiles with rich support on a partition

Mathematics Subject Classification ID

Individual preferences (91B08) Resource and cost allocation (including fair division, apportionment, etc.) (91B32) Discrete location and assignment (90B80)

Recommendations

• A characterization of the extended serial correspondence
• Probabilistic assignment of objects: characterizing the serial rule
• Probabilistic assignment: an extension approach
• A solution to the random assignment problem on the full preference domain
• When is the probabilistic serial assignment uniquely efficient and envy-free?

Cites work

• scientific article; zbMATH DE number 3148878 (Why is no real title available?)
• scientific article; zbMATH DE number 3078983 (Why is no real title available?)
• scientific article; zbMATH DE number 3095897 (Why is no real title available?)
• A characterization of the extended serial correspondence
• A new solution to the random assignment problem.
• A solution to the random assignment problem on the full preference domain
• On characterizations of the probabilistic serial mechanism involving incentive and invariance properties
• Probabilistic assignment of indivisible goods with single-peaked preferences
• Probabilistic assignment of objects: characterizing the serial rule
• School Choice with Consent^*
• The Division Problem with Single-Peaked Preferences: A Characterization of the Uniform Allocation Rule
• Two axiomatic approaches to the probabilistic serial mechanism

Cited in

(7)

• Strategy-proof and envy-free mechanisms for house allocation
• A characterization of the extended serial correspondence
• Constrained random matching
• Strategy-proofness and efficiency for non-quasi-linear and common-tiered-object preferences: characterization of minimum price rule
• A new ex-ante efficiency criterion and implications for the probabilistic serial mechanism
• When is the probabilistic serial assignment uniquely efficient and envy-free?
• Probabilistic assignment problem with multi-unit demands: a generalization of the serial rule and its characterization

This page was built for publication: The extended serial correspondence on a rich preference domain

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