pokerai.org
http://www.pokerai.org/pf3/

2012 ACPC Symposium: Calculating the Exploitability of Heads-Up
http://www.pokerai.org/pf3/viewtopic.php?f=64&t=4684
Page 1 of 1

Author:  LOLWorld [ Sun Aug 12, 2012 2:16 pm ]
Post subject:  2012 ACPC Symposium: Calculating the Exploitability of Heads-Up

2012 ACPC Symposium: Calculating the Exploitability of Heads-Up Limit Agents

Authors : Michael Johanson

Abstract :

One of the most popular and most successful techniques used by competitors in the Annual Computer Poker Competition (ACPC) is to approximate a Nash equilibrium strategy.
If a close approximation can be achieved, then the strategy will minimize its potential loss against any adversary, including a best-response.
However, the success of this approach depends on several factors, including the quality of the abstraction, the speed of the game solving algorithm used to generate a strategy within that abstraction, and the recently discovered abstract game overfitting effect.
To investigate these factors, a fast algorithm for computing the real-game exploitability of strategies was developed and applied to heads-up limit poker.
This algorithm was used to evaluate several of the competitors in the 2010 ACPC, allowing the community to benchmark their progress towards the subgoal of approximating a Nash equilibrium.
In this paper, we propose to repeat this experiment on entries to the 2011 and 2012 ACPC heads-up limit events, with the permission and assistance of the agents’ authors, to create additional sets of datapoints on the community’s convergence graph.

http://www.ualberta.ca/~archibal/papers/johanson.pdf

Author:  GTOGrinder [ Thu Feb 07, 2013 11:14 am ]
Post subject:  Re: 2012 ACPC Symposium: Calculating the Exploitability of Heads-Up

this is very intersting, wish it was easy to program a perfect response bot to campare results.

Page 1 of 1
Powered by phpBB © 2000, 2002, 2005, 2007 phpBB Group
http://www.phpbb.com/