- Rating
- 1
- Confidence
- 1
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 2
Read review
Paper summary
The paper tries to figure out the absolute minimum number of "buckets" (state abstractions) needed in small poker games to keep the exact equilibrium value. The authors map the strategy to a finite-state automaton and prove that the minimum number of states equals what they call the "joint width" of the deck. They run exact mathematical calculations on very small setups—up to 40 cards for totally ordered decks, and up to 7 cards for intransitive (rock-paper-scissors style) matchups. Their main finding is that ordered decks only ever need a few buckets, while intransitivity causes the required number of buckets to spike.
Critical strengths
1.Mathematical rigor: The authors made sure to avoid floating-point errors by using exact rational arithmetic for all their proofs and empirical checks. The formal link between automaton states and joint width seems logically sound.
2.Clear writing: Even though I am outside this exact subfield, I found the paper relatively easy to read. Figure 1 does a good job explaining the core pipeline.
Critical weaknesses
1.The setup is too small to be useful: The experiments are restricted to extreme "toy" games (one-card poker) with a maximum of 40 cards for simple ordered decks and just 7 cards for the intransitive ones. I am not convinced that the patterns observed here (like the period-10 recurrence on ordered decks) mean anything for real, large-scale imperfect-information games. It reads more like a discrete math puzzle than a machine learning paper suitable for ICLR.
2.No algorithmic contribution: The paper measures the minimum abstraction size but doesn't actually give us a practical algorithm to find or approximate it for games we actually care about solving. The authors even admit in Appendix D that their characterization "does not find" the abstraction. Because of this, the practical takeaway for the AI community feels very limited.
Questions for authors
1.I'm struggling to see the scalability here. How would your framework handle multi-round betting with chance nodes (like dealing a flop and turn in standard poker), where the decision trees are vastly deeper?
2.Since you mentioned in Appendix D that the identity doesn't give us a search algorithm, what is the actual use case of this theory for practitioners trying to build AI for large games?