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 Stackelberg game problems with partial dynamic information.

Cite this work

No public copy is stored for this record, so only the metadata is cited.

Stored only when both papers are in the corpus — 83 citations exist upstream.

Papers that cite the same references — the relational fallback while embeddings are still backfilling.