Large Non-Anonymous Repeated Games

Nabil I. Al-Najjar and Rann Smorodinsky

No 1250, Discussion Papers from Northwestern University, Center for Mathematical Studies in Economics and Management Science

Abstract: Saborian [8], following Green [4], studies a class of repeated games where a player's payoff depends on his stage action and an anonymous aggregate outcome, and shows that long-run players behave myopically in any equilibrium of such games. In this paper we extend Sabourian's results to games where the aggregate outcome is not necessarily an anonymous function of players' actions, and where players strategies may depend non-anonymously on signals of other players' behavior. Our argument also provides a conceptually simpler proof of Green and Sabourian's analysis, showing how their basic result is driven by bounds on how many pivotal players there can be in a game.

Date: 1998-12
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.kellogg.northwestern.edu/research/math/papers/1250.pdf main text (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:nwu:cmsems:1250

Ordering information: This working paper can be ordered from

Access Statistics for this paper

More papers in Discussion Papers from Northwestern University, Center for Mathematical Studies in Economics and Management Science Center for Mathematical Studies in Economics and Management Science, Northwestern University, 580 Jacobs Center, 2001 Sheridan Road, Evanston, IL 60208-2014. Contact information at EDIRC.
Bibliographic data for series maintained by Fran Walker ( this e-mail address is bad, please contact ).