Recursive solution of linear-quadratic Nash games for weakly interconnected systems (Q1091319)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Recursive solution of linear-quadratic Nash games for weakly interconnected systems |
scientific article; zbMATH DE number 4010297
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Recursive solution of linear-quadratic Nash games for weakly interconnected systems |
scientific article; zbMATH DE number 4010297 |
Statements
Recursive solution of linear-quadratic Nash games for weakly interconnected systems (English)
0 references
1988
0 references
A recursive method is developed for the solution of coupled algebraic Riccati equations and corresponding linear Nash strategies of weakly interconnected systems. It is shown that the given algorithm converges to the exact solution with the rate of convergence of \(0(\epsilon ^ 2)\), where \(\epsilon\) is a small coupling parameter. In addition, only low- order systems are involved in algebraic computations; the amount of computations required does not grow per iteration and no analyticity assumption is imposed on the system coefficients.
0 references
coupled algebraic Riccati equations
0 references
linear Nash strategies
0 references
weakly interconnected systems
0 references
algorithm
0 references
0 references