Faster Game Solving via Predictive Blackwell Approachability: Connecting Regret Matching and Mirror Descent - researchr publication authors

researchr

You are not signed in
Sign in
Sign up

Gabriele Farina, Christian Kroer, Tuomas Sandholm. Faster Game Solving via Predictive Blackwell Approachability: Connecting Regret Matching and Mirror Descent. In Thirty-Fifth AAAI Conference on Artificial Intelligence, AAAI 2021, Thirty-Third Conference on Innovative Applications of Artificial Intelligence, IAAI 2021, The Eleventh Symposium on Educational Advances in Artificial Intelligence, EAAI 2021, Virtual Event, February 2-9, 2021. pages 5363-5371, AAAI Press, 2021. [doi]

This author has not been identified. Look up 'Gabriele Farina' in GoogleThis author has not been identified. Look up 'Christian Kroer' in GoogleThis author has not been identified. Look up 'Tuomas Sandholm' in Google

runs on WebDSL