This file is part of IDEAS, which uses RePEc data


[ Papers | Articles | Software | Books | Chapters | Authors | Institutions | JEL Classification | NEP reports | Search | New papers by email | Author registration | Rankings | Volunteers | FAQ | Blog | Help! ]

Order Topologies: Characterizations and Counterexamples

Author info | Abstract | Publisher info | Download info | Related research | Statistics
Author Info
Vicki Knoblauch (University of Connecticut)
Abstract

The order topology generated by a consumerÇs preferences over a set of alternatives can enhance our understanding of those preferences by providing a notion of proximity between alternatives. It is their potential to enhance our understanding that motivates our general study of order topologies, in which we characterize order topologies (in the broadest sense, that is, topologies generated by binary relations) and present topological versions of two preference representation theorems. We then use our characterizations to construct exam- ples of topologies that are not order topologies. We also present examples that illustrate our topological preference representation results.

Download Info
To download:

If you experience problems downloading a file, check if you have the proper application to view it first. Information about this may be contained in the File-Format links below. 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.

File URL: http://www.econ.uconn.edu/working/2009-28.pdf
File Format: application/pdf
File Function: Full text
Download Restriction: no

Publisher Info
Paper provided by University of Connecticut, Department of Economics in its series Working papers with number 2009-28.

Download reference. The following formats are available: HTML (with abstract), plain text (with abstract), BibTeX, RIS (EndNote, RefMan, ProCite), ReDIF
Length: 16 pages
Date of creation: Sep 2009
Date of revision:
Handle: RePEc:uct:uconnp:2009-28

Contact details of provider:
Postal: University of Connecticut 341 Mansfield Road, 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

For technical questions regarding this item, or to correct its listing, contact: (Christian Zimmermann).

Related research
Keywords: consumer preferences; order topology; preference representation;

Find related papers by JEL classification:
C02 - Mathematical and Quantitative Methods - - General - - - Mathematical Economics
D11 - Microeconomics - - Household Behavior - - - Consumer Economics: Theory

This paper has been announced in the following NEP Reports:

References listed on IDEAS
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.:
  1. Knoblauch, Vicki, 2005. "Continuous lexicographic preferences," Journal of Mathematical Economics, Elsevier, vol. 41(7), pages 812-825, November. [Downloadable!] (restricted)
    Other versions:
  2. Chateauneuf, Alain, 1987. "Continuous representation of a preference relation on a connected topological space," Journal of Mathematical Economics, Elsevier, vol. 16(2), pages 139-146, April. [Downloadable!] (restricted)
  3. Vicki Knoblauch, 2006. "Continuously Representable Paretian Quasi-Orders," Theory and Decision, Springer, vol. 60(1), pages 1-16, 02. [Downloadable!] (restricted)
  4. Sprumont, Yves, 2001. "Paretian Quasi-orders: The Regular Two-Agent Case," Journal of Economic Theory, Elsevier, vol. 101(2), pages 437-456, December. [Downloadable!] (restricted)
Full references

Statistics
Access and download statistics

Did you know? RePEc also has a blog.

This page was last updated on 2009-11-24.


This information is provided to you by IDEAS at the Department of Economics, College of Liberal Arts and Sciences, University of Connecticut using RePEc data on a server sponsored by the Society for Economic Dynamics.