Type two computability of social choice functions and the Gibbard-Satterthwaite theorem in an infinite society

DOI10.1016/J.AMC.2007.02.130MaRDI QIDQ990505zbMATH OpenOpenAlexFDO

Authors Yasuhito Tanaka

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.02.130

zbMATH Keywords

strategy-proofnesssocial choice functiondictatorinfinite societythe gibbard-satterthwaite theoremtype two computability

Mathematics Subject Classification ID

Social choice (91B14)

Cites work

• scientific article; zbMATH DE number 1460545 (Why is no real title available?)
• scientific article; zbMATH DE number 2182815 (Why is no real title available?)
• scientific article; zbMATH DE number 3361657 (Why is no real title available?)
• Arrow's theorem and Turing computability
• Manipulation of Voting Schemes: A General Result
• Social choice and individual values
• Stability of Aggregation Procedures, Ultrafilters, and Simple Games
• Stability of social choices in infinitely large societies
• Strategic Candidacy and Voting Procedures
• Strategic manipulability without resoluteness or shared beliefs: Gibbard-Satterthwaite generalized
• Strategy-proofness and Arrow's conditions: existence and correspondence theorems for voting procedures and social welfare functions
• The equivalence of strong positive association and strategy-proofness

Cited in

(2)

• The Nakamura numbers for computable simple games
• The Gibbard-Satterthwaite theorem of social choice theory in an infinite society and LPO (limited principle of omniscience)

This page was built for publication: Type two computability of social choice functions and the Gibbard-Satterthwaite theorem in an infinite society

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q990505)