The Gibbard-Satterthwaite theorem of social choice theory in an infinite society and LPO (limited principle of omniscience)
From MaRDI portal
Publication:990626
DOI10.1016/j.amc.2007.04.001zbMath1193.91052OpenAlexW2157816660MaRDI QIDQ990626
Publication date: 1 September 2010
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2007.04.001
Cites Work
- Techniques of constructive analysis
- Type two computability of social choice functions and the Gibbard-Satterthwaite theorem in an infinite society
- Strategy-proofness and Arrow's conditions: existence and correspondence theorems for voting procedures and social welfare functions
- Stability of social choices in infinitely large societies
- The equivalence of strong positive association and strategy-proofness
- Arrow's theorem and Turing computability
- Constructive continuity
- Brouwerian Counterexamples
- Stability of Aggregation Procedures, Ultrafilters, and Simple Games
- Manipulation of Voting Schemes: A General Result
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item