- Rating
- 1
- Confidence
- 3
- Informativeness
- 1
- Presentation
- 2
- Soundness
- 3
Read review
Paper summary
This paper proposes UNOP, a policy that utilizes randomness over near-optimal actions to prevent excess loss in adaptive platforms. The work aims to demonstrate that even when the buyers strategy is fixed, it can at times exceed the amount a mere greedy strategy would achieve. The authors give experimental evidence for their theoretical results.
Critical strengths
None
Critical weaknesses
The Setting is not Well Motivated: The first of the three primary contributions of the work, namely their distinction between prediction accuracy, distribution learning error and welfare, seem like contrived terms and have no established connection to the strategic elements at hand. The fact the seller cannot revise their behavior throughout the course of the interaction severely limits the model. Within the paper, it is not even clear that UNOP is the optimal strategy the buyer can have. The second main contribution, the price grid, is a standard technique in optimization and beyond.
No End-To-End Learning: The characterization of UNOP against a seller who cannot change his strategy lacks technical novelty and uses standard arguments, (standard KL-decomposition, entropy maximization, concentration for multinomial distributions). Moreover, the authors do not give results that establish the convergence of the process, finite-sample bounds or give a detailed theoretical or experimental explanation of why the randomization is even necessary for increasing the surplus.
Questions for authors
Would a deterministic algorithm, like one that rejects everything in the set of near-optimal policies perform as well as UNOP?
Can the authors provide regret bounds for their algorithm?
How do the main theorems change when the adversary is also allowed to make strategic moves? This makes the setting significantly more challenging, but much more realistic.
The writing and presentation of this paper needs some improvement. The theorem statements are very confusing to read and much too long (Proposition 4 is a block of text that takes up 18 lines, Proposition 2 has a diatribe about matching pennies, when the theorem includes it as it is a zero sum game). There are also strange jumps between paragraphs (Line 51, the work was talking about randomness concealing a function and the text jumped to talking about their model).