On the linear-quadratic, closed-loop, no-memory Nash game

Papavassilopoulos, G; Olsder, G

dc.contributor.author	Papavassilopoulos, G	en
dc.contributor.author	Olsder, G	en
dc.date.accessioned	2014-03-01T01:38:36Z
dc.date.available	2014-03-01T01:38:36Z
dc.date.issued	1984	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/22277
dc.subject	algebraic riccati equation	en
dc.subject	Linear Quadratic	en
dc.title	On the linear-quadratic, closed-loop, no-memory Nash game	en
heal.type	journalArticle	en
heal.identifier.primary	10.1007/BF00934566	en
heal.identifier.secondary	http://dx.doi.org/10.1007/BF00934566	en
heal.publicationDate	1984	en
heal.abstract	Linear closed-loop no-memory strategies for the LQ Nash game are considered. We exhibit a class of such problems with the property that the solution exists for any finite time interval; for the infinite time case, there exist none or a unique or many solutions, depending on the choice of the parameters. In addition, the limit of the finite time solution	en
heal.journalName	Journal of Optimization Theory and Applications	en
dc.identifier.doi	10.1007/BF00934566	en