Ordinal Bayesian incentive compatibility in random assignment model
From MaRDI portal
Publication:6156325
DOI10.1007/s10058-022-00289-4zbMath1515.91106arXiv2009.13104MaRDI QIDQ6156325
Sulagna Dasgupta, Debasis Mishra
Publication date: 13 June 2023
Published in: Review of Economic Design (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2009.13104
Cites Work
- Ordinal Bayesian incentive compatibility in restricted domains
- Convex strategyproofness with an application to the probabilistic serial mechanism
- Probabilistic assignment of objects: characterizing the serial rule
- Cardinal Bayesian allocation mechanisms without transfers
- A simple random assignment problem with a unique solution
- Incentives in the probabilistic serial mechanism
- A solution to the random assignment problem on the full preference domain
- Ordinal Bayesian incentive compatible representations of committees
- Strategy-proofness and Arrow's conditions: existence and correspondence theorems for voting procedures and social welfare functions
- Incentive compatibility and incomplete information
- Probabilistic assignment: an extension approach
- Partial strategyproofness: relaxing strategyproofness for the random assignment problem
- Random assignments on sequentially dichotomous domains
- Random assignments on preference domains with a tier structure
- Incomplete information and singleton cores in matching markets
- Asymptotic Equivalence of Probabilistic Serial and Random Priority Mechanisms
- A General Framework for the Analysis of Sets of Constraints
- Manipulation of Voting Schemes: A General Result
- Manipulation of Schemes that Mix Voting with Chance
- Two axiomatic approaches to the probabilistic serial mechanism
- Incentive-compatible voting rules with positively correlated beliefs
- Incentive compatible allocation and exchange of discrete resources
- A Truthful Cardinal Mechanism for One-Sided Matching
- Robust Mechanism Design
- Ordinally Bayesian Incentive Compatible Voting Rules
- A new solution to the random assignment problem.
