Algorithms for computing Nash equilibria in deterministic LQ games

Jacob Christiaan Engwerda

48 citations0/0 files storedComputational Management Science

No readable copy stored yet — this record is metadata only.

No open-access location is known for this record yet.

Literature note Cite in a project Citation map

Game Theory and Applications Advanced Control Systems Optimization Adaptive Dynamic Programming Control

Abstract

In this paper we review a number of algorithms to compute Nash equilibria in deterministic linear quadratic differential games. We will review the open-loop and feedback information case. In both cases we address both the finite and the infinite-planning horizon.

Paper brief

Loading…

Cite this work

Citation unavailable for this work.

BibTeX RIS CSL-JSON

No public copy is stored for this record, so only the metadata is cited.

Citations in this library

Citation map →

Stored only when both papers are in the corpus — 48 citations exist upstream.

References

1982Dynamic Noncooperative Game Theory 2000Differential Games in Economics and Management Science 1969Nonzero-sum differential games 2004Differential Games in Marketing 1969Further properties of nonzero-sum differential games 1985Oligopoly Extraction of a Common Property Natural Resource: The Importance of the Period of Commitment in Dynamic Games 1979On the existence of Nash strategies and solutions to coupled riccati equations in linear-quadratic games 2006Dynamic Modeling of Monetary and Fiscal Cooperation Among Nations

Explore the map →

Papers that cite the same references — the relational fallback while embeddings are still backfilling.

Imported from OpenAlex (CC0) — nothing here is generated.