NIPS Proceedingsβ

Tuomas Sandholm

6 Papers

  • Safe and Nested Subgame Solving for Imperfect-Information Games (2017)
  • Sample Complexity of Automated Mechanism Design (2016)
  • Regret-Based Pruning in Extensive-Form Games (2015)
  • Diverse Randomized Agents Vote to Win (2014)
  • Learning Near-Pareto-Optimal Conventions in Polynomial Time (2003)
  • Reinforcement Learning to Play an Optimal Nash Equilibrium in Team Markov Games (2002)