A social game is a generalization of a strategic-form game, in which not only the payoff of each player depends upon the strategies chosen by their opponents, but also their set of admissible strategies. Debreu (1952) proves the existence of a Nash equilibrium in social games with continuous strategy spaces. Recently, Polowczuk and Radzik (2004) have proposed a discrete counterpart of Debreu's theorem for two-person social games satisfying some ``convexity properties'. In this note, we define the class of supermodular social games and give an existence theorem for this class of games.
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.
Find related papers by JEL classification: C7 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory D8 - Microeconomics - - Information, Knowledge, and Uncertainty
This paper has been announced in the following NEP Reports:
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.: