Equivalence of the HEX game theorem and the Arrow impossibility theorem

DOI10.1016/J.AMC.2006.07.115zbMATH Open1185.91062OpenAlexW2066721515MaRDI QIDQ876623FDOQ876623

Yasuhito Tanaka

Publication date: 26 April 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.07.115

Recommendations

• THE HEX GAME THEOREM AND THE ARROW IMPOSSIBILITY THEOREM: THE CASE OF WEAK ORDERS
• On the equivalence of the HEX game theorem and the Duggan-Schwartz theorem for strategy-proof social choice correspondences
• On the equivalence of the Arrow impossibility theorem and the Brouwer fixed point theorem when individual preferences are weak orders
• On the equivalence of the Arrow impossibility theorem and the Brouwer fixed point theorem
• Neutrality in arrow and other impossibility theorems

zbMATH Keywords

Arrow impossibility theoremHEX game theorem

Mathematics Subject Classification ID

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

Cites Work

• Social choice and individual values
• The Game of Hex and the Brouwer Fixed-Point Theorem
• Title not available (Why is that?)
• Unifying impossibility theorems: A topological approach

Cited In (3)

• On the equivalence of the HEX game theorem and the Duggan-Schwartz theorem for strategy-proof social choice correspondences
• Multilabeled and topological versions of the Hex theorem
• THE HEX GAME THEOREM AND THE ARROW IMPOSSIBILITY THEOREM: THE CASE OF WEAK ORDERS

This page was built for publication: Equivalence of the HEX game theorem and the Arrow impossibility theorem

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