Two Plus Two Newer Archives  

Go Back   Two Plus Two Newer Archives > General Poker Discussion > Poker Theory

 
 
Thread Tools Display Modes
Prev Previous Post   Next Post Next
  #9  
Old 11-03-2006, 11:55 PM
pzhon pzhon is offline
Senior Member
 
Join Date: Mar 2004
Posts: 4,515
Default ICM problems

[ QUOTE ]
It appears that solving the ICM in its general form becomes intractable with increasing numbers of prizes and increasing numbers of players remaining active.

[/ QUOTE ]
This is an interesting point, and I'd like to know how much this has been discussed before.

In the course of other consultation, I recommended the use of the ICM as a settlement for stopped tournaments to a major poker server. They seemed interested until I mentioned that the exact calculation is complicated, and they may need to use an approximation if there are hundreds of players. Does anyone have a good approximation? I found one which is computable, but which does not preserve the property that the matrix of finishing probabilities has the property that each row and column sum to 1.

Another tractable problem related to the ICM is showing that you always lose E$ when you take an EChip-neutral gamble. As I recall, no one posted a proof on a past thread where this was conjectured. Maybe it would be good to gamble to knock out the short stack on the bubble when you have the second or third stack, but the ICM doesn't seem to say this.
Reply With Quote
 

Thread Tools
Display Modes

Posting Rules
You may not post new threads
You may not post replies
You may not post attachments
You may not edit your posts

BB code is On
Smilies are On
[IMG] code is On
HTML code is Off

Forum Jump


All times are GMT -4. The time now is 11:02 AM.


Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2026, vBulletin Solutions Inc.