Continuous lexicographic preferences
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.
(This abstract was borrowed from another version of this item.)
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.
As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.
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.:
- Peter C. Fishburn, 1975. "Axioms for Lexicographic Preferences," Review of Economic Studies, Oxford University Press, vol. 42(3), pages 415-419.
- 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.
- 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.
- Jens Leth Hougaard & Mich Tvede, 2001. "The Existence of Maximal Elements: Generalized Lexicographic Relations," Discussion Papers 01-05, University of Copenhagen. Department of Economics.
- 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-968, November.
- Binmore, K. & Samuelson, L., 1990. "Evolutionary Stability In Repeated Games Played By Finite Automata," Working papers 90-29, Wisconsin Madison - Social Systems.
- Binmore, K. & Samuelson, L., 1991. "Evolutionary Stability in Repeated games Played by Finite Automata," Papers 90-17, Michigan - Center for Research on Economic & Social Theory.
- Binmore, K. & Samuelson, L., 1991. "Evolutionary Stability in Repeated Game Played by Finite Automata," Papers 9131, Tilburg - Center for Economic Research.
- K. Binmore & L. Samuelson, 2010. "Evolutionary Stability in Repeated Games Played by Finite Automata," Levine's Working Paper Archive 561, David K. Levine.
- Knoblauch, Vicki, 2000. "Lexicographic orders and preference representation," Journal of Mathematical Economics, Elsevier, vol. 34(2), pages 255-267, October. Full references (including those not matched with items on IDEAS)
When requesting a correction, please mention this item's handle: RePEc:eee:mateco:v:41:y:2005:i:7:p:812-825. 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: (Dana Niculescu)
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.