Stable sets: a descriptive and comparative analysis
The notion of a stable set (introduced by von Neumann and Morgenstern, 1944) is an important tool in the field of Decision Theory. Since then, some alternative definitions have appeared in the literature: the admissible set (Kalai and Schmeidler, 1977), the generalized stable set (van Deemen, 1991), the M-stable set (Peris and Subiza, 2006), among others. Now, we are interested in obtaining the existence and the precise form of these stability notions, by according to the type of preference relation we have: total order, partial order, acyclic, tournament or weak-tournament.
|Date of creation:||16 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_006. 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.