- Rating
- 2(+1)
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2(+1)
Read review
Paper summary
The paper studies decentralized games with decision-dependent data distributions and coupled constraints. SPADE uses payoff-based gradient estimates and exchanges only dual variables. Frozen-distribution feedback targets a performatively stable equilibrium; deployed-distribution feedback targets a variational generalized nash equilibrium. SPADE-MP uses two coupled payoff observations to reduce estimator variance. The paper claims O(T^(7/8)) cumulative regret and constraint bounds for its one-point methods and O(T^(3/4)) bounds for SPADE-MP. Experiments use a five -firm, three-market Cournot model and report a sixfold reduction in scalar transmissions per iteration against a dense gradient-based baseline.
Critical strengths
- Reduced peer communication. Exchanging only dual variables is a meaningful extension of the existing constrained performative-learning framework. It removes the need to transmit full action estimates or know the objective's functional form.
- Explicit feedback models and variance analysis. The paper distinguishes frozen-distribution, deployed-distribution, and paired-feedback access. Under Assumption 10's coupling, the 2 point estimator's second moment is correctly bounded independently of the smoothing radius.
Critical weaknesses
- The stated NE convergence assumptions are insufficient. Proposition 1 on page 5, requires an additional monotonicity condition on the indirect mapping . Theorems 2/4 and 3/5 omit it, yet the proof on page 36 invokes strong monotonicity of the full performative pseudogradient merely from . Smoothness in Assumption 9 does not supply nomotonicity. A 2-player counterexample satisfies the listed hypotheses:
Questions for authors
- What corrected hypotheses establish strong monotonicity of the full performative pseudogradient and exclude the counterexample above? Please align every NE theorem and repair Example 1's sufficient conditions.
- Can you report total communications and payoff-query costs at matched equilibrium accuracy? Also clarify Appendix G.3's statement that all figures use T=10^6, followed by one-point endpoint errors reported after 10^9 iterations