Search Results for author: Duane Szafron

Found 2 papers, 0 papers with code

Efficient Monte Carlo Counterfactual Regret Minimization in Games with Many Player Actions

no code implementations NeurIPS 2012 Neil Burch, Marc Lanctot, Duane Szafron, Richard G. Gibson

In this paper, we present a new MCCFR algorithm, Average Strategy Sampling (AS), that samples a subset of the player's actions according to the player's average strategy.

counterfactual

On Strategy Stitching in Large Extensive Form Multiplayer Games

no code implementations NeurIPS 2011 Richard G. Gibson, Duane Szafron

Computing a good strategy in a large extensive form game often demands an extraordinary amount of computer memory, necessitating the use of abstraction to reduce the game size.

Cannot find the paper you are looking for? You can Submit a new open access paper.