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|
|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 references are entirely missing, you can add them using this form.