Arrow's theorem and Turing computability
From MaRDI portal
Recommendations
- On the computability of binary social choice rules in an infinite society and the halting problem
- Arrow's theorem, countably many agents, and more visible invisible dictators
- scientific article; zbMATH DE number 4087371
- An infinite version of Arrow's theorem in the effective setting
- scientific article; zbMATH DE number 3845284
Cited in
(20)- Acyclicity, anonymity, and prefilters
- Preference aggregation theory without acyclicity: the core without majority dissatisfaction
- Infinite populations, choice and determinacy
- Arrow's theorem, countably many agents, and more visible invisible dictators
- On continuity of Arrovian social welfare functions
- The Nakamura numbers for computable simple games
- Computability of simple games: a complete investigation of the sixty-four possibilities
- Type two computability of social choice functions and the Gibbard-Satterthwaite theorem in an infinite society
- The Gibbard-Satterthwaite theorem of social choice theory in an infinite society and LPO (limited principle of omniscience)
- Superset-robust collective choice rules
- On the computability of quasi-transitive binary social choice rules in an infinite society and the halting problem
- Intergenerational equity and infinite-population ethics: a survey
- Infinite-population approval voting: a proposal
- Nonanonymity and sensitivity of computable simple games
- Quasi-stationary social welfare functions
- Computability of simple games: A characterization and application to the core
- Anonymity in large societies
- Proving Arrow's theorem by \texttt{PROLOG}
- Stable preference aggregation with infinite population
- On the computability of binary social choice rules in an infinite society and the halting problem
This page was built for publication: Arrow's theorem and Turing computability
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1365367)
