Learning, Hypothesis Testing, and Nash Equilibrium.
Consider a finite stage game G that is repeated infinitely often. At each time, the players have hypotheses about their opponents' repeated game strategies. They frequently test their hypotheses against the opponents' recent actions. When a hypothesis fails a test, a new one is adopted. Pl...
Main Authors: | Foster, D, Young, H |
---|---|
Format: | Journal article |
Language: | English |
Published: |
2003
|
Similar Items
-
Learning Hypothesis Testing and Nash Equilibrium.
by: Young, P
Published: (2002) -
Regret Testing: Learning to Play Nash Equilibrium without Knowing You Have an Opponent.
by: Foster, D, et al.
Published: (2006) -
Learning to Play Nash.
by: Foster, D, et al.
Published: (2000) -
Steady state learning and Nash equilibrium
by: Fudenberg, Drew, et al.
Published: (2011) -
Probably approximately correct Nash equilibrium learning
by: Fele, F, et al.
Published: (2020)