Arrow's Theorem and Turing computability

@article{Mihara1994ArrowsTA,
  title={Arrow's Theorem and Turing computability},
  author={H. R. Mihara},
  journal={Economic Theory},
  year={1994},
  volume={10},
  pages={257-276}
}
Summary. A social welfare function for a denumerable society satisfies Pairwise Computability if for each pair (x,y) of alternatives, there exists an algorithm that can decide from any description of each profile on {x,y} whether the society prefers x to y. I prove that if a social welfare function satisfying Unanimity and Independence also satisfies Pairwise Computability, then it is dictatorial. This result severely limits on practical grounds Fishburn's resolution (1970) of Arrow's… Expand
38 Citations
On the computability of binary social choice rules in an infinite society and the halting problem
  • Y. Tanaka
  • Mathematics, Computer Science
  • Appl. Math. Comput.
  • 2008
  • 2
  • PDF
Arrow's Theorem, Weglorz' Models and the Axiom of Choice
  • 3
Existence of a coalitionally strategyproof social choice function: A constructive proof
  • H. R. Mihara
  • Mathematics, Computer Science
  • Soc. Choice Welf.
  • 2001
  • 19
Type two computability of social choice functions and the Gibbard-Satterthwaite theorem in an infinite society
  • Y. Tanaka
  • Mathematics, Computer Science
  • Appl. Math. Comput.
  • 2007
  • 4
  • PDF
Non-computability of competitive equilibrium
  • 49
Quasi-stationary social welfare functions
  • 1
Computability of Simple Games: A Characterization and Application to the Core
  • 7
  • PDF
...
1
2
3
4
...

References

SHOWING 1-10 OF 20 REFERENCES
Arrow's theorem with restricted coalition algebras
  • 59
Arrow's impossibility theorem: Concise proof and infinite voters
  • 210
Computability, complexity, and languages - fundamentals of theoretical computer science
  • M. Davis, E. Weyuker
  • Mathematics, Computer Science
  • Computer science and applied mathematics
  • 1983
  • 299
Social choice and computational complexity
  • 28
Recursively enumerable sets and degrees - a study of computable functions and computability generated sets
  • R. Soare
  • Computer Science
  • Perspectives in mathematical logic
  • 1987
  • 284
  • PDF
...
1
2
...