Answers are grounded in this paper and cite their sources.
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.
No takes yet. Share an insight, caveat, or question.
Jacob Christiaan Engwerda (2006) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: