Pith. sign in

REVIEW 3 major objections 5 minor 145 references

Learning under Opponent Unawareness in Linear-Quadratic Stochastic Games

T0 review · 3 major / 5 minor · reviewed 2026-08-12 · deepseek-v4-flash

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗ Review JSON

Pith's one-line read Players who never observe their opponents still converge to the full-information Nash equilibrium of a linear-quadratic stochastic game, at a rate set by equilibrium stability, estimation error, and exploration decay.

desk verdict First credible convergence theorem for radically uncoupled learning in LQ stochastic games; the general claim is conditional on one honestly flagged Lipschitz assumption, so the paper deserves a real referee but not blind citation for the full advertised class. read the letter →

arxiv 2608.08268 v1 pith:EWH3RHWH submitted 2026-08-08 math.OC cs.GTcs.LGecon.TH

Dantong Chu , Xuefeng Gao , Yufei Zhang This is my paper · ORCID
classification math.OCcs.GTcs.LGecon.TH MSC 91A1591A1091A8093E35
keywords radicallyuncoupledlearninglinear-quadraticstochasticgamesfeedbackNashequilibriumepsilon-greedyiteratedleastsquaresdynamicCournotcompetitionpricestickinessmulti-agentreinforcementmisspecifiedmodels
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

The paper asks whether strategic agents who are radically uncoupled — unaware that opponents exist, unable to see their actions or payoffs, and mis-specifying the world as a single-agent problem — can nevertheless converge to the Nash equilibrium of the game they are actually playing. The authors study infinite-horizon, nonzero-sum linear-quadratic stochastic games, where a shared state evolves in response to everyone's actions, and analyze a decentralized algorithm in which each player independently runs an $\varepsilon$-greedy iterated least-squares scheme on her misspecified model. Their central result, the first convergence guarantee for radically uncoupled learning in this class of games, is that this learning converges almost surely to the complete-information feedback Nash equilibrium, because each player's estimated parameters secretly encode the aggregate strategic effect of her rivals, making every strategy update a best response plus a vanishing error. Theorem 1 pins down the last-iterate rate, $\tilde{O}(t^{-q})$ with $q = \min\{-\ln\zeta/\ln\lambda,\; 1/2 - \max_m \nu_m,\; \min_m \nu_m\}$, joining the equilibrium's stability ($\zeta$), the epoch-growth schedule ($\lambda$), and each player's exploration decay ($\nu_m$). Applied to dynamic Cournot competition with sticky prices, the theory predicts that limited-information learning depresses firm profits during the transition and, when prices are sticky, lowers total surplus and raises market concentration — losses that a public aggregate-output signal largely undoes.

What carries the argument

The load-bearing object is the effective parameter pair of equation (26): $\Theta_m^{(k),*}$ — the perceived-model drift that makes the misspecified single-agent dynamics (6) match the true state dynamics (4) induced by the rivals' current linear strategies — together with $\Sigma_m^{(k),*} = \Sigma_\omega + \sum_{j\neq m}(\alpha_j^{(k-1)})^2 B_j B_j^\top$, the true noise covariance inflated by the rivals' exploration variances. On top of it sits identity (31), which equates the perceived problem's optimal policy at these effective parameters (with $\alpha_m = 0$) to the complete-information best-response map $(\psi_m, \varphi_m)$ of equation (17). The argument then runs as a perturbed fixed-point iteration: Lemmas 6 and 7 show the accepted estimate lies within $\eta_m^{(k)}(\delta) + \max_j \alpha_j^{(k-1)}$ of the effective parameters, and Assumption 4(b) converts that gap into a bounded deviation from the exact best response, so $e_{k+1} \leq \zeta e_k + C\xi_{k+1}(\delta)$. Unfolding this recursion through exponentially growing epochs of ratio $\lambda$, the three exponents in $q$ arise from the contraction $\zeta$, the estimation floor $\lambda^{-(1/2 - \max_m \nu_m)}$, and the exploration floor $\lambda^{-\min_m \nu_m}$.

What would settle it

A concrete check: in a two-player LQ game with a nonzero cross-coupling in the running cost, set the admissible sets so that the unconstrained best response to some opponent profile lies on the boundary of $\mathcal{A}_m \times \mathcal{B}_m$, and run Algorithm 1; the theorem predicts convergence to the unique stable feedback Nash equilibrium, but if the strategy map's slope at the boundary is steeper than the equilibrium contraction $\zeta$, the recursion $e_{k+1} \leq \zeta e_k + \text{noise}$ cannot close and the dynamics should visibly fail to converge. A second, quantitative check: measure the last-iterate exponent for a configuration with $\zeta > \lambda^{-1/4}$ and $\nu_m = 1/4$; the theorem predicts decay governed by $t^{\ln\zeta/\ln\lambda}$ rather than $t^{-1/4}$, so an observed exponent near $-1/4$ (or, conversely, a decay faster than the predicted minimum of the three exponents) refutes the rate formula.

Watch

Extended reading notes

Core claim

The paper's central claim is that solving a stochastic game does not require identifying it. A player who ignores her rivals cannot separate her own effect on the common state from theirs, so the true drift parameters of the state equation are unidentifiable; nevertheless, the regularized least-squares estimator of her perceived model converges to a well-defined effective parameter pair: the drift $\Theta_m^{(k),*} = \Theta_m^{(F_{-m}^{(k-1)}, f_{-m}^{(k-1)})}$ that would reproduce the observed state dynamics given the rivals' current linear policies, and the noise covariance $\Sigma_m^{(k),*} = \Sigma_\omega + \sum_{j\neq m}(\alpha_j^{(k-1)})^2 B_j B_j^\top$ inflated by their remaining exploration. At precisely these effective parameters, the optimal policy of the perceived single-agent control problem coincides with the complete-information best response to the rivals' previous strategy profile (equation (31)); hence each epoch's strategy update is a noisy best response whose error decomposes into an estimation term and an exploration term, both vanishing as $t \to \infty$. Under a global contractivity assumption on the collective best-response map (Assumption 2, with factor $\zeta < 1$), Theorem 1 concludes that the asynchronous, heterogeneous $\varepsilon$-greedy ILS dynamics converge almost surely to the unique feedback Nash equilibrium $(F^*, f^*)$, at rate $\tilde{O}(t^{-q})$ with $q = \min\{ -\ln\zeta/\ln\lambda,\; 1/2 - \max_m \nu_m,\; \min_m \nu_m\}$ — so the final rate is the worst of three bottlenecks: the equilibrium's own stability, the slowest player's estimation rate, and the fastest player's exploration decay.

Load-bearing premise

The load-bearing premise is Assumption 4(b): the map from a player's perceived model parameters to her optimal strategy must be locally Lipschitz around the effective parameters, with constants that do not blow up as opponents change strategies — a regularity the paper verifies only for the Cournot model, explicitly noting that no such sensitivity results exist for the general LQ games with cross and linear cost terms.

Editorial extensions

If this is right

  • If Theorem 1 is correct, radically uncoupled learning — agents who do not know an opponent exists — reaches the very feedback Nash equilibrium that fully informed, coordinated players would select, provided the best-response map contracts globally; informational blindness is not an obstacle to equilibrium selection.
  • The rate formula doubles as a design rule: picking the single-agent-optimal exploration decay $\nu_m = 1/4$ gives rate $\tilde{O}(t^{-1/4})$ when $\zeta \leq \lambda^{-1/4}$; otherwise the equilibrium's own stability $\zeta$ caps what any such learner can achieve, because the $t^{\ln\zeta/\ln\lambda}$ term is exactly the idealized best-response dynamics.
  • Asynchronicity and heterogeneity cost nothing asymptotically: the rate is set by the worst bottleneck — $\min_m \nu_m$ for exploration and $1/2 - \max_m \nu_m$ for estimation — so one slow explorer slows the whole market.
  • In the Cournot application, learning under limited information keeps firm profits below the equilibrium benchmark under both low and high price stickiness; total surplus stays depressed and the Herfindahl–Hirschman Index is elevated only when price stickiness is high, and publicly releasing aggregate market quantity cuts convergence time by roughly sixfold while shrinking these transitional losses
  • The stability condition is load-bearing: with a unique but locally unstable equilibrium (spectral radius of $D\Psi$ exceeding 1), every simulated trajectory falls into a persistent two-point best-response cycle, so convergence to Nash fails exactly when Assumption 2 fails.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • Editorial inference: the proof's decomposition — estimation error plus exploration bias plus contraction — never uses the specific form of least squares beyond information-matrix growth and self-normalized martingale bounds; any certainty-equivalent estimator with matching error decay should inherit Theorem 1.
  • Editorial inference: the bifurcation at $\zeta = \lambda^{-1/4}$ suggests an online monitor — estimate the Jacobian of the best-response map during learning; when its spectral radius nears $\lambda^{-1/4}$, the equilibrium's stability, not the algorithm, sets the achievable rate, and shrinking the epoch ratio $\lambda$ is the leverage.
  • Editorial inference: the aggregate-information speedup is demonstrated numerically with a proof deferred; a mechanism consistent with the analysis is that observing aggregate output deletes the rivals' exploration-variance terms from $\Sigma_m^{(k),*}$, turning a cross-player exploration bottleneck into a single-player estimation problem.
  • Editorial inference: the weakly nonlinear demand experiment, where the error plateaus at a small positive level because the equilibrium policy is nonlinear, hints at a general principle — radically uncoupled linear learners track the best linear approximation of the equilibrium in nearby smooth games, with the residual set by the equilibrium policy's curvature.
Share X Bluesky LinkedIn Reddit HN

Signed reviews

No signed human review yet.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Referee Report

3 major / 5 minor

Summary. The paper studies M-player infinite-horizon nonzero-sum linear-quadratic (LQ) stochastic games with a common state under a radically uncoupled information structure, where each player observes only the common state and her own action history. Each player runs an epsilon-greedy iterated least-squares (ILS) algorithm over growing epochs, estimating a misspecified perceived model and implementing certainty-equivalent linear feedback with decaying exploration noise. The main result (Theorem 1) states that, under Assumptions 1-4 and Condition 1, the strategy profile converges almost surely to the complete-information feedback Nash equilibrium at rate O~(t^{-q}) with q = min{-ln zeta / ln lambda, 1/2 - max_m nu_m, min_m nu_m}, together with a finite-sample high-probability version. The proof interprets each player's update as a noisy best response to the opponents' previous profile, combining RLS estimation bounds, an identity between the complete-information best response and the control problem at effective parameters, and the contraction of the best-response map.

Significance. If the theorem is accepted as stated, this is the first convergence guarantee for radically uncoupled learning in continuous-state LQ stochastic games, and the explicit convergence rate is a useful benchmark. The proof is detailed and unusually candid about the status of Assumption 4; the rate exponent is derived analytically rather than fit to data, and the numerics independently confirm the predicted 0.25 exponent. The Cournot application with sticky prices gives the paper genuine economic content, including the finding that high price stickiness worsens transition losses. The main caveat is that the central theorem rests on Assumption 4(b), which is not verified for the general LQ class, so the scope of the advertised claim is narrower than the title and introduction suggest.

major comments (3)
  1. [Section 4, Assumption 4(b); Lemma 7; Appendix B.3] The central convergence claim is conditional on a regularity condition that is not established for the advertised class. The text in Section 4 states that 'corresponding sensitivity results for the more general class of LQ games considered here remain unavailable' and verifies Assumption 4 only for the Cournot model in Appendix B.3. Lemma 7 in Appendix A.2 and Step 3 of the proof use Assumption 4(b) to convert RLS estimation error into a bounded noisy-best-response error, so without this assumption the recursion a_{k+1} <= zeta a_k + C xi_k has no basis. As written, Theorem 1 therefore establishes convergence only for games satisfying an unverified uniform Lipschitz property of the optimal strategy map, not for general LQ games with cross-product/linear terms. I recommend either proving Assumption 4 from primitive conditions for a substantive subclass or explicitly restricting Theorem 1 to the Cournot-type setting and rephrasing the contribution accordingly.
  2. [Section 5.2 and Section 7] The claimed acceleration from publicly revealing aggregate market output is presented in the abstract and introduction as a substantive finding, but Section 5.2 provides only numerical evidence and Section 7 explicitly lists a rigorous justification as future work. This asymmetry should be made explicit in the paper's framing; if it is intended as a contribution, a formal statement or at least a precise empirical claim with confidence information is needed.
  3. [Section 5.4, Table 3] For Group 1, the paper states that in the 48% of non-explosive runs all paths converge to the equilibrium because the other assumptions are satisfied. This is an interpretation of numerical experiments, not a theorem, since Assumption 3 fails and Theorem 1 does not apply to those runs. The text should label this as an empirical observation rather than a consequence of the theory.
minor comments (5)
  1. [Condition 1] The formula for tau_m^(k+1) is garbled: 'tau_m^(k+1) = ... tau^(k+1) + tilde tau_m^(k+1)' leaves the roles of tau, the underlined tau, and bar tau undefined at first use; please clean up the notation.
  2. [Figures 1-2 and Tables 1 and 3] The numerical results are based on 200 independent runs but report only point estimates, without error bars or confidence intervals; adding standard errors would strengthen the claim that the fitted exponent is 'remarkably close' to 0.25 and would also clarify the 48%/52% split in Table 3.
  3. [Section 5.1] The reported total time T approximately 7.2 x 10^8 does not obviously follow from the stated epoch parameters (lambda=1.1, tau=300, underlined tau=2000, 130 updates); please check the arithmetic or specify the exact indexing used.
  4. [Table 1] The header layout for the convergence-rate columns is confusing: 'Stability RE_F RE_f' with repeated theta_0 and theta_1 headings makes it unclear which columns correspond to which quantity; use separate sub-headers.
  5. [Section 2.2] The term 'epsilon-greedy' is used for additive exploration noise, which differs from the standard discrete epsilon-greedy mechanism; a brief note distinguishing the two would avoid confusion for readers outside the LQ control literature.

Circularity Check

0 steps flagged · score 0.0 of 10

No significant circularity: the main theorem is a genuine sufficient-condition convergence result, and the numerical exponent is an independent confirmation, not a fitted input.

full rationale

I walked the derivation chain of Theorem 1. The central claim is that, under Assumptions 1-4 and Condition 1, the radically uncoupled epsilon-greedy ILS algorithm converges almost surely to the complete-information feedback Nash equilibrium. The proof has three load-bearing components: (i) the RLS estimation error bound (Proposition 1), (ii) the conversion of estimation error into strategy deviation via Assumption 4 and the identity (31), and (iii) the contraction recursion using Assumption 2. None of these reduces to the theorem's conclusion by construction. The identity (31) is a genuine equivalence between the perceived-parameter control problem and the complete-information best response problem; it is used as a bridge, not as an assumed target. Assumption 2 is a premise about the game's best-response map, not an assumption of the learning conclusion; the theorem shows that this stability plus decaying estimation/exploration noise implies convergence. The rate expression involves zeta, lambda, and nu_m analytically; no parameter is fitted to the data and then renamed as a prediction. The numerical section regresses the observed decay exponent and compares it to the theoretical 0.25; this is an empirical validation, not a circular fit, especially because the stability coefficients in Table 1 are computed independently from the equilibrium equations. The paper does admit in Section 4 that sensitivity results for general LQ games with cross terms 'remain unavailable' and that Assumption 4 is verified only for the Cournot model in Appendix B.3. This is a limitation and a correctness risk for the broadest advertised class, but it is not circularity: an unverified assumption is not an input that is equivalent to the output. The only self-citation (Plank and Zhang 2026) appears in related work and is not load-bearing. Thus, under the specified hard rules, no circular step can be exhibited, and the appropriate score is 0.

Assumptions & free parameters 0 free parameters · 7 assumptions · 0 invented entities

The central theorem is conditional on four structural assumptions and one schedule condition; no free parameters are fitted to make the theorem work, and no new entities are introduced. The proof leans on standard concentration inequalities and fixed-point theory.

assumptions (7)
  • domain assumption Assumption 1: each player's best response is unique, attained, and continuous in opponents' strategies, and independent of the initial state.
    Defines the collective best-response map Psi and guarantees, via Brouwer's fixed-point theorem, the existence of a feedback Nash equilibrium in Lemma 1.
  • domain assumption Assumption 2: the collective best-response map Psi is a global contraction with constant zeta in (0,1) in the weighted norm ||.||_{mu,1,2}.
    This is the load-bearing stability premise. Step 3 of the proof uses it to turn noisy best responses into a contracting recursion; without it, Section 5.4 shows oscillatory behavior and non-convergence.
  • domain assumption Assumption 3: the state dynamics are uniformly stable under all admissible strategy profiles, sup_{F in A} || A - sum_m B_m F_m || < 1.
    Required for the information-matrix lower bound and for RLS consistency in Lemma 2; violation leads to explosive state processes in Section 5.4, Group 1.
  • domain assumption Assumption 4: near the effective parameters the estimated model is feasible, and the optimal strategy map is locally Lipschitz in the perceived parameters with constants uniform in opponents' strategies.
    Used in Lemma 6 and Lemma 7 to convert estimation error into strategy deviation. The authors explicitly note that general sensitivity results for this class are unavailable and verify the condition only for the Cournot model.
  • domain assumption Condition 1: epoch lengths grow geometrically as tau^{(k)} = tau + tau lambda^k with lambda>1, exploration scales decay as alpha_m^{(k)} = alpha_bar (tau^{(k+1)})^{-nu_m} with nu_m in (0,1/2), and asynchronous shifts are bounded.
    Defines the learning schedule used by Algorithm 1; the proof of the information-matrix bounds relies on the exponential growth of epoch lengths and the decay of exploration noise.
  • standard math Standard concentration and small-ball inequalities for sub-Gaussian noise, including matrix Bernstein-type bounds and self-normalized martingale inequalities.
    Used in Lemmas 2-5 to control estimation errors, citing Vershynin (2018), Simchowitz et al. (2018), and De la Pena et al. (2009).
  • standard math Brouwer's fixed-point theorem and standard Riccati equation theory for linear-quadratic control.
    Used in Lemma 1 to establish existence of a Nash equilibrium and in Lemma 11 to derive closed-form best responses for the Cournot model.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Learning under Opponent Unawareness in Linear-Quadratic Stochastic Games." pith.science (2026). https://pith.science/paper/EWH3RHWH

@misc{pith2026260808268,
  author       = {Pith},
  title        = {Pith review of: Learning under Opponent Unawareness in Linear-Quadratic Stochastic Games},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/EWH3RHWH}},
  note         = {Machine review of arXiv:2608.08268}
}
abstract

As firms increasingly deploy machine learning for strategic decision-making, understanding algorithmic interactions has become central to operations research and economics. This paper studies learning in infinite-horizon, nonzero-sum linear-quadratic stochastic games under a radically uncoupled information structure, where players are either unaware of opponents or strategically oblivious, observing only a common state and their own action history. Under this minimal information, we analyze an asynchronous decentralized learning process in which each player independently runs a single-agent $\epsilon$-greedy iterated least-squares algorithm. We prove that, despite being unable to identify the system parameters, players' learning dynamics converge almost surely to the complete-information Nash equilibrium and characterize the convergence rate. We then apply the framework to a dynamic Cournot competition with sticky prices. Numerical experiments validate the theoretical results and show that learning under limited information reduces firm profits under both low and high price stickiness, while total surplus declines and market concentration increases when price stickiness is high. Publicly revealing aggregate market output substantially accelerates convergence and mitigates these welfare losses.

Figures

Figures reproduced from arXiv: 2608.08268 by the authors.

Figure 1
Figure 1. Convergence of feedback gain F under different price stickiness levels 104 106 108 Time 10−3 10−2 10−1 100 101 RE (k) f Full Sample Estimation Sample Fitted Line (a) s = 0.2 104 106 108 Time 10−3 10−2 10−1 100 101 RE (k) f Full Sample Estimation Sample Fitted Line (b) s = 0.8 [PITH_FULL_IMAGE:figures/full_fig_p015_1.png] view at source ↗
Figure 2
Figure 2. Convergence of offset f under different price stickiness levels 5.1.2 Market Outcomes under Low and High Price Stickiness We now compare the market outcomes generated by the learning dynamics under low (s = 0.2) and high (s = 0.8) price stickiness. We focus on four key performance measures: average price, firm profits, economic welfare, and market concentration. We begin by introducing the corresponding performance … view at source ↗
Figure 3
Figure 3. Bias in average price Epoch 20 40 60 80 100 120 Bias -10 -8 -6 -4 -2 0 2 s=0.2 s=0.8 (a) Firm 1 Epoch 20 40 60 80 100 120 Bias -5 -4 -3 -2 -1 0 1 s=0.2 s=0.8 (b) Firm 2 [PITH_FULL_IMAGE:figures/full_fig_p017_3.png] view at source ↗
Figures from the paper (5 more)
Figure 4
Figure 4. Figure 4: Bias in firm profits Epoch 20 40 60 80 100 120 Bias -12 -10 -8 -6 -4 -2 0 2 4 s = 0.2 s = 0.8 [PITH_FULL_IMAGE:figures/full_fig_p017_4.png]
Figure 5
Figure 5. Figure 5: Bias in total surplus Epoch 20 40 60 80 100 120 -2 0 2 4 6 8 10 Bias ×10−3 s=0.2 s=0.8 [PITH_FULL_IMAGE:figures/full_fig_p017_5.png]
Figure 7
Figure 7. Figure 7: Bias in firm profits Epoch 20 30 40 50 60 70 80 90 Bias -3.5 -3 -2.5 -2 -1.5 -1 -0.5 0 0.5 [PITH_FULL_IMAGE:figures/full_fig_p019_7.png]
Figure 9
Figure 9. Figure 9: shows the error in production quantities for δ = 0.9 and δ = 1.1. In both cases, the error gradually decreases and eventually stabilizes at a positive level. The error in the final epoch is 0.1422 for δ = 0.9 and 0.0484 for δ = 1.1, which are significantly smaller than…
Figure 10
Figure 10. Figure 10: Oscillatory dynamics when Assumption 2 is violated (Group 2). The four subfigures correspond to four players. In each subfigure, the solid line is F (k) m and the dashed line is the equilibrium value F ∗ m. 6 Sketched Proof of Theorem 1 This section outlines the main …

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

145 extracted references · 62 canonical work pages

  1. [1]

    arXiv:2601.20973 , year=

    Thompson Sampling Algorithm for Stochastic Games , author=. arXiv:2601.20973 , year=

    work page arXiv

  2. [2]

    Ratliff and Michael I

    Eric Mazumdar and Lillian J. Ratliff and Michael I. Jordan and S. Shankar Sastry , title =. Proceedings of the 19th International Conference on Autonomous Agents and Multiagent Systems , pages =

  3. [3]

    Operations Research , volume=

    Pre-hedging , author=. Operations Research , volume=. 2026 , publisher=

    2026

  4. [4]

    Naive exploration is optimal for online

    Simchowitz, Max and Foster, Dylan , booktitle=. Naive exploration is optimal for online. 2020 , organization=

    2020

  5. [5]

    Thompson Sampling Achieves

    Kargin, Taylan and Lale, Sahin and Azizzadenesheli, Kamyar and Anandkumar, Animashree and Hassibi, Babak , booktitle=. Thompson Sampling Achieves. 2022 , organization=

    2022

  6. [6]

    Journal of Machine Learning Research , volume=

    Policy gradient methods find the nash equilibrium in n-player general-sum linear-quadratic games , author=. Journal of Machine Learning Research , volume=

  7. [7]

    SIAM Journal on Mathematics of Data Science , volume=

    On gradient-based learning in continuous games , author=. SIAM Journal on Mathematics of Data Science , volume=. 2020 , publisher=

    2020

  8. [9]

    IFAC Proceedings Volumes , volume=

    Coupled Riccati differential equations arising in connection with Nash differential games , author=. IFAC Proceedings Volumes , volume=. 2008 , publisher=

    2008

Show all 145 references
  1. [10]

    IEEE Access , volume=

    Data-driven integral reinforcement learning for continuous-time non-zero-sum games , author=. IEEE Access , volume=. 2019 , publisher=

    2019

  2. [11]

    arXiv preprint arXiv:2404.00045 , year=

    Policy Optimization finds Nash Equilibrium in Regularized General-Sum LQ Games , author=. arXiv preprint arXiv:2404.00045 , year=

    arXiv

  3. [12]

    1998 , publisher=

    Dynamic noncooperative game theory , author=. 1998 , publisher=

    1998

  4. [13]

    Policy iteration based

    Li, Xinxing and Peng, Zhihong and Liang, Li and Zha, Wenzhong , journal=. Policy iteration based. 2019 , publisher=

    2019

  5. [14]

    New trends in dynamic games and applications , pages=

    Lyapunov iterations for solving coupled algebraic Riccati equations of Nash differential games and algebraic Riccati equations of zero-sum games , author=. New trends in dynamic games and applications , pages=. 1995 , publisher=

    1995

  6. [15]

    IEEE Transactions on Automatic Control , volume=

    Nash equilibria for linear quadratic discrete-time dynamic games via iterative and data-driven algorithms , author=. IEEE Transactions on Automatic Control , volume=. 2024 , publisher=

    2024

  7. [16]

    Non-zero sum Nash

    Vamvoudakis, Kyriakos G , journal=. Non-zero sum Nash. 2015 , publisher=

    2015

  8. [17]

    IEEE Control Systems Letters , year=

    On the Convergence of Gradient Descent in Scalar Two-Agent Infinite-Horizon LQ Games , author=. IEEE Control Systems Letters , year=

  9. [18]

    arXiv preprint arXiv:2408.15703 , year=

    Linear-quadratic dynamic games as receding-horizon variational inequalities , author=. arXiv preprint arXiv:2408.15703 , year=

    arXiv

  10. [19]

    Advances in Neural Information Processing Systems , volume=

    A finite-sample analysis of payoff-based independent learning in zero-sum stochastic games , author=. Advances in Neural Information Processing Systems , volume=

  11. [20]

    SIAM Journal on Mathematics of Data Science , volume=

    Satisficing paths and independent multiagent reinforcement learning in stochastic games , author=. SIAM Journal on Mathematics of Data Science , volume=. 2023 , publisher=

    2023

  12. [21]

    Journal of Systems Science and Complexity , volume=

    An Online Q-Learning Method for Linear-Quadratic Nonzero-Sum Stochastic Differential Games with Completely Unknown Dynamics , author=. Journal of Systems Science and Complexity , volume=. 2024 , publisher=

    2024

  13. [22]

    Uncertainty in Artificial Intelligence , pages=

    Thompson sampling for markov games with piecewise stationary opponent policies , author=. Uncertainty in Artificial Intelligence , pages=. 2021 , organization=

    2021

  14. [23]

    2021 60th IEEE Conference on Decision and Control (CDC) , pages=

    Thompson sampling for linear quadratic mean-field teams , author=. 2021 60th IEEE Conference on Decision and Control (CDC) , pages=. 2021 , organization=

    2021

  15. [25]

    arXiv preprint arXiv:2106.01969 , year=

    Global convergence of multi-agent policy gradient in markov potential games , author=. arXiv preprint arXiv:2106.01969 , year=

  16. [26]

    International Conference on Artificial Intelligence and Statistics , pages=

    Independent learning in constrained Markov potential games , author=. International Conference on Artificial Intelligence and Statistics , pages=. 2024 , organization=

    2024

  17. [27]

    arXiv preprint arXiv:2312.01587 , year=

    Scalable and Independent Learning of Nash Equilibrium Policies in n -Player Stochastic Games with Unknown Independent Chains , author=. arXiv preprint arXiv:2312.01587 , year=

    arXiv

  18. [28]

    Kybernetika , volume=

    Perturbation analysis of the discrete Riccati equation , author=. Kybernetika , volume=. 1993 , publisher=

    1993

  19. [29]

    Econometrica: Journal of the Econometric Society , volume=

    Dynamic duopolistic competition with sticky prices , author=. Econometrica: Journal of the Econometric Society , volume=. 1987 , publisher=

    1987

  20. [30]

    Operations Research , volume=

    Dynamic Duopolistic Competition with Sticky Prices , author=. Operations Research , volume=. 2024 , publisher=

    2024

  21. [31]

    Dynamic Games and Applications , pages=

    Cournot oligopoly: a discrete time sticky-prices paradox , author=. Dynamic Games and Applications , pages=. 2024 , publisher=

    2024

  22. [32]

    Journal of Economic Dynamics and Control , volume=

    A stochastic differential game of duopolistic competition with sticky prices , author=. Journal of Economic Dynamics and Control , volume=. 2021 , publisher=

    2021

  23. [33]

    Italian Economic Journal , volume=

    A dynamic oligopoly with price stickiness and risk-averse agents , author=. Italian Economic Journal , volume=. 2022 , publisher=

    2022

  24. [34]

    Journal of Dynamical and Control Systems , volume=

    Dynamic oligopoly with sticky prices: closed-loop, feedback, and open-loop solutions , author=. Journal of Dynamical and Control Systems , volume=. 2004 , publisher=

    2004

  25. [35]

    International Journal of Industrial Organization , volume=

    Competition in a duopoly with sticky price and advertising , author=. International Journal of Industrial Organization , volume=. 2000 , publisher=

    2000

  26. [36]

    Dynamic Games and Applications , volume=

    Dynamic oligopoly with sticky prices: off-steady-state analysis , author=. Dynamic Games and Applications , volume=. 2015 , publisher=

    2015

  27. [37]

    Operational Research , volume=

    Dynamic Stackelberg duopoly with sticky prices and a myopic follower , author=. Operational Research , volume=. 2022 , publisher=

    2022

  28. [38]

    The Review of Economic Studies , volume=

    Dynamic oligopoly with incomplete information , author=. The Review of Economic Studies , volume=. 2017 , publisher=

    2017

  29. [39]

    American Economic Journal: Microeconomics , volume=

    Dynamic oligopoly pricing with asymmetric information: Implications for horizontal mergers , author=. American Economic Journal: Microeconomics , volume=. 2024 , publisher=

    2024

  30. [40]

    European Journal of Operational Research , volume=

    A differential oligopoly game with differentiated goods and sticky prices , author=. European Journal of Operational Research , volume=. 2007 , publisher=

    2007

  31. [41]

    2019 , publisher=

    Uncertainty and Risk-aversion in a Dynamic Oligopoly with Sticky Prices , author=. 2019 , publisher=

    2019

  32. [42]

    2016 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP) , pages=

    Oligopoly dynamic pricing: a repeated game with incomplete information , author=. 2016 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP) , pages=. 2016 , organization=

    2016

  33. [43]

    Applied mathematics and computation , volume=

    Dynamic oligopoly: models with incomplete information , author=. Applied mathematics and computation , volume=. 1990 , publisher=

    1990

  34. [44]

    The Journal of Industrial Economics , pages=

    A dynamic duopoly model with asymmetric information , author=. The Journal of Industrial Economics , pages=. 1990 , publisher=

    1990

  35. [45]

    2015 54th IEEE Conference on Decision and Control (CDC) , pages=

    Dynamic oligopoly games with private Markovian dynamics , author=. 2015 54th IEEE Conference on Decision and Control (CDC) , pages=. 2015 , organization=

    2015

  36. [46]

    Communications in Nonlinear Science and Numerical Simulation , volume=

    The stability of Bayesian Nash equilibrium of dynamic Cournot duopoly model with asymmetric information , author=. Communications in Nonlinear Science and Numerical Simulation , volume=. 2018 , publisher=

    2018

  37. [47]

    Econometrica: Journal of the Econometric Society , pages=

    A theory of dynamic oligopoly, I: Overview and quantity competition with large fixed costs , author=. Econometrica: Journal of the Econometric Society , pages=. 1988 , publisher=

    1988

  38. [48]

    Econometrica: Journal of the Econometric Society , pages=

    A theory of dynamic oligopoly, II: Price competition, kinked demand curves, and Edgeworth cycles , author=. Econometrica: Journal of the Econometric Society , pages=. 1988 , publisher=

    1988

  39. [49]

    Automatica , volume=

    Game theory applied to dynamic duopoly problems with production constraints , author=. Automatica , volume=. 1978 , publisher=

    1978

  40. [50]

    2010 , publisher=

    Nonlinear oligopolies , author=. 2010 , publisher=

    2010

  41. [51]

    Journal of Economic Dynamics and Control , volume=

    Q-learning agents in a Cournot oligopoly model , author=. Journal of Economic Dynamics and Control , volume=. 2008 , publisher=

    2008

  42. [52]

    arXiv preprint arXiv:2305.13476 , year=

    On linear quadratic potential games , author=. arXiv preprint arXiv:2305.13476 , year=

  43. [53]

    Annual Review of Control, Robotics, and Autonomous Systems , volume=

    Planning and decision-making for autonomous vehicles , author=. Annual Review of Control, Robotics, and Autonomous Systems , volume=. 2018 , publisher=

    2018

  44. [54]

    1994 , publisher=

    A course in game theory , author=. 1994 , publisher=

    1994

  45. [55]

    SIAM Journal on Control and Optimization , volume=

    Convergence and stability properties of the discrete Riccati operator equation and the associated optimal control and filtering problems , author=. SIAM Journal on Control and Optimization , volume=. 1976 , publisher=

    1976

  46. [56]

    The Review of Economics and Statistics , pages=

    Dynamic oligopoly in the rice export market , author=. The Review of Economics and Statistics , pages=. 1989 , publisher=

    1989

  47. [57]

    Operations research , volume=

    Dynamic pricing and learning with discounting , author=. Operations research , volume=. 2024 , publisher=

    2024

  48. [58]

    Operations research , volume=

    Dynamic pricing with an unknown demand model: Asymptotically optimal semi-myopic policies , author=. Operations research , volume=. 2014 , publisher=

    2014

  49. [59]

    Management science , volume=

    Simultaneously learning and optimizing using controlled variance pricing , author=. Management science , volume=. 2014 , publisher=

    2014

  50. [60]

    SIAM Journal on Control and Optimization , volume=

    Reinforcement learning for linear-convex models with jumps via stability analysis of feedback controls , author=. SIAM Journal on Control and Optimization , volume=. 2023 , publisher=

    2023

  51. [61]

    Journal of Machine Learning Research , volume=

    Logarithmic regret for episodic continuous-time linear-quadratic reinforcement learning over a finite-time horizon , author=. Journal of Machine Learning Research , volume=

  52. [62]

    Econometrica: journal of the econometric society , pages=

    Evolutionary games in economics , author=. Econometrica: journal of the econometric society , pages=. 1991 , publisher=

    1991

  53. [63]

    Theoretical Economics , volume=

    Regret testing: Learning to play Nash equilibrium without knowing you have an opponent , author=. Theoretical Economics , volume=

  54. [64]

    Journal of Economic Perspectives , volume=

    Evolution and game theory , author=. Journal of Economic Perspectives , volume=. 2002 , publisher=

    2002

  55. [65]

    Journal of Optimization Theory and Applications , volume=

    Asymptotic analysis of linear feedback Nash equilibria in nonzero-sum linear-quadratic differential games , author=. Journal of Optimization Theory and Applications , volume=. 1999 , publisher=

    1999

  56. [66]

    SIAM Journal on Control and Optimization , volume=

    Feedback and open-loop Nash equilibria for LQ infinite-horizon discrete-time dynamic games , author=. SIAM Journal on Control and Optimization , volume=. 2024 , publisher=

    2024

  57. [67]

    science , volume=

    Dynamic programming , author=. science , volume=. 1966 , publisher=

    1966

  58. [68]

    Automatica , volume=

    Feedback Nash equilibria for scalar N-player linear quadratic dynamic games , author=. Automatica , volume=. 2025 , publisher=

    2025

  59. [69]

    Games and Economic Behavior , volume=

    Completely uncoupled dynamics and Nash equilibria , author=. Games and Economic Behavior , volume=. 2012 , publisher=

    2012

  60. [70]

    Operations research , volume=

    Learning and pricing with models that do not explicitly incorporate competition , author=. Operations research , volume=. 2015 , publisher=

    2015

  61. [71]

    Advances in Neural Information Processing Systems , volume=

    Uncoupled and convergent learning in two-player zero-sum markov games with bandit feedback , author=. Advances in Neural Information Processing Systems , volume=

  62. [72]

    Managerial and Decision Economics , volume=

    Price rigidity and flexibility: new empirical evidence , author=. Managerial and Decision Economics , volume=. 2007 , publisher=

    2007

  63. [73]

    Games and economic behavior , volume=

    Learning by trial and error , author=. Games and economic behavior , volume=. 2009 , publisher=

    2009

  64. [74]

    2018 , publisher=

    High-dimensional probability: An introduction with applications in data science , author=. 2018 , publisher=

    2018

  65. [75]

    2009 , publisher=

    Self-normalized processes: Limit theory and Statistical Applications , author=. 2009 , publisher=

    2009

  66. [76]

    Proceedings of the 35th International Conference on Machine Learning , pages=

    Global convergence of policy gradient methods for the linear quadratic regulator , author=. Proceedings of the 35th International Conference on Machine Learning , pages=. 2018 , organization=

    2018

  67. [77]

    IEEE Transactions on Automatic Control , volume=

    Dynamic fictitious play, dynamic gradient play, and distributed convergence to Nash equilibria , author=. IEEE Transactions on Automatic Control , volume=. 2005 , publisher=

    2005

  68. [78]

    Econometrica: Journal of the Econometric Society , volume=

    Information sharing in oligopoly , author=. Econometrica: Journal of the Econometric Society , volume=. 1985 , publisher=

    1985

  69. [79]

    Economic Theory , volume=

    Secret information acquisition in Cournot markets , author=. Economic Theory , volume=. 2001 , publisher=

    2001

  70. [80]

    International Congress of Mathematicians , volume=

    Independent learning in stochastic games , author=. International Congress of Mathematicians , volume=

  71. [81]

    IEEE Transactions on Automatic Control , volume=

    Independent and decentralized learning in markov potential games , author=. IEEE Transactions on Automatic Control , volume=. 2025 , publisher=

    2025

  72. [82]

    The Thirty Sixth Annual Conference on Learning Theory , pages=

    The complexity of markov equilibrium in stochastic games , author=. The Thirty Sixth Annual Conference on Learning Theory , pages=. 2023 , organization=

    2023

  73. [83]

    IEEE Transactions on Automatic Control , volume=

    Decentralized multicriteria optimization of linear stochastic systems , author=. IEEE Transactions on Automatic Control , volume=. 1978 , publisher=

    1978

  74. [84]

    SIAM journal on control and optimization , volume=

    Distributed computation of Nash equilibria in linear-quadratic stochastic differential games , author=. SIAM journal on control and optimization , volume=. 1989 , publisher=

    1989

  75. [85]

    Journal of Optimization Theory and Applications , volume=

    On the existence of Nash strategies and solutions to coupled Riccati equations in linear-quadratic games , author=. Journal of Optimization Theory and Applications , volume=. 1979 , publisher=

    1979

  76. [86]

    Journal of Economic Theory , volume=

    Strategic incentives in dynamic duopoly , author=. Journal of Economic Theory , volume=. 2004 , publisher=

    2004

  77. [87]

    Journal of economic theory , volume=

    Duopoly information equilibrium: Cournot and Bertrand , author=. Journal of economic theory , volume=. 1984 , publisher=

    1984

  78. [88]

    SIAM journal on control and optimization , volume=

    Linear quadratic differential games: closed loop saddle points , author=. SIAM journal on control and optimization , volume=. 2009 , publisher=

    2009

  79. [89]

    Stochastic Processes and their Applications , volume=

    Linear--quadratic stochastic two-person nonzero-sum differential games: Open-loop and closed-loop Nash equilibria , author=. Stochastic Processes and their Applications , volume=. 2019 , publisher=

    2019

  80. [90]

    IEEE Transactions on Automatic Control , volume=

    LQ Nash games with random entrance: an infinite horizon major player and minor players of finite horizons , author=. IEEE Transactions on Automatic Control , volume=. 2015 , publisher=

    2015

  81. [91]

    Control theory for linear systems , author=. Appl. Mech. Rev. , volume=

  82. [92]

    Automatica , volume=

    Robust receding horizon predictive control for systems with uncertain dynamics and input saturation , author=. Automatica , volume=. 2000 , publisher=

    2000

  83. [93]

    2007 , publisher=

    Linear feedback control: analysis and design with MATLAB , author=. 2007 , publisher=

    2007

  84. [94]

    2020 , publisher=

    Linear feedback controls: the essentials , author=. 2020 , publisher=

    2020

  85. [95]

    Advances in Neural Information Processing Systems , volume=

    Finite-time analysis of approximate policy iteration for the linear quadratic regulator , author=. Advances in Neural Information Processing Systems , volume=

  86. [96]

    Biometrika , volume=

    On a formula for the product-moment coefficient of any order of a normal frequency distribution in any number of variables , author=. Biometrika , volume=. 1918 , publisher=

    1918

  87. [97]

    Bertrand , author=

    No regret learning in oligopolies: Cournot vs. Bertrand , author=. International Symposium on Algorithmic Game Theory , pages=. 2010 , organization=

    2010

  88. [98]

    Computational Economics , volume=

    Learning to collude tacitly on production levels by oligopolistic agents , author=. Computational Economics , volume=. 2009 , publisher=

    2009

  89. [99]

    SIAM Journal on Control and Optimization , volume=

    Payoff-based dynamics for multiplayer weakly acyclic games , author=. SIAM Journal on Control and Optimization , volume=. 2009 , publisher=

    2009

  90. [100]

    Games and Economic Behavior , volume=

    Global Nash convergence of Foster and Young's regret testing , author=. Games and Economic Behavior , volume=. 2007 , publisher=

    2007

  91. [101]

    Games and Economic Behavior , volume=

    Revisiting log-linear learning: Asynchrony, completeness and payoff-based implementation , author=. Games and Economic Behavior , volume=. 2012 , publisher=

    2012

  92. [102]

    Decentralized

    Arslan, G. Decentralized. IEEE Transactions on Automatic Control , volume=. 2016 , publisher=

    2016

  93. [103]

    IEEE Transactions on Automatic Control , volume=

    Decentralized learning for optimality in stochastic dynamic teams and games with local control and global state information , author=. IEEE Transactions on Automatic Control , volume=. 2021 , publisher=

    2021

  94. [104]

    Handbook of reinforcement learning and control , pages=

    Multi-agent reinforcement learning: A selective overview of theories and algorithms , author=. Handbook of reinforcement learning and control , pages=. 2021 , publisher=

    2021

  95. [105]

    International conference on artificial intelligence and statistics , pages=

    Reinforcement learning with fast stabilization in linear dynamical systems , author=. International conference on artificial intelligence and statistics , pages=. 2022 , organization=

    2022

  96. [106]

    arXiv preprint arXiv:2405.17463 , year=

    Is Thompson Sampling Susceptible to Algorithmic Collusion? , author=. arXiv preprint arXiv:2405.17463 , year=

  97. [107]

    SIAM Journal on Control and Optimization , volume=

    Stochastic Linear-Quadratic Differential Game with Regime-Switching in an Infinite Horizon , author=. SIAM Journal on Control and Optimization , volume=. 2026 , publisher=

    2026

  98. [108]

    International Conference on Machine Learning , pages=

    Independent policy gradient for large-scale markov potential games: Sharper rates, function approximation, and game-agnostic convergence , author=. International Conference on Machine Learning , pages=. 2022 , organization=

    2022

  99. [109]

    Journal of Economic Dynamics and Control , volume=

    Cournot competition, organization and learning , author=. Journal of Economic Dynamics and Control , volume=. 2005 , publisher=

    2005

  100. [110]

    International Economic Review , volume=

    Through trial and error to collusion , author=. International Economic Review , volume=. 2004 , publisher=

    2004

  101. [111]

    Theoretical Economics , volume=

    Learning with minimal information in continuous games , author=. Theoretical Economics , volume=. 2020 , publisher=

    2020

  102. [112]

    2006 , publisher=

    Numerical optimization , author=. 2006 , publisher=

    2006

  103. [113]

    Acta numerica , volume=

    Sequential quadratic programming , author=. Acta numerica , volume=. 1995 , publisher=

    1995

  104. [114]

    European Journal of Operational Research , volume=

    Multi-start methods for combinatorial optimization , author=. European Journal of Operational Research , volume=. 2013 , publisher=

    2013

  105. [115]

    SIAM Journal on Optimization , volume=

    A sequential quadratic programming algorithm for nonconvex, nonsmooth constrained optimization , author=. SIAM Journal on Optimization , volume=. 2012 , publisher=

    2012

  106. [116]

    Management Science , volume=

    Artificial intelligence: Can seemingly collusive outcomes be avoided? , author=. Management Science , volume=. 2023 , publisher=

    2023

  107. [117]

    arXiv preprint arXiv:2201.00486 , year=

    Using non-stationary bandits for learning in repeated cournot games with non-stationary demand , author=. arXiv preprint arXiv:2201.00486 , year=

    arXiv

  108. [118]

    arXiv preprint arXiv:2501.07178 , year=

    The Spoils of Algorithmic Collusion: Profit Allocation Among Asymmetric Firms , author=. arXiv preprint arXiv:2501.07178 , year=

    arXiv

  109. [119]

    Strategic

    Deshpande, Sanyukta and Jacobson, Sheldon H , journal=. Strategic

  110. [120]

    Strategic collusion of

    Lin, Ryan Y and Ojha, Siddhartha and Cai, Kevin and Chen, Maxwell F , journal=. Strategic collusion of

  111. [121]

    arXiv preprint arXiv:2602.16555 , year=

    Learning Distributed Equilibria in Linear-Quadratic Stochastic Differential Games: An -Potential Approach , author=. arXiv preprint arXiv:2602.16555 , year=

  112. [122]

    2020 59th ieee conference on decision and control (cdc) , pages=

    Multi-agent reinforcement learning in cournot games , author=. 2020 59th ieee conference on decision and control (cdc) , pages=. 2020 , organization=

    2020

  113. [123]

    Formal modelling in electronic commerce , pages=

    Learning and tacit collusion by artificial agents in Cournot duopoly games , author=. Formal modelling in electronic commerce , pages=. 2005 , publisher=

    2005

  114. [124]

    arXiv preprint arXiv:2409.01447 , year=

    Last-iterate convergence of payoff-based independent learning in zero-sum stochastic games , author=. arXiv preprint arXiv:2409.01447 , year=

    arXiv

  115. [125]

    Advances in neural information processing systems , volume=

    Certainty equivalence is efficient for linear quadratic control , author=. Advances in neural information processing systems , volume=

  116. [126]

    Proceedings of the national academy of sciences , volume=

    Stochastic games , author=. Proceedings of the national academy of sciences , volume=. 1953 , publisher=

    1953

  117. [127]

    Journal of science of the hiroshima university, series ai (mathematics) , volume=

    Equilibrium in a stochastic n -person game , author=. Journal of science of the hiroshima university, series ai (mathematics) , volume=. 1964 , publisher=

    1964

  118. [128]

    Journal of Control Theory and Applications , volume=

    Infinite horizon linear quadratic differential games for discrete-time stochastic systems , author=. Journal of Control Theory and Applications , volume=. 2012 , publisher=

    2012

  119. [129]

    arXiv preprint arXiv:1803.06971 , year=

    What doubling tricks can and can't do for multi-armed bandits , author=. arXiv preprint arXiv:1803.06971 , year=

    arXiv

  120. [130]

    arXiv preprint arXiv:2601.11320 , year=

    On Data-based Nash Equilibria in LQ Nonzero-sum Differential Games , author=. arXiv preprint arXiv:2601.11320 , year=

    arXiv

  121. [131]

    Science advances , volume=

    Best reply structure and equilibrium convergence in generic games , author=. Science advances , volume=. 2019 , publisher=

    2019

  122. [132]

    Games and Economic Behavior , volume=

    Multiple equilibria and limit cycles in evolutionary games with logit dynamics , author=. Games and Economic Behavior , volume=. 2012 , publisher=

    2012

  123. [133]

    2012 , publisher=

    Matrix analysis , author=. 2012 , publisher=

    2012

  124. [134]

    Proceedings of the 31st Conference On Learning Theory , pages=

    Learning without mixing: Towards a sharp analysis of linear system identification , author=. Proceedings of the 31st Conference On Learning Theory , pages=. 2018 , organization=

    2018

  125. [135]

    Proceedings of the 24th annual conference on learning theory , pages=

    Regret bounds for the adaptive control of linear quadratic systems , author=. Proceedings of the 24th annual conference on learning theory , pages=. 2011 , organization=

    2011

  126. [136]

    Mathematics of Operations Research , volume=

    On synchronous, asynchronous, and randomized best-response schemes for stochastic Nash games , author=. Mathematics of Operations Research , volume=. 2020 , publisher=

    2020

  127. [137]

    Journal of Political Economy , volume=

    A note on the effect of cost changes on prices , author=. Journal of Political Economy , volume=. 1983 , publisher=

    1983

  128. [138]

    Operations Research , volume=

    Dynamic pricing and inventory control: Uncertainty and competition , author=. Operations Research , volume=. 2010 , publisher=

    2010

  129. [139]

    2000 , publisher=

    Differential games in economics and management science , author=. 2000 , publisher=

    2000

  130. [140]

    Communications in Mathematical Sciences , volume=

    Mean Field Games and systemic risk , author=. Communications in Mathematical Sciences , volume=. 2015 , publisher=

    2015

  131. [141]

    Advances in Neural Information Processing Systems , volume=

    Decentralized Q-learning in zero-sum Markov games , author=. Advances in Neural Information Processing Systems , volume=

  132. [142]

    Operations Research , volume=

    Doubly optimal no-regret online learning in strongly monotone games with bandit feedback , author=. Operations Research , volume=. 2025 , publisher=

    2025

  133. [143]

    42nd International Conference on Machine Learning (ICML 2025) , volume=

    The Harder Path: Last Iterate Convergence for Uncoupled Learning in Zero-Sum Games with Bandit Feedback , author=. 42nd International Conference on Machine Learning (ICML 2025) , volume=

    2025

  134. [144]

    2006 , publisher=

    Prediction, learning, and games , author=. 2006 , publisher=

    2006

  135. [145]

    2024 , publisher=

    Multi-agent reinforcement learning: Foundations and modern approaches , author=. 2024 , publisher=

    2024

  136. [146]

    Management Science , volume=

    Cournot competition in networked markets , author=. Management Science , volume=. 2019 , publisher=

    2019

  137. [147]

    International journal of industrial organization , volume=

    Algorithmic collusion with imperfect monitoring , author=. International journal of industrial organization , volume=. 2021 , publisher=

    2021

Pith tools

Reviewed August 12, 2026 · model on record in the stance chip above.