ERC SUBLRN Machine Learning and Optimization Lab

  • Research
  • Publications
  • People
  • Visitors
  • Directions & Contact
Homepage

How hard is it to approximate the best Nash equilibrium?

Elad Hazan, Robert Krauthgamer (2011). How hard is it to approximate the best Nash equilibrium? SIAM Journal on Computing (SICOMP) 40(1) (pp. 79-91) .

Author Elad HazanPosted on 29/12/201107/01/2014Categories Journal Articles

Post navigation

Previous Previous post: Newtron: an Efficient Bandit algorithm for Online Multiclass Prediction
Next Next post: On Stochastic and Worst-case Models for Investing

Site Search

Recent Publications

  • Distributed Exploration in Multi-Armed Bandits
  • Almost Optimal Exploration in Multi-Armed Bandits
  • Online Learning for Time Series Prediction
  • Playing Non-linear Games with Linear Oracles
  • Better Rates for Any Adversarial Deterministic MDPs
  • Research
  • Publications
  • People
  • Visitors
  • Directions & Contact
ERC SUBLRN Machine Learning and Optimization Lab Proudly powered by WordPress