@article{a1924505e76b4a08a7cc1275349cadf6,
title = "Existence and derivation of optimal affine incentive schemes for stackelberg games with partial information: A geometric approach",
abstract = "Through a geometric approach, it is shown that a sufficiently large class of incentive (Stackelberg) problems with perfect or partial dynamic information admits optimal incentive schemes that are affine in the available information. As a byproduct of the analysis. explicit expressions for these affine incentive schemes are obtained, and the general results are applied to two different classes of Steckelberg game problems with perttal dynamic information.",
author = "Zhengh, {Ying Ping} and Tamer Basar",
note = "Funding Information: A recent reference (Basar 1982 a) was addressed primarily to the former one, and developed a general approach that led to attainable bounds for a fairly general class of Stackelberg games under both perfect and partial dynamic information. The main conclusion of Basar (1982 a) was that, even though Received 29 December 1981. t The research of T. Basar was supported in part by the U.S. Air Force under Grant AFOSR-78-3633 and in part by the National Science Foundation under Grant ECS·79-19396. t Decision and Control Laboratory, Coordinated Science Laboratory, University of Illinois, 1101 W. Springfield Ave., Urbana, Illinois 61801, U.S.A. §'Onleave of absence from the Institute of Automation, Academia Sinica, Beijing, Peoples Republic of China.",
year = "1982",
month = jun,
doi = "10.1080/00207178208922667",
language = "English (US)",
volume = "35",
pages = "997--1011",
journal = "International Journal of Control",
issn = "0020-7179",
publisher = "Taylor and Francis Ltd.",
number = "6",
}