- Rating
- 1
- Confidence
- 4
- Informativeness
- 1
- Presentation
- 1
- Soundness
- 1
Read review
Paper summary
The paper studies a setting where an agent learns which collaborator to select and then interacts with that collaborator over multiple rounds, with the value of the relationship depending on whether they can sustain cooperation.
Critical strengths
I could not identify any particular strengths in the paper in its current form.
Critical weaknesses
-
The paper violates multiple formatting guidelines. It does not include the mandatory AI use statement and it is not even in ICLR 2027 formatting (it looks like NeurIPS formatting). Also, the abstract on OpenReview is almost completely different from the one in the PDF itself.
-
I suspect that there’s a lot of AI involvement here without human review. The writing relies heavily on long dashes everywhere, the paper is full of inaccurate statements, vague and unusual phrasings and overly verbose text. It also sounds like the writing wasn’t done by someone familiar with the topic.
- In the abstract, calling the inner interaction a bandit is misleading and inaccurate. A repeated game is not necessarily a bandit problem. Someone familiar with the topic would likely distinguish between the learning problem and the strategic interaction rather than immediately describe the whole thing as a two-level bandit.
- In the introduction, "sequential commitment" is not a common term for this phenomenon. It could suggest a commitment game or sequential mechanism rather than exploration followed by a persistent relationship. Also, "candidates of uncertain quality" is somewhat generic. Is quality an exogenous type or does it depend on the incentives created by the relationship? Further, stating "must then sustain a cooperative relationship" assumes cooperation is possible. Whether cooperation can be sustained is exactly what should be investigated here.
- The introduction is filled with insufficiently edited AI-generated text (“The prevailing engineering practice is to rank candidates by an advertised or statically measured compatibility score…”, “Two mature theories each capture one half of the problem”, “The coupling is the crux” and so on).
-
I find the discussion rather generic and lacking the level of rigour and professionalism expected in a paper.
- The connection to the secretary problem and bandits needs to be explained more accurately. The secretary problem and bandits are distinct frameworks, rather than one being a generalisation of the other. The secretary problem often involves sequentially evaluating candidates without being able to return to previously rejected ones, while bandit models allow repeated selection and learning about uncertain rewards. It is therefore misleading to describe bandits simply as generalisations of the secretary problem.
- I find the references to the IPD and the folk theorem rather generic and somewhat superficial. Both are well-known textbook concepts and simply mentioning them does not give a deep engagement with the relevant literature. The discussion would benefit from a more relevant discussion of repeated games with partner selection, switching and endogenous incentives for cooperation. As it stands, the theoretical framing feels rather introductory and does not clearly establish how the proposed problem relates to existing research or what is genuinely new about it.
- The discussion about prior work in Section 2 is thin, incomplete and not very deep. It also still does not properly define any of the problems discussed there. The authors assume that the reader is already familiar with bandits, the secretary problem, and stable matchings. Actually, Section 2 feels like another bunch of unrelated and textbook topics put together in a single section, while some of them have no real relevance to the paper. How are stable matchings relevant to this paper? Hint: they are not.
-
Getting back to the poor writing, the related work also contains a rather odd statement: “Our primitives (secretary/BAI and IPD) are individually classical - so, to answer the natural reviewer question directly: yes, the building blocks are known and the contribution is not a new bandit algorithm or a new PD strategy”. Sadly, the paper is exactly that. It is a combination of several existing things without any technical novelty. The “results” and techniques are all well-known, and simply combined together.
-
Section 5 says “Code, results (JSON), and figures accompany the paper”, but they are not accompanied with the paper. The authors also forgot to describe the entire experimental setup, which includes defining, e.g., AllC, AllD, TFT, Generous-TFT, Grim, Win-Stay-Lose-Shift (WSLS) and Random.
Questions for authors
None.