Abstract
The lexicographic order is not representable by a real-valued function, contrary to many other orders or preorders. So, standard tools and results for well-posed minimum problems cannot be used. We prove that under suitable hypotheses it is however possible to guarantee the well-posedness of a lexicographic minimum over a compact or convex set. This result allows us to prove that some game theoretical solution concepts, based on lexicographic order are well-posed: in particular, this is true for the nucleolus.
| Original language | English |
|---|---|
| Pages (from-to) | 412-422 |
| Number of pages | 11 |
| Journal | Journal of Mathematical Analysis and Applications |
| Volume | 314 |
| Issue number | 2 |
| DOIs | |
| Publication status | Published - 15 Feb 2006 |
| Externally published | Yes |
Keywords
- Cooperative game
- Lexicographic order
- Nucleolus
- Tikhonov well-posedness
Fingerprint
Dive into the research topics of 'The nucleolus is well-posed'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver