scientific article; zbMATH DE number 5485548

MaRDI QIDQ3549720zbMATH OpenFDO

Authors Nicole Immorlica, Christian Borgs, Jennifer T. Chayes, Adam Tauman Kalai, Vahab S. Mirrokni, Christos Papadimitriou

Publication date 5 January 2009

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) (n)-person games, (n>2) (91A06) Multistage and repeated games (91A20)

Cited in

(5)

• The computational complexity of trembling hand perfection and other equilibrium refinements
• Learning to compete, coordinate, and cooperate in repeated games using reinforcement learning
• Computing equilibria in discounted dynamic games
• A successful strategy for iterated prisoner's dilemma with any number of channels
• Computing equilibria: a computational complexity perspective

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3549720)