On the equivalence of the Arrow impossibility theorem and the Brouwer fixed point theorem when individual preferences are weak orders
From MaRDI portal
Recommendations
- On the equivalence of the Arrow impossibility theorem and the Brouwer fixed point theorem
- THE HEX GAME THEOREM AND THE ARROW IMPOSSIBILITY THEOREM: THE CASE OF WEAK ORDERS
- A topological approach to the Arrow impossibility theorem when individual preferences are weak orders
- On fixed point theorems and social choice paradoxes
- On the topological equivalence of the Arrow impossibility theorem and Amartya Sen's liberal paradox
Cites work
- Homotopy properties of Pareto aggregation rules
- scientific article; zbMATH DE number 3361657 (Why is no real title available?)
- Manipulation of Voting Schemes: A General Result
- On fixed point theorems and social choice paradoxes
- On the equivalence of the Arrow impossibility theorem and the Brouwer fixed point theorem
- On the topological social choice model
- Social choice and individual values
- Social choice and resource allocation: a topological perspective
- Social choice and the topology of spaces of preferences
- Strategy-proofness and Arrow's conditions: existence and correspondence theorems for voting procedures and social welfare functions
- The topological equivalence of the Pareto condition and the existence of a dictator
- Topological and discrete social choice: in a search of a theory
- Topological manipulators form an ultrafilter
- Topological methods in social choice: an overview
- Topological social choice
- Unifying impossibility theorems: A topological approach
Cited in
(9)- Topological aggregation, the twin paradox and the No Show paradox
- A topological approach to the Arrow impossibility theorem when individual preferences are weak orders
- On the equivalence of the Arrow impossibility theorem and the Brouwer fixed point theorem
- Bounded response of aggregated preferences
- THE HEX GAME THEOREM AND THE ARROW IMPOSSIBILITY THEOREM: THE CASE OF WEAK ORDERS
- Arrow's theorem through a fixpoint argument
- A combinatorial topology approach to Arrow's impossibility theorem
- On the topological equivalence of the Arrow impossibility theorem and Amartya Sen's liberal paradox
- Equivalence of the HEX game theorem and the Arrow impossibility theorem
This page was built for publication: On the equivalence of the Arrow impossibility theorem and the Brouwer fixed point theorem when individual preferences are weak orders
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q845603)