z-logo
open-access-imgOpen Access
Finding and Certifying (Near-)Optimal Strategies in Black-Box Extensive-Form Games
Author(s) -
Brian Hu Zhang,
Tüomas Sandholm
Publication year - 2021
Publication title -
proceedings of the aaai conference on artificial intelligence
Language(s) - English
Resource type - Journals
eISSN - 2374-3468
pISSN - 2159-5399
DOI - 10.1609/aaai.v35i6.16724
Subject(s) - computer science , black box , combinatorial game theory , certificate , game tree , bounded function , tree (set theory) , fraction (chemistry) , sequential game , mathematical economics , theoretical computer science , game theory , mathematics , artificial intelligence , combinatorics , mathematical analysis , chemistry , organic chemistry

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom