On the computability of quasi-transitive binary social choice rules in an infinite society and the halting problem
No abstract is available for this item.
Volume (Year): 32 (2009)
Issue (Month): 1 (May)
|Contact details of provider:|| Web page: http://link.springer.de/link/service/journals/10203/index.htm|
|Order Information:||Web: http://link.springer.de/orders.htm|
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.:
- H. Reiju Mihara, 1997.
"Arrow's Theorem and Turing computability,"
Springer, vol. 10(2), pages 257-276.
- Mas-Colell, Andreu & Sonnenschein, Hugo, 1972. "General Possibility Theorems for Group Decisions," Review of Economic Studies, Wiley Blackwell, vol. 39(2), pages 185-92, April.
- Kotaro Suzumura, 1999. "Welfare Economics Beyond Welfarist-Consequentialism," Discussion Paper Series a382, Institute of Economic Research, Hitotsubashi University.
- Fishburn, Peter C., 1970. "Arrow's impossibility theorem: Concise proof and infinite voters," Journal of Economic Theory, Elsevier, vol. 2(1), pages 103-106, March.
When requesting a correction, please mention this item's handle: RePEc:spr:decfin:v:32:y:2009:i:1:p:67-78. 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: (Guenther Eichhorn)or (Christopher F Baum)
If references are entirely missing, you can add them using this form.