Topologies Defined by Binary Relations
The importance of topology as a tool in preference theory is what motivates this study in which we characterize topologies induced by binary relations and present topological versions of two classical preference representation theorems. We then use our characterizations to construct examples of topologies that are not induced by binary relations. We also present examples that illustrate our topological preference representation results. The preference literature contains characterizations of order topologies, that is, topologies induced by total preorders, but ours are the first characterizations of topologies induced by binary relations that are not neccesarily total preorders.
|Date of creation:||Sep 2009|
|Date of revision:||Dec 2009|
|Note:||This paper previously circulated under the title "Order Topologies: Characterizations and Counterexamples." I would like to thank Esteban Indurain for many valuable suggestions.|
|Contact details of provider:|| Postal: |
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.:
- Vicki Knoblauch, 2003.
"Continuous Lexicographic Preferences,"
2003-31, University of Connecticut, Department of Economics.
- 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.
- Vicki Knoblauch, 2006. "Continuously Representable Paretian Quasi-Orders," Theory and Decision, Springer, vol. 60(1), pages 1-16, 02.
- Sprumont, Yves, 2001. "Paretian Quasi-orders: The Regular Two-Agent Case," Journal of Economic Theory, Elsevier, vol. 101(2), pages 437-456, December.
When requesting a correction, please mention this item's handle: RePEc:uct:uconnp:2009-28. 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: (Francis Ahking)
If references are entirely missing, you can add them using this form.