- Rating
- 2(+1)
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 1
Read review
Paper summary
The paper studies offline learning in zero-sum Bayesian games with fully logged training data and private-information policies at execution. It introduces prescriptive coverage, proves that information restrictions can change coverage through equilibrium behavior, and develops pessimistic algorithms with statistical and optimization guarantees.
Critical strengths
- Detailed proofs support the theoretical results.
- The paper is clearly presented.
- The studied offline learning under private information is meaningful.
Critical weaknesses
- Missing experiments.
- The absence of experiments is not itself disqualifying for a theory paper. However, the claims about scalability and overcoming the tabular method’s memory limitations have neither a computational complexity analysis nor empirical support. Exact construction of the pessimistic envelope, conditional expectations, and parameterized mirror-descent updates remain unresolved computational tasks.
- Although some related works are cited, the deficiency is the lack of a precise comparison with their assumptions and proof mechanisms.
Questions for authors
- Can C_F be bounded meaningfully for a useful structured function class?
- Which implementable parameterized actor satisfies Assumption 5.3?
- Is there a matching lower bound supporting “optimal learning”?
- What computational evidence supports PPA-PMD’s scalability?
Dear Reviewer,
Thank you again for your constructive feedback! We wanted to kindly follow up on our earlier response and would appreciate hearing whether our revisions have addressed your concerns.
If so, we would be grateful if you could consider updating your assessment. We are also happy to clarify any remaining questions.
Thank you for your time and consideration!