The proximity condition
AbstractNo abstract is available for this item.
Download InfoIf you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
Bibliographic InfoArticle provided by Springer in its journal Social Choice and Welfare.
Volume (Year): 39 (2012)
Issue (Month): 2 (July)
Contact details of provider:
Web page: http://link.springer.de/link/service/journals/00355/index.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.:
- Aczel, Janos & Roberts, Fred S., 1989. "On the possible merging functions," Mathematical Social Sciences, Elsevier, vol. 17(3), pages 205-243, June.
- Baigent, Nick, 1987. "Preference Proximity and Anonymous Social Choice," The Quarterly Journal of Economics, MIT Press, vol. 102(1), pages 161-69, February.
- Juan Perote-Peña & Ashley Piggins, 2002. "Geometry and impossibility," Economic Theory, Springer, vol. 20(4), pages 831-836.
- Conal Duddy & Juan Perote-Peña & Ashley Piggins, 2011.
"Arrow’s theorem and max-star transitivity,"
Social Choice and Welfare,
Springer, vol. 36(1), pages 25-34, January.
- Richard Barrett & Maurice Salles, 2006. "Social Choice With Fuzzy Preferences," Economics Working Paper Archive (University of Rennes 1 & University of Caen) 200615, Center for Research in Economics and Management (CREM), University of Rennes 1, University of Caen and CNRS.
- Quesada, Antonio, 2007. "Merging discrete evaluations," Mathematical Social Sciences, Elsevier, vol. 54(1), pages 25-34, July.
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.