z-logo
open-access-imgOpen Access
Strategy-Based Warm Starting for Regret Minimization in Games
Author(s) -
Noam Brown,
Tüomas Sandholm
Publication year - 2016
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.v30i1.10056
Subject(s) - computer science , game tree , mathematical optimization , tree traversal , nash equilibrium , regret , counterfactual thinking , convergence (economics) , perfect information , domain (mathematical analysis) , repeated game , algorithm , game theory , mathematical economics , mathematics , machine learning , mathematical analysis , philosophy , epistemology , economics , economic growth

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