Iterative Techniques for the Nash Solution in Quadratic Games with Unknown Parameters

DOI10.1137/0324052zbMath0615.90100OpenAlexW1965387891MaRDI QIDQ4724443

George P. Papavassilopoulos

Publication date: 1986

Published in: SIAM Journal on Control and Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0324052

zbMATH Keywords

convergencestochastic approximationadaptive schemesrepeated quadratic Nash games

Mathematics Subject Classification ID

Martingales with discrete parameter (60G42) 2-person games (91A05) Stochastic games, stochastic differential games (91A15)

Related Items

Distributed algorithms for the computation of noncooperative equilibria ⋮ Distributed computation of Pareto solutions in \(n\)-player games ⋮ On generalized Nash games and variational inequalities ⋮ Bilevel direct search method for leader-follower problems and application in health insurance ⋮ Learning algorithms for repeated bimatrix Nash games with incomplete information ⋮ An Inverse-Adjusted Best Response Algorithm for Nash Equilibria ⋮ Pretending in dynamic games, alternative outcomes and application to electricity markets