Binary Relations: Finite Characterizations and Computational Complexity
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 Theory and Decision.
Volume (Year): 65 (2008)
Issue (Month): 1 (August)
Contact details of provider:
Web page: http://www.springerlink.com/link.asp?id=100341
preferences; Pareto order; voting; D11; D70;
Find related papers by JEL classification:
- D11 - Microeconomics - - Household Behavior - - - Consumer Economics: Theory
- D70 - Microeconomics - - Analysis of Collective Decision-Making - - - General
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.:
- Sprumont, Yves, 2001. "Paretian Quasi-orders: The Regular Two-Agent Case," Journal of Economic Theory, Elsevier, vol. 101(2), pages 437-456, December.
- Vicki Knoblauch, 2003.
"Characterizing Paretian Preferences,"
2003-30, University of Connecticut, Department of Economics.
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.