Continuous Paretian Preferences
Two forms of continuity are defined for Pareto representations of preferences. They are designated continuity and coordinate continuity. Characterizations are given of those Pareto representable preferences that are continuously representable and, in dimension two, of those that are coordinate-continuously representable.
|Date of creation:||Aug 2003|
|Contact details of provider:|| Postal: University of Connecticut 365 Fairfield Way, Unit 1063 Storrs, CT 06269-1063|
Phone: (860) 486-4889
Fax: (860) 486-4463
Web page: http://www.econ.uconn.edu/
More information through EDIRC
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.:
- Knoblauch, Vicki, 2005.
"Continuous lexicographic preferences,"
Journal of Mathematical Economics,
Elsevier, vol. 41(7), pages 812-825, November.
- Vicki Knoblauch, 2003. "Continuous Lexicographic Preferences," Working papers 2003-31, University of Connecticut, Department of Economics.
- Vicki Knoblauch, 2001. "Using elections to represent preferences," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 18(4), pages 823-831.
- Donaldson, David & Weymark, John A., 1998. "A Quasiordering Is the Intersection of Orderings," Journal of Economic Theory, Elsevier, vol. 78(2), pages 382-387, February.
- Sprumont, Yves, 2001. "Paretian Quasi-orders: The Regular Two-Agent Case," Journal of Economic Theory, Elsevier, vol. 101(2), pages 437-456, December. Full references (including those not matched with items on IDEAS)
When requesting a correction, please mention this item's handle: RePEc:uct:uconnp:2003-29. 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: (Mark McConnel)
If references are entirely missing, you can add them using this form.