Dual Reduction and Elementary Games

Roger Myerson

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

Abstract: Consider the linear incentive constraints that define the correlated equilibria of a game. The duals of these constraints generate Markov chains on the players' strategy sets. The stationary distributions for these Markov chains can be interpreted as the strategies in a reduced game, which is called a dual reduction. Any equilibrium of a dual reduction is an equilibrium of the original game. We say that a game is elementary if all incentive constraints can be satisfied as strict inequalities in a correlated equilibrium. Any game can be reduced to an elementary game by iterative dual reduction.

Date: 1995-06
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1)

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

Related works:
Journal Article: Dual Reduction and Elementary Games (1997)
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:1133

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 ).