Algorithms for computing Nash equilibria in deterministic LQ games

32Citations
Citations of this article
22Readers
Mendeley users who have this article in their library.

This article is free to access.

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. © Springer-Verlag 2006.

Cite

CITATION STYLE

APA

Engwerda, J. (2007, April). Algorithms for computing Nash equilibria in deterministic LQ games. Computational Management Science. https://doi.org/10.1007/s10287-006-0030-z

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free