Login / Signup

Asymptotically optimal algorithm for stochastic adwords.

Nikhil R. DevanurBalasubramanian SivanYossi Azar
Published in: EC (2012)
Keyphrases
  • asymptotically optimal
  • worst case
  • computational complexity
  • np hard
  • dynamic programming
  • real time
  • similarity measure
  • reinforcement learning
  • search space
  • special case
  • simulated annealing
  • peer to peer