To achieve robustness, a decision criterion that recently has been widely adopted is Wald's minimax, after Gilboa and Schmeidler (1989) showed that (one generalisation of) it can be given an axiomatic foundation with a behavioural interpretation. Yet minimax has known drawbacks. A better alternative is Savage's minimax regret, recently axiomatized by Stoye (2006). A related alternative is relative minimax, known as competitive ratio in the computer science literature, which is appealingly unit free. This paper provides an axiomatisation with behavioural content for relative minimax.
|Date of creation:||2008|
|Date of revision:||May 2008|
|Contact details of provider:|| Postal: Via Sallustiana, 62 - 00187 Roma|
Phone: +39 066790013
Fax: +39 0647924872
Web page: http://www.eief.it/repec
More information through EDIRC
When requesting a correction, please mention this item's handle: RePEc:eie:wpaper:0804. 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: (Facundo Piguillem)
If references are entirely missing, you can add them using this form.