A constructive and elementary proof of Reny's theorem
In a recent but well known paper, Reny proved the existence of Nash equilibria for better-reply-secure games, with possibly discontinuous payoff functions. Reny's proof is purely existential, and is similar to a contradiction proof : it gives non hint of a method to compute a Nash equilibrium in the class of games considered. In this paper, we adapt the arguments of Reny in order to obtain, for better-reply-secure games : an elementary proof of Nash equilibria existence, which is a consequence of Kakutani's theorem, and a " constructive " proof, in the sense that we obtain Nash equilibria as limits of fixed-point of well chosen correspondences.
|Date of creation:||Jan 2006|
|Date of revision:|
|Contact details of provider:|| Postal: 106 - 112 boulevard de l'Hôpital, 75647 Paris cedex 13|
Phone: 01 44 07 81 00
Fax: 01 44 07 81 09
Web page: http://mse.univ-paris1.fr/
More information through EDIRC
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- Philip J. Reny, 1999. "On the Existence of Pure and Mixed Strategy Nash Equilibria in Discontinuous Games," Econometrica, Econometric Society, vol. 67(5), pages 1029-1056, September.
- Jean-Marc Bonnisseau & Pascal Gourdel & Hakim Hammami, 2005.
"Existence d'un équilibre de Nash dans un jeu discontinu,"
Université Paris1 Panthéon-Sorbonne (Post-Print and Working Papers)
- Jean-Marc Bonnisseau & Pascal Gourdel & Hakim Hammami, 2005. "Existence d'un équilibre de Nash dans un jeu discontinu," Cahiers de la Maison des Sciences Economiques b05099, Université Panthéon-Sorbonne (Paris 1).
When requesting a correction, please mention this item's handle: RePEc:mse:wpsorb:b06001. 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: (Lucie Label)
If references are entirely missing, you can add them using this form.