The Theory of Implementation of Social Choice Rules
From MaRDI portal
Publication:4652256
DOI10.1137/S0036144503435945zbMath1104.91020OpenAlexW3121899235MaRDI QIDQ4652256
Publication date: 25 February 2005
Published in: SIAM Review (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/s0036144503435945
monotonicitygame theoryNash equilibriumdominancedecentralizationmechanism designcomplete and incomplete informationimplementation theory
Applications of game theory (91A80) Fundamental topics (basic mathematics, methodology; applicable to economics in general) (91B02) Mathematics for nonmathematicians (engineering, social sciences, etc.) (00A06) Social choice (91B14)
Related Items
Bounded depths of rationality and implementation with complete information ⋮ Subgame perfect implementation of the deserving winner of a competition with natural mechanisms ⋮ Picking the winners ⋮ Eliciting the socially optimal allocation from responsible agents ⋮ Behavioral strong implementation ⋮ Behavioral implementation under incomplete information ⋮ Implementation with a sympathizer ⋮ Complexity and repeated implementation ⋮ Mixed Bayesian implementation in general environments ⋮ Computational implementation ⋮ Irresolute mechanism design: a new path to possibility ⋮ Privacy in implementation ⋮ Quantum Bayesian implementation ⋮ Implementation in adaptive better-response dynamics: towards a general theory of bounded rationality in mechanisms ⋮ Implementation Theory ⋮ QUANTUM MECHANISM HELPS AGENTS COMBAT "BAD" SOCIAL CHOICE RULES ⋮ A natural mechanism to choose the deserving winner when the jury is made up of all contestants ⋮ A difficulty in implementing correlated equilibrium distributions ⋮ Robust virtual implementation with almost complete information ⋮ An impossibility result for virtual implementation with status quo ⋮ Treading a fine line: (im)possibilities for Nash implementation with partially-honest individuals ⋮ Choosing the winner of a competition using natural mechanisms: conditions based on the jury ⋮ Time and Nash implementation