Elimination of dominated strategies and inessential players

• Authors: Mamoru KANEKO , Shuige LIU
• Languages of publication: EN

Abstracts

We study the process, called the IEDI process, of iterated elimination of (strictly) dominated strategies and inessential players for finite strategic games. Such elimination may reduce the size of a game considerably, for example, from a game with a large number of players to one with a few players. We extend two existing results to our context; the preservation of Nash equilibria and order-independence. These give a way of computing the set of Nash equilibria for an initial situation from the endgame. Then, we reverse our perspective to ask the question of what initial situations end up at a given final game. We assess what situations underlie an endgame. We give conditions for the pattern of player sets required for a resulting sequence of the IEDI process to an endgame. We illustrate our development with a few extensions of the Battle of the Sexes.

Keywords

EN

dominated strategies; inessential players; iterated elimination order-independence; estimation of initial games

• Publisher: Politechnika Wrocławska. Oficyna Wydawnicza Politechniki Wrocławskiej
• Journal: Operations Research and Decisions
• Year: 2015
• Volume: 25
• Issue: 1
• Pages: 33-54

Contributors

author

Mamoru KANEKO

• Waseda University, Shinjuku-ku, Tokyo, 169-8050 Japan

author

Shuige LIU

• Waseda University, Shinju-ku, Tokyo 169-8050 Japan

References

• APT K.R., Direct proofs of order independence, Economics Bulletin, 2011, 31, 106–115.
• BÖRGERS T., Pure strategy dominance, Econometrica, 1993, 61, 423–430.
• GILBOA I., KALAI E., ZEMEL E., On the order of eliminating dominated strategies, Operations Research Letters, 1990, 9, 85–89.
• KANEKO M., KLINE J.J., Understanding the other through social roles, to be published in International Game Theory Review, 2015.
• MASCHLER M., SOLAN E., ZAMIR S., Game Theory, Cambridge University Press, Cambridge 2013.
• MERTENS J.F., Stable equilibria – a reformulation II. The geometry, and further results, Mathematics of Operations Research, 1991, 16, 694–753.
• MOULIN H., Game Theory for the Social Sciences, 2nd revised Ed., New York University Press, New York 1986.
• NASH J.F., Non-cooperative games, Annals of Mathematics, 1951, 54, 286–295.
• NEWMAN M.H.A., On theories with a combinatorial definition of equivalence, Annals of Mathematics, 1942, 43, 223–243.
• MYERSON R.B., Game Theory, Harvard University Press, Cambridge 1991.
• OSBORNE M., RUBINSTEIN A., A Course in Game Theory, The MIT Press, Cambridge 1994.

Identifiers

DOI

10.5277/ord150103