Stability versus rationality in choice functions
If we analyze the notion of stability (von Neumann and Morgenstern, 1944) it seems a desirable property to be fulfilled by any choice function. Paradoxically, the usual Condorcet choice functions (maximal set, top cycle, uncovered set, minimal covering, ...) are not stable in the VNM sense. In this study, we show the relationship between stability and rational choice functions, and propose an alternative notion of stability (wich we call c-stability) that solves this incompatibility problem. This new notion is closely related to the admissible set defined in Kalai and Schmeidler (1977).
|Date of creation:||13 Mar 2012|
|Date of revision:|
|Contact details of provider:|| Postal: +34 965 90 36 70|
Phone: +34 965 90 36 70
Fax: +34 965 90 97 89
Web page: http://web.ua.es/es/dmcte
More information through EDIRC
When requesting a correction, please mention this item's handle: RePEc:ris:qmetal:2012_005. 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: (Julio Carmona)
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.