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.
Download Info
To download:
If you experience problems downloading a file, check if you have the
proper application to
view it first. Information about this may be contained
in the File-Format links below. 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.
References listed on IDEAS 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.: