Strong maximals: Elements with maximal score in partial orders
It is usually assumed that maximal elements are the best option for an agent. But there are situations in which we can observe that maximal elements are “different” one from another. This is the case of partial orders, in which one maximal element can be strictly preferred to almost every other element, whereas another maximal is not strictly preferred to any element. As partial orders are an important tool for modelling human behavior, it is interesting to find, for this kind of binary relation, those maximal elements that could be considered the best ones. In so doing, we define a selection inside the maximal set, which we call strong maximals (elements with maximal score), which is proved to be appropriate for choosing among maximals in a partial order. Copyright Springer-Verlag Berlin/Heidelberg 2005
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.
Volume (Year): 7 (2005)
Issue (Month): 2 (06)
|Contact details of provider:|| Postal: |
Phone: +34 94 6013783
Fax: + 34 94 6013774
Web page: http://link.springer.de/link/service/journals/10108/index.htm
More information through EDIRC
|Order Information:||Web: http://link.springer.de/orders.htm|
When requesting a correction, please mention this item's handle: RePEc:spr:specre:v:7:y:2005:i:2:p:157-166. 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: (Sonal Shukla)or (Christopher F Baum)
If references are entirely missing, you can add them using this form.