Algorithms for Computing Nash Equilibria in Deterministic LQ Games

J.C. Engwerda

Research output: Working paperDiscussion paperOther research output

372 Downloads (Pure)


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.
Original languageEnglish
Place of PublicationTilburg
Number of pages26
Publication statusPublished - 2006

Publication series

NameCentER Discussion Paper


  • Algebraic Riccati equations
  • linear quadratic differential games
  • Nash equilibria

Fingerprint Dive into the research topics of 'Algorithms for Computing Nash Equilibria in Deterministic LQ Games'. Together they form a unique fingerprint.

Cite this