Partial strategyproofness: relaxing strategyproofness for the random assignment problem
From MaRDI portal
Publication:1995295
Abstract: We present partial strategyproofness, a new, relaxed notion of strategyproofness for studying the incentive properties of non-strategyproof assignment mechanisms. Informally, a mechanism is partially strategyproof if it makes truthful reporting a dominant strategy for those agents whose preference intensities differ sufficiently between any two objects. We demonstrate that partial strategyproofness is axiomatically motivated and yields a parametric measure for "how strategyproof" an assignment mechanism is. We apply this new concept to derive novel insights about the incentive properties of the probabilistic serial mechanism and different variants of the Boston mechanism.
Recommendations
- Convex strategyproofness with an application to the probabilistic serial mechanism
- Strategy-proof stochastic assignment
- Incentives in the probabilistic serial mechanism
- An equilibrium analysis of the probabilistic serial mechanism
- Incompatibility of efficiency and strategyproofness in the random assignment setting with indifferences
Cites work
- A new solution to the random assignment problem.
- Automated mechanism design: a new application area for search algorithms
- Convex strategyproofness with an application to the probabilistic serial mechanism
- Factoring polynomials with rational coefficients
- Full surplus extraction and within-period ex post implementation in dynamic environments
- Implementation of stable solutions to marriage problems
- Incentive properties for ordinal mechanisms
- Incentives in the probabilistic serial mechanism
- Lotteries in student assignment: an equivalence result
- On a conjecture by Gale about one-sided matching problems
- Probabilistic assignment: an extension approach
- Random Serial Dictatorship and the Core from Random Endowments in House Allocation Problems
- Strategy-proof stochastic assignment
- Strategy-proofness in the large
- The ``Boston school-choice mechanism: an axiomatic approach
- The modified Boston mechanism
- Two axiomatic approaches to the probabilistic serial mechanism
- Upper-contour strategy-proofness in the probabilistic assignment problem
- When are local incentive constraints sufficient?
Cited in
(27)- An experimental study on the incentives of the probabilistic serial mechanism
- Random assignments with uniform preferences: an impossibility result
- Ex-post favoring ranks: a fairness notion for the random assignment problem
- Favoring Eagerness for Remaining Items: Designing Efficient, Fair, and Strategyproof Mechanisms
- On existence of truthful fair cake cutting mechanisms
- Strategy-proof and envy-free mechanisms for house allocation
- Convex strategyproofness with an application to the probabilistic serial mechanism
- Robust ex-post Pareto efficiency and fairness in random assignments: two impossibility results
- Modifications of Boston, Taiwanese and Chinese mechanisms are not comparable via counting manipulating students
- Strategy-proof stochastic assignment
- Ordinal Bayesian incentive compatibility in random assignment model
- Upper-contour strategy-proofness in the probabilistic assignment problem
- Efficient mixtures of priority rules for assigning objects
- Robustness to manipulations in school choice
- A new impossibility result for random assignments
- Inefficiency of random serial dictatorship under incomplete information
- The object allocation problem with favoring upper ranks
- Smoothed and average-case approximation ratios of mechanisms: beyond the worst-case analysis
- Compromises and rewards: stable and non-manipulable probabilistic matching
- Stochastic same-sidedness in the random voting model
- Strategic schools under the Boston mechanism revisited
- (Non-)obvious manipulability of rank-minimizing mechanisms
- Some further results on random OBIC rules
- Some characterizations of generalized top trading cycles
- Strategy-proofness, solidarity, and consistency for multiple assignment problems
- Strategy-proof and envy-free random assignment
- A planner-optimal matching mechanism and its incentive compatibility in a restricted domain
This page was built for publication: Partial strategyproofness: relaxing strategyproofness for the random assignment problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1995295)
