State the assumptions
This example uses full repricing of all holdings and each zero-token player paying every holder in full. It excludes special awards and chop carryovers.
For token value B, holdings k and multiplier m(k), a holder’s base claim is k × B × m(k). With L final zero-token players, the holder receives that claim × L. Each zero-token player pays the sum of all holders’ base claims.
A balanced example
Assume holdings of 3, 1, 1, 0, 0, token value 10 and a 2× tier starting at three. This distribution illustrates settlement; whether the round has ended is a separate rules question.
| Tokens | Base claim | Zero-token players | Net settlement |
|---|---|---|---|
| 3 | 60 | 2 | +120 |
| 1 | 10 | 2 | +20 |
| 1 | 10 | 2 | +20 |
| 0 | — | — | −80 |
| 0 | — | — | −80 |
Receipts and payments both total 160. If payers share one total instead, use the corresponding shared-payment formula. Calculate in minor currency units and allocate rounding remainders consistently.
Crossing a tier
At value 40, two tokens at 1× create a base claim of 80. Three at 2× create 240. The difference is 160 per final payer under these assumptions. It is not a guaranteed reward for winning the next hand: future holdings, payer counts and your poker betting costs still matter.
Settlement is not continuation EV
Settlement asks what transfers would be due if this distribution were final. Expected value depends on probabilities across future distributions under each action. An incomplete roster cannot support exact table-wide transfers; missing holdings are not zero.
Try changing a holding from two to three in the topic demo. Describe the deterministic transfer change, then list the future conditions that remain uncertain.
