Nonanonymity and sensitivity of computable simple games
This paper investigates algorithmic computability of simple games (voting games). It shows that (i) games with a finite carrier are computable, (ii) computable games have both finite winning coalitions and cofinite losing coalitions, and (iii) computable games violate any conceivable notion of anonymity, including finite anonymity and measurebased anonymity. The paper argues that computable games are excluded from the intuitive class of gniceh infinite games, employing the notion of ginsensitivityh\-equal treatment of any two coalitions that differ only on a finite set.
|Date of creation:||31 Oct 2003|
|Date of revision:||01 Jun 2004|
|Note:||Type of Document - pdf; prepared on Mac OS X; pages: 15; To appear in Mathematical Social Sciences figures: None|
|Contact details of provider:|| Web page: http://econwpa.repec.org|
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- Banks, Jeffrey S. & Duggan, John & Le Breton, Michel, 2006.
"Social choice and electoral competition in the general spatial model,"
Journal of Economic Theory,
Elsevier, vol. 126(1), pages 194-234, January.
- Banks, Jeffrey & Duggan, John & Le Breton, Michel, 2003. "Social Choice and Electoral Competition in the General Spatial Model," IDEI Working Papers 188, Institut d'Économie Industrielle (IDEI), Toulouse.
- Mihara, H. Reiju, 1999. "Arrow's theorem, countably many agents, and more visible invisible dictators1," Journal of Mathematical Economics, Elsevier, vol. 32(3), pages 267-287, November.
- Andrei Gomberg & Cesar Martinelli & Ricard Torres, 2002.
"Anonymity in Large Societies,"
0211, Centro de Investigacion Economica, ITAM.
- Armstrong, Thomas E., 1980. "Arrow's theorem with restricted coalition algebras," Journal of Mathematical Economics, Elsevier, vol. 7(1), pages 55-75, March.
- H. Reiju Mihara, 1994.
"Anonymity and Neutrality in Arrow's Theorem with Restricted Coalition Algebras,"
9411001, EconWPA, revised 22 Nov 1994.
- H. Reiju Mihara, 1997. "Anonymity and neutrality in Arrow's Theorem with restricted coalition algebras," Social Choice and Welfare, Springer, vol. 14(4), pages 503-512.
- Kirman, Alan P. & Sondermann, Dieter, 1972.
"Arrow's theorem, many agents, and invisible dictators,"
Journal of Economic Theory,
Elsevier, vol. 5(2), pages 267-277, October.
- KIRMAN, Alan P. & SONDERMANN, Dieter, . "Arrow's theorem, many agents, and indivisible dictators," CORE Discussion Papers RP -118, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
- Armstrong, Thomas E., 1985. "Precisely dictatorial social welfare functions : Erratum and Addendum to `arrows theorem with restricted coalition algebras'," Journal of Mathematical Economics, Elsevier, vol. 14(1), pages 57-59, February.
- H. Reiju Mihara, 1997. "Arrow's Theorem, countably many agents, and more visible invisible dictators," Public Economics 9705001, EconWPA, revised 07 May 1997.
- Weber, Robert J., 1994. "Games in coalitional form," Handbook of Game Theory with Economic Applications, in: R.J. Aumann & S. Hart (ed.), Handbook of Game Theory with Economic Applications, edition 1, volume 2, chapter 36, pages 1285-1303 Elsevier.
- Mihara, H.R., 1994.
"Arrow's Theorem and Turing Computability,"
276, Minnesota - Center for Economic Research.
When requesting a correction, please mention this item's handle: RePEc:wpa:wuwpga:0310006. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (EconWPA)
If references are entirely missing, you can add them using this form.