GENERAL THEORY FOR STACKELBERG GAMES WITH PARTIAL STATE INFORMATION.

Research output: Contribution to journalArticle

Abstract

This paper presents a general method for derivation of a tight lower bound on the Stackelberg cost of the leader in general two-person deterministic games with partial dynamic state information. The method converts the original dynamic Stackelberg problem into two open-loop optimization problems whose solutions can readily be obtained using the standard techniques of optimization and optimal control theory. When applied to the class of linear-quadratic dynamic games with partial dynamic information, defined on general Hilbert spaces, each one of these open-loop optimization problems becomes a quadratic programming problem with linear constraints, thus allowing for an explicit computation of the Stackelberg cost value.

Original languageEnglish (US)
Pages (from-to)47-56
Number of pages10
JournalLarge Scale Systems
Volume3
Issue number1
StatePublished - Jan 1 1982

Fingerprint

Quadratic programming
Hilbert spaces
Control theory
Costs

ASJC Scopus subject areas

  • Engineering(all)

Cite this

GENERAL THEORY FOR STACKELBERG GAMES WITH PARTIAL STATE INFORMATION. / Basar, Tamer.

In: Large Scale Systems, Vol. 3, No. 1, 01.01.1982, p. 47-56.

Research output: Contribution to journalArticle

@article{8b51acce26a144b5949c35a7e184ada1,
title = "GENERAL THEORY FOR STACKELBERG GAMES WITH PARTIAL STATE INFORMATION.",
abstract = "This paper presents a general method for derivation of a tight lower bound on the Stackelberg cost of the leader in general two-person deterministic games with partial dynamic state information. The method converts the original dynamic Stackelberg problem into two open-loop optimization problems whose solutions can readily be obtained using the standard techniques of optimization and optimal control theory. When applied to the class of linear-quadratic dynamic games with partial dynamic information, defined on general Hilbert spaces, each one of these open-loop optimization problems becomes a quadratic programming problem with linear constraints, thus allowing for an explicit computation of the Stackelberg cost value.",
author = "Tamer Basar",
year = "1982",
month = "1",
day = "1",
language = "English (US)",
volume = "3",
pages = "47--56",
journal = "Large Scale Systems",
issn = "0167-420X",
publisher = "North-Holland Publ Co",
number = "1",

}

TY - JOUR

T1 - GENERAL THEORY FOR STACKELBERG GAMES WITH PARTIAL STATE INFORMATION.

AU - Basar, Tamer

PY - 1982/1/1

Y1 - 1982/1/1

N2 - This paper presents a general method for derivation of a tight lower bound on the Stackelberg cost of the leader in general two-person deterministic games with partial dynamic state information. The method converts the original dynamic Stackelberg problem into two open-loop optimization problems whose solutions can readily be obtained using the standard techniques of optimization and optimal control theory. When applied to the class of linear-quadratic dynamic games with partial dynamic information, defined on general Hilbert spaces, each one of these open-loop optimization problems becomes a quadratic programming problem with linear constraints, thus allowing for an explicit computation of the Stackelberg cost value.

AB - This paper presents a general method for derivation of a tight lower bound on the Stackelberg cost of the leader in general two-person deterministic games with partial dynamic state information. The method converts the original dynamic Stackelberg problem into two open-loop optimization problems whose solutions can readily be obtained using the standard techniques of optimization and optimal control theory. When applied to the class of linear-quadratic dynamic games with partial dynamic information, defined on general Hilbert spaces, each one of these open-loop optimization problems becomes a quadratic programming problem with linear constraints, thus allowing for an explicit computation of the Stackelberg cost value.

UR - http://www.scopus.com/inward/record.url?scp=0020090748&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0020090748&partnerID=8YFLogxK

M3 - Article

AN - SCOPUS:0020090748

VL - 3

SP - 47

EP - 56

JO - Large Scale Systems

JF - Large Scale Systems

SN - 0167-420X

IS - 1

ER -