Arrow's Theorem, countably many agents, and more visible invisible dictators
Year of publication: |
1997-05-06
|
---|---|
Authors: | Mihara, H. Reiju |
Institutions: | EconWPA |
Subject: | Arrow impossibility theorem | Turing computability | recursion theory | oracle algorithms | free ultrafilters |
Extent: | application/pdf |
---|---|
Series: | |
Type of publication: | Book / Working Paper |
Notes: | Journal of Mathematical Economics (1999) 32: 267|287 |
Classification: | D71 - Social Choice; Clubs; Committees; Associations ; C69 - Mathematical Methods and Programming. Other ; C71 - Cooperative Games |
Source: |
-
Computability of simple games: A complete investigation of the sixty-four possibilities
Kumabe, Masahiro, (2006)
-
Nonanonymity and sensitivity of computable simple games
Mihara, H. Reiju, (2003)
-
The Nakamura numbers for computable simple games
Kumabe, Masahiro, (2007)
- More ...
-
Anonymity and Neutrality in Arrow's Theorem with Restricted Coalition Algebras
Mihara, H. Reiju, (1994)
-
Arrow's theorem, Weglorz' models and the axiom of choice
Brunner, Norbert, (1999)
-
Nonanonymity and sensitivity of computable simple games
Mihara, H. Reiju, (2003)
- More ...