Login / Signup

On the existence of a strictly strong Nash equilibrium under the student-optimal deferred acceptance algorithm.

Keisuke Bando
Published in: Games Econ. Behav. (2014)
Keyphrases
  • dynamic programming
  • worst case
  • nash equilibrium
  • np hard
  • optimal solution
  • learning algorithm
  • computational complexity
  • game theory
  • convergence rate
  • reinforcement learning
  • exhaustive search
  • pareto optimal