On the equivalence of the HEX game theorem and the Duggan-Schwartz theorem for strategy-proof social choice correspondences

DOI10.1016/J.AMC.2006.09.126MaRDI QIDQ2371435zbMATH OpenOpenAlexFDO

Authors Yasuhito Tanaka

Publication date 4 July 2007

Published in Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.amc.2006.09.126

zbMATH Keywords

Duggan-Schwartz theoremHEX game theoremstrategy-proof social choice correspondences

Mathematics Subject Classification ID

Combinatorial games (91A46) Social choice (91B14)

Recommendations

• Equivalence of the HEX game theorem and the Arrow impossibility theorem
• THE HEX GAME THEOREM AND THE ARROW IMPOSSIBILITY THEOREM: THE CASE OF WEAK ORDERS
• Hex Games and Twist Maps on the Annulus
• A difficulty in particular Shannon-like games
• Multilabeled and topological versions of the Hex theorem

Cites work

• Equivalence of the HEX game theorem and the Arrow impossibility theorem
• scientific article; zbMATH DE number 3361657 (Why is no real title available?)
• Manipulation of Voting Schemes: A General Result
• Social choice and individual values
• 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 Game of Hex and the Brouwer Fixed-Point Theorem
• The Manipulability of Voting Systems

Cited in

(3)

• THE HEX GAME THEOREM AND THE ARROW IMPOSSIBILITY THEOREM: THE CASE OF WEAK ORDERS
• Hex Games and Twist Maps on the Annulus
• Equivalence of the HEX game theorem and the Arrow impossibility theorem

This page was built for publication: On the equivalence of the HEX game theorem and the Duggan-Schwartz theorem for strategy-proof social choice correspondences

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