scientific article; zbMATH DE number 5485548

zbMATH Open1231.91006MaRDI QIDQ3549720FDOQ3549720

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

Publication date: 5 January 2009

Title of this publication is not available (Why is that?)

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 (4)

• Learning to compete, coordinate, and cooperate in repeated games using reinforcement learning
• The Computational Complexity of Trembling Hand Perfection and Other Equilibrium Refinements
• Computing equilibria in discounted dynamic games
• 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)