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

	fanzheng1729 on A sensation in the morning new…
	Shtetl-Optimized… on A sensation in the morning new…
	AllThings.GO on Is it Legitimate/Ethical for G…
	Gil Kalai on TYI38 Lior Kalai: Monty Hall M…
	Answer to TYI 37: Ar… on Which Coalition to Form (…
	Answer to TYI 37: Ar… on Which Coalition?
	Answer to TYI 37: Ar… on Test Your Intuition (or simply…
	Yuval Peres on Answer to TYI 37: Arithmetic P…
	Gil Kalai on Henry Cohn, Abhinav Kumar, Ste…
	Gil Kalai on A sensation in the morning new…
	yaroslav shitov on A sensation in the morning new…
	Anon80 on A sensation in the morning new…

Tag Archives: Texas Holdem poker

Is Heads-Up Poker in P?

Recent Comments

Recent Posts

Top Posts & Pages

RSS

Categories

Blogroll

Archives