Advanced Search
MyIDEAS: Login

Continuous Lexicographic Preferences

Contents:

Author Info

  • Vicki Knoblauch

    (University of Connecticut)

Abstract

Under what conditions are lexicographically representable preferences continuously representable? This question is actually two questions, since there are two natural definitions of continuity for lexicographic representations. A complete answer is given for one of these questions, and the other is answered for two-dimensional lexicographic representations.

Download Info

If 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.
File URL: http://www.econ.uconn.edu/working/2003-31.pdf
File Function: Full text
Download Restriction: no

Bibliographic Info

Paper provided by University of Connecticut, Department of Economics in its series Working papers with number 2003-31.

as in new window
Length: 21 pages
Date of creation: Aug 2003
Date of revision:
Handle: RePEc:uct:uconnp:2003-31

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

Related research

Keywords: preferences; lexicographic order; continuous representations;

Other versions of this item:

Find related papers by JEL classification:

This paper has been announced in the following NEP Reports:

References

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.:
as in new window
  1. Knoblauch, Vicki, 2000. "Lexicographic orders and preference representation," Journal of Mathematical Economics, Elsevier, vol. 34(2), pages 255-267, October.
  2. Binmore, Kenneth G. & Samuelson, Larry, 1992. "Evolutionary stability in repeated games played by finite automata," Journal of Economic Theory, Elsevier, vol. 57(2), pages 278-305, August.
  3. Fishburn, Peter C, 1975. "Axioms for Lexicographic Preferences," Review of Economic Studies, Wiley Blackwell, vol. 42(3), pages 415-19, July.
  4. Jensen, Eric R, 1990. "An Econometric Analysis of the Old-Age Security Motive for Childbearing," International Economic Review, Department of Economics, University of Pennsylvania and Osaka University Institute of Social and Economic Research Association, vol. 31(4), pages 953-68, November.
  5. Binmore, K. & Samuelson, L., 1990. "Evolutionary Stability In Repeated Games Played By Finite Automata," Working papers 90-29, Wisconsin Madison - Social Systems.
  6. Hougaard, Jens Leth & Tvede, Mich, 2001. "The existence of maximal elements: generalized lexicographic relations," Journal of Mathematical Economics, Elsevier, vol. 36(2), pages 111-115, November.
  7. K. Binmore & L. Samuelson, 2010. "Evolutionary Stability in Repeated Games Played by Finite Automata," Levine's Working Paper Archive 561, David K. Levine.
Full references (including those not matched with items on IDEAS)

Citations

Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
as in new window

Cited by:
  1. Vicki Knoblauch, 2003. "Continuous Paretian Preferences," Working papers 2003-29, University of Connecticut, Department of Economics.
  2. Vicki Knoblauch, 2009. "Topologies Defined by Binary Relations," Working papers 2009-28, University of Connecticut, Department of Economics, revised Dec 2009.

Lists

This item is not listed on Wikipedia, on a reading list or among the top items on IDEAS.

Statistics

Access and download statistics

Corrections

When requesting a correction, please mention this item's handle: RePEc:uct:uconnp:2003-31. 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: (Kasey Kniffin).

If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

If references are entirely missing, you can add them using this form.

If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.

If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.

Please note that corrections may take a couple of weeks to filter through the various RePEc services.