Tag Archives: Texas Holdem poker

Is Heads-Up Poker in P?

Posted on January 16, 2017 by Gil Kalai

Five years ago I wrote a post entitled Is Backgammon in P? It was based on conversations with Peter Bro Miltersen and Uri Zwick (shown together in the above picture) about the computational complexity of computing the values (and equilibrium … Continue reading →

Posted in Combinatorics, Computer Science and Optimization, Games | Tagged Kristoffer Arnsfelt Hansen, Poker, Rasmus Ibsen-Jensen, Stochastic games, Texas Holdem poker | 3 Comments

	Albert R Meyer on TYI 30: Expected number of Dic…
	David Speyer on Duncan Dauvergne and Bálint Vi…
	Gil Kalai on How the g-Conjecture Came…
	Gil Kalai on (Eran Nevo) The g-Conjecture…
	JSE on Duncan Dauvergne and Bálint Vi…
	Dubcan Dauvergne and… on Ziegler´s Lecture on the …
	Dubcan Dauvergne and… on A Discrepancy Problem for Plan…
	Dubcan Dauvergne and… on Annotating Kimmo Eriksson…
	Dubcan Dauvergne and… on Happy Birthday Richard St…
	The beginnings of Sh… on Telling a Simple Polytope From…
	Vincent on Zur Luria on the n-Queens…
	Gil Kalai on Zur Luria on the n-Queens…

Tag Archives: Texas Holdem poker

Is Heads-Up Poker in P?

Recent Comments

Recent Posts

Top Posts & Pages

RSS

Categories

Blogroll

Archives