Two simplified proofs for Roberts' theorem
From MaRDI portal
Recommendations
Cites work
Cited in
(16)- Dominant strategy implementability and zero length cycles
- Balanced implementability of sequencing rules
- Roberts' theorem with neutrality: a social welfare ordering approach
- Algorithms and mechanisms for procuring services with uncertain durations using redundancy
- Incentive compatibility and strategy-proofness of mechanisms of organizational behavior control: retrospective, state of the art, and prospects of theoretical research
- Roberts' weak welfarism theorem: a minor correction
- Strategy-proofness and weighted voting
- Simple proof of two-well rigidity
- Truthful implementation and preference aggregation in restricted domains
- A modular approach to Roberts' theorem
- Mechanism design with two alternatives in quasi-linear environments
- No truthful mechanism can be better than \(n\) approximate for two natural problems
- Separability and decomposition in mechanism design with transfers
- Two-player incentive compatible outcome functions are affine maximizers
- Selling mechanisms for a financially constrained buyer
- Dominant strategy implementation with a convex product space of valuations
This page was built for publication: Two simplified proofs for Roberts' theorem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q733788)