Generalized average rules as stable Nash mechanisms to implement generalized median rules
From MaRDI portal
Publication:2452127
Recommendations
Cites work
- An alternative characterization of the uniform rule
- An introduction to strategy-proof social choice functions
- Best-response potential games
- Coalition-proof Nash equilibria. I: Concepts
- Equilibrium allocations of Walrasian preference games
- Evolutionary Implementation and Congestion Pricing
- Games of fair division
- Generalized median voter schemes and committees
- Implementation in undominated Nash equilibria without integer games
- Manipulation of Voting Schemes: A General Result
- Nash Equilibrium and Welfare Optimality
- Negative Externalities and Evolutionary Implementation
- Pigouvian pricing and stochastic evolutionary implementation
- Potential games
- Secure implementation experiments: Do strategy-proof mechanisms really work?
- Secure implementation in allotment economies
- Strategic complements and substitutes, and potential games
- Strategy-proofness and Arrow's conditions: existence and correspondence theorems for voting procedures and social welfare functions
- Strategy-proofness and ``median voters
- The Division Problem with Single-Peaked Preferences: A Characterization of the Uniform Allocation Rule
- UNIQUE NASH IMPLEMENTATION FOR A CLASS OF BARGAINING SOLUTIONS
- Virtual Implementation in Iteratively Undominated Strategies: Complete Information
- Virtual Implementation in Nash Equilibrium
Cited in
(13)- Mean versus median voting in multi-dimensional budget allocation problems. A laboratory experiment
- Strategic vote trading under complete information
- Binary mechanism for the allocation problem with single-dipped preferences
- Strategy-proofness implies minimal participation under single-peakedness
- Preference manipulations lead to the uniform rule
- Spatial implementation
- On obvious strategy-proofness and single-peakedness
- Implementation via approval mechanisms
- On the costly voting model: the mean rule
- Coalitional stability in the location problem with single-dipped preferences: an application of the minimax theorem
- Trimming extreme reports in preference aggregation
- Manipulation in games with multiple levels of output
- On the implementation of the median
This page was built for publication: Generalized average rules as stable Nash mechanisms to implement generalized median rules
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2452127)