Random assignments on sequentially dichotomous domains
From MaRDI portal
Publication:2173423
DOI10.1016/j.geb.2019.05.006zbMath1437.91233OpenAlexW2970956394WikidataQ127323912 ScholiaQ127323912MaRDI QIDQ2173423
Publication date: 22 April 2020
Published in: Games and Economic Behavior (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.geb.2019.05.006
Related Items (3)
Ordinal Bayesian incentive compatibility in random assignment model ⋮ Structure of single-peaked preferences ⋮ Structured preferences: a literature survey
Cites Work
- When is the probabilistic serial assignment uniquely efficient and envy-free?
- A million answers to twenty questions: choosing by checklist
- Why do popular mechanisms lack efficiency in random environments?
- Incentives in the probabilistic serial mechanism
- Ordinal efficiency and dominated sets of assignments.
- Probabilistic assignment of indivisible objects when agents have the same preferences except the ordinal ranking of one object
- On cores and indivisibility
- A sufficient condition for the equivalence of strategy-proofness and nonmanipulability by preferences adjacent to the sincere one
- Maximal Condorcet domains
- On endowments and indivisibility: partial ownership in the Shapley-Scarf model
- Random assignments on preference domains with a tier structure
- Acyclic sets of linear orders
- Probabilistic assignment of indivisible goods with single-peaked preferences
- Random serial dictatorship and ordinally efficient contracts
- Acyclic sets of linear orders: a progress report
- When Are Local Incentive Constraints Sufficient?
- Probabilistic Social Choice Based on Simple Voting Comparisons
- Random Serial Dictatorship and the Core from Random Endowments in House Allocation Problems
- Consistent Probabilistic Social Choice
- College Admissions and the Stability of Marriage
- A new solution to the random assignment problem.
- Incentive properties for ordinal mechanisms
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Random assignments on sequentially dichotomous domains