Algorithms for static stackelberg games with linear costs and polyhedra constraints

Papavassilopoulos, G

dc.contributor.author	Papavassilopoulos, G	en
dc.date.accessioned	2014-03-01T02:47:33Z
dc.date.available	2014-03-01T02:47:33Z
dc.date.issued	1982	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/33221
dc.subject	stackelberg game	en
dc.subject	Decision Maker	en
dc.title	Algorithms for static stackelberg games with linear costs and polyhedra constraints	en
heal.type	conferenceItem	en
heal.identifier.primary	10.1109/CDC.1982.268221	en
heal.identifier.secondary	http://dx.doi.org/10.1109/CDC.1982.268221	en
heal.publicationDate	1982	en
heal.abstract	Three algorithms for solving the static Stackelberg game with two decision makers, linear costs and polyhedra constraints are presented. The nonconvexity of the Reaction set of the Follower is a major source of difficulty in solving such problems. The algorithms presented are able to bypass this difficulty and find the solution in a finite number of iterations.	en
heal.journalName	Conference on Decision and Control	en
dc.identifier.doi	10.1109/CDC.1982.268221	en