A note on robust Nash equilibria with uncertainties

Vianney Perchet

RAIRO - Operations Research - Recherche Opérationnelle (2014)

  • Volume: 48, Issue: 3, page 365-371
  • ISSN: 0399-0559

Abstract

top
In this short note, we investigate the framework where agents or players have some uncertainties upon their payoffs or losses, the behavior (or the type, number or any other characteristics) of other players. More specifically, we introduce an extension of the concept of Nash equilibria that generalize different solution concepts called by their authors, and depending on the context, either as robust, ambiguous, partially specified or with uncertainty aversion. We provide a simple necessary and sufficient condition that guarantees its existence and we show that it is actually a selection of conjectural (or self-confirming) equilibria. We finally conclude by how this concept can and should be defined in games with partial monitoring in order to preserve existence properties.

How to cite

top

Perchet, Vianney. "A note on robust Nash equilibria with uncertainties." RAIRO - Operations Research - Recherche Opérationnelle 48.3 (2014): 365-371. <http://eudml.org/doc/275080>.

@article{Perchet2014,
abstract = {In this short note, we investigate the framework where agents or players have some uncertainties upon their payoffs or losses, the behavior (or the type, number or any other characteristics) of other players. More specifically, we introduce an extension of the concept of Nash equilibria that generalize different solution concepts called by their authors, and depending on the context, either as robust, ambiguous, partially specified or with uncertainty aversion. We provide a simple necessary and sufficient condition that guarantees its existence and we show that it is actually a selection of conjectural (or self-confirming) equilibria. We finally conclude by how this concept can and should be defined in games with partial monitoring in order to preserve existence properties.},
author = {Perchet, Vianney},
journal = {RAIRO - Operations Research - Recherche Opérationnelle},
keywords = {robust games; robust Nash equilibria; uncertainties; partial monitoring; conjectural equilibria},
language = {eng},
number = {3},
pages = {365-371},
publisher = {EDP-Sciences},
title = {A note on robust Nash equilibria with uncertainties},
url = {http://eudml.org/doc/275080},
volume = {48},
year = {2014},
}

TY - JOUR
AU - Perchet, Vianney
TI - A note on robust Nash equilibria with uncertainties
JO - RAIRO - Operations Research - Recherche Opérationnelle
PY - 2014
PB - EDP-Sciences
VL - 48
IS - 3
SP - 365
EP - 371
AB - In this short note, we investigate the framework where agents or players have some uncertainties upon their payoffs or losses, the behavior (or the type, number or any other characteristics) of other players. More specifically, we introduce an extension of the concept of Nash equilibria that generalize different solution concepts called by their authors, and depending on the context, either as robust, ambiguous, partially specified or with uncertainty aversion. We provide a simple necessary and sufficient condition that guarantees its existence and we show that it is actually a selection of conjectural (or self-confirming) equilibria. We finally conclude by how this concept can and should be defined in games with partial monitoring in order to preserve existence properties.
LA - eng
KW - robust games; robust Nash equilibria; uncertainties; partial monitoring; conjectural equilibria
UR - http://eudml.org/doc/275080
ER -

References

top
  1. [1] M. Aghassi and D. Bertsimas, Robust game theory. Math. Program., Ser. B 107 (2006) 231–273. Zbl1134.91309MR2218128
  2. [2] Y. Azrieli, On pure conjectural equilibrium with non-manipulable information. Int. J. Game Theory38 (2009) 209–219. Zbl1211.91014MR2507391
  3. [3] S. Bade, Ambiguous act equilibria. Games. Econ. Behav.71 (2010) 246–260. Zbl1208.91025MR2814852
  4. [4] P. Battigalli and D. Guaitoli, Conjectural equilibrium. Mimeo (1988). 
  5. [5] A. Ben-Tal and A. Nemirovski, Robust convex optimization. Math. Oper. Res.23 (1998) 769–805. Zbl0977.90052MR1662410
  6. [6] A. Ben-Tal, L. El Ghaoui and A. Nemirovski, Robust optimization. Princeton University Press (2009). Zbl1221.90001MR2546839
  7. [7] A. Ben-Tal, B. Golany and S. Shtern, Robust multi echelon multi period inventory control. Eur. J. Oper. Res.199 (2009) 922–935. Zbl1176.90008
  8. [8] D. Bertsimas. and A. Thiele, Robust and data-driven optimization: modern decision-making under uncertainty, in Tutorials on Oper. Res. (2006) Chap. 4, 122–195. MR2201249
  9. [9] A. Candia-Véjar, E. Álvarez-Miranda and N. Maculan, Minmax regret combinatorial optimization problems: an algorithmic perspective. RAIRO – Oper. Res.45 (2011) 101–129. Zbl1270.90053MR2855948
  10. [10] D. Ellsberg, Risk, ambiguity and the Savage axiom. Quat. J. Econom. 75 (1961) 643–669. Zbl1280.91045
  11. [11] D. Fudenberg and D.K. Levine, Self-confirming equilibrium. Econometrica61 (1993) 523–545. Zbl0796.90072MR1217834
  12. [12] I. Gilboa and D. Schmeidler, Maxmin expected utility with a non-unique prior. J. Math. Econ.61 (1989) 141–153. Zbl0675.90012MR1000102
  13. [13] I. Glicksberg, A further generalization of the Kakutani fixed point theorem, with applications to Nash equilibrium points. Proc. Am. Math. Soc.3 (1952) 170–174. Zbl0046.12103MR46638
  14. [14] C. Hitch, Uncertainties in operations research. Oper. Res.8 (1960) 437–445. Zbl0096.14401MR117116
  15. [15] E. Kalai and E. Lehrer, Subjective equilibrium in repeated games. Econometrica61 (1993) 1231–1240. Zbl0784.90110MR1234796
  16. [16] P. Klibanoff, Uncertainty, decision and normal form games. Mimeo (1996). 
  17. [17] E. Lehrer, Partially specified probabilities: decisions and games. Am. Econ. J. Micro.4 (2012) 70–100. 
  18. [18] G. Lugosi, S. Mannor and G. Stoltz, Strategies for prediction under imperfect monitoring. Math. Oper. Res.33 (2008) 513–528. Zbl1231.91038MR2442639
  19. [19] J.-F. Mertens, S. Sorin and S. Zamir, Repeated games, CORE discussion paper (1994) 9420–9422. 
  20. [20] J.F. Nash, Equilibrium points in N-person games. Proc. Natl. Acad. Sci. USA36 (1950) 48–49. Zbl0036.01104MR31701
  21. [21] J.F. Nash, Non-cooperative games. Ann. Math.54 (1951) 286–295. Zbl0045.08202MR43432
  22. [22] V. Perchet, Internal regret with partial monitoring, calibration-based optimal algorithms. J. Mach. Learn. Res.12 (2011) 1893–1921. Zbl1280.68114MR2819021
  23. [23] F. Riedel and L. Sass, The strategic use of ambiguity. Mimeo (2011). 
  24. [24] A. Rustichini, Minimizing regret: the general case. Games Econom. Behav.29 (1999) 224–243. Zbl0954.91011MR1729318

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

                
Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.