- Rating
- 1
- Confidence
- 3
- Informativeness
- 1
- Presentation
- 1
- Soundness
- 1
Read review
Paper summary
This paper considers 2 player zero-sum game with imperfect-information, and more precisely poker, as the notion of showdown of the hand is central in the paper as well as in Poker. The paper studies Leduc Hold'em version of poker, which is a minimalist version with very few cards (2 players, 1 card in hand each, 1 public, out of 6 cards) to scale down the combinatorial complexity.
This paper is very technical and very hard to follow. It is a succession of 10+lines technical lemmas (called surprisingly theorem in the paper), with very little explanation of the rationale, and no big picture presented early to help the reader understand why the lemmas are provided.
There seems to be 2 parts:
The first one (section 4 and 5), I finally understood (the key definition of capacity is only provided in the middle of a "theorem" statement Theorem 5.1 page 5), but an english presentation without technical jargon plagging the paper could have easily be given: "maximize the showdown of the opponent hand while only playing epsilon-optimal strategies".
The main focus here is to show that the operators are linear, and thus LP programs can efficiently optimize the policies. The results are possibly new, but quite classical. Also, the result may not be so important if what the LP programs can handle is Leduc Holdem and not a full game of Poker.
The second focus (section 6 and 7), looks more interesting, but I gave up trying to understand the details: My best guess is: use several policies to identify the policy of the opponent, and thus improve the gains. Techniques could be more interesting there, but I really can't say for sure. Importantly, there are 2 core problems in this methodology:
- the strategy space of the opponent seems overly restricted to these "censoring policies" defined by one scalar.
- worse, the definition of the value for the hero player is that we want a hero strategy which is epsilon optimal versus the worse counter strategy of the opponent. In section 6 and 7 at least, it seems to be the opposite: the opponent strategy seems to be fixed, and a set of hero strategies are provided to identify the fixed opponent strategy.
These 2 points should have been discussed, and most of the technical lemmas should have been put in appendix to keep only the high level interesting and understandable statements.
Also, how these two parts are linked is unclear to me.
Last, the experimental part is very short, less than one page on page 9, impossible to understand for a non expert.
Further, there is no conclusion.
Critical strengths
- The 2 LP programs seem sound. However, they are obtain with what seems to me classical technique. It would have been interesting to show how complex poker games they scale to.
-The technique to identify the opponent policy may be more interesting, but I cannot judge with certainty. Also what is the relationship of this part with the LP program part is unclear to me.
Critical weaknesses
-
Presentation issues: This paper should be written in engish. Now, it is mainly a sequence of long technical lemmas. Jargon should be removed from abstract and introduction, all the more since the jargon used is absolutely unnecessary. Theorem should be understandable with limited statement to the point. Big picture should be provided early. Experimental part should be understandable. A conclusion should be provided...
-
possible soudness issue with the opponent policy, which seems fixed and taken in a very narrow set.
-
scaling to useful level seems unlikely, at least in the identification part.
Questions for authors
-
answer on the soundess part.
-
also try to explain what you are trying to solve in section 6 and 7 without using jargon.
-
how are section 4 and 5 linked to section 6 and 7?