26 citations · 50 across the 19 of their papers we have counts for
Showing 2020Show all
3 papers · 1 filter
cs.GT2020★ 1 cited
Finding and Certifying (Near-)Optimal Strategies in Black-Box Extensive-Form Games
Brian Hu Zhang, Tuomas Sandholm
Often -- for example in war games, strategy video games, and financial simulations -- the game is given to us only as a black-box simulator in which we can play it. In these settin…
cs.GT2020★ 3 cited
Sparsified Linear Programming for Zero-Sum Equilibrium Finding
Brian Hu Zhang, Tuomas Sandholm
Computational equilibrium finding in large zero-sum extensive-form imperfect-information games has led to significant recent AI breakthroughs. The fastest algorithms for the proble…
cs.GT2020★ 2 cited
Small Nash Equilibrium Certificates in Very Large Games
Brian Hu Zhang, Tuomas Sandholm
In many game settings, the game is not explicitly given but is only accessible by playing it. While there have been impressive demonstrations in such settings, prior techniques hav…