Finding and Certifying (Near-)Optimal Strategies in Black-Box Extensive-Form Imperfect-Information G

Finding and Certifying (Near-)Optimal Strategies in Black-Box Extensive-Form Imperfect-Information G

Published on ● Video Link: https://www.youtube.com/watch?v=Z2DNq8PRywQ



Duration: 1:19:56
461 views
8


Tuomas Sandholm (Carnegie Mellon University)
https://simons.berkeley.edu/talks/tbd-290
Games and Equilibria in System Design and Analysis







Tags:
Simons Institute
theoretical computer science
UC Berkeley
Computer Science
Theory of Computation
Theory of Computing
Tuomas Sandholm
Games and Equilibria in System Design and Analysis