Supermodular social games
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.
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.:
- Milgrom, Paul & Roberts, John, 1990. "Rationalizability, Learning, and Equilibrium in Games with Strategic Complementarities," Econometrica, Econometric Society, vol. 58(6), pages 1255-1277, November.
When requesting a correction, please mention this item's handle: RePEc:wpa:wuwpga:0502002. 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: (EconWPA)
If references are entirely missing, you can add them using this form.