Algorithms for Computing Nash Equilibria in Deterministic Lq Games
CentER Discussion Paper Series No. 2006-109
25 Pages Posted: 24 Nov 2006
Date Written: October 2006
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.
Keywords: Algebraic Riccati equations, linear quadratic differential games, Nash equilibria
JEL Classification: C61, C72, C73
Suggested Citation: Suggested Citation
Engwerda, Jacob C., Algorithms for Computing Nash Equilibria in Deterministic Lq Games (October 2006). CentER Discussion Paper Series No. 2006-109, Available at SSRN: https://ssrn.com/abstract=946935 or http://dx.doi.org/10.2139/ssrn.946935
Do you have negative results from your research you’d like to share?
Feedback
Feedback to SSRN
If you need immediate assistance, call 877-SSRNHelp (877 777 6435) in the United States, or +1 212 448 2500 outside of the United States, 8:30AM to 6:00PM U.S. Eastern, Monday - Friday.