Skip to main content

1997 | OriginalPaper | Buchkapitel

The Stackelberg Problem: General Case

verfasst von : Kiyotaka Shimizu, Yo Ishizuka, Jonathan F. Bard

Erschienen in: Nondifferentiable and Two-Level Mathematical Programming

Verlag: Springer US

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config
loading …

The Stackelberg problem is the most challenging two-level structure that we examine in this book. It has numerous interpretations but originally it was proposed as a model for a leader-follower game in which two players try to minimize their individual objective functions F(x, y) and f (x, y), respectively, subject to a series of interdependent constraints [S28, S27]. Play is defined as sequential and the mood as noncooperative. The decision variables are partitioned between the players in such a way that neither can dominate the other. The leader goes first and through his choice of x ∈ Rn is able to influence but not control the actions of the follower. This is achieved by reducing the set of feasible choices available to the latter. Subsequently, the follower reacts to the leader’s decision by choosing a y ∈ Rm in an effort to minimizes his costs. In so doing, he indirectly affects the leader’s solution space and outcome.

Metadaten
Titel
The Stackelberg Problem: General Case
verfasst von
Kiyotaka Shimizu
Yo Ishizuka
Jonathan F. Bard
Copyright-Jahr
1997
Verlag
Springer US
DOI
https://doi.org/10.1007/978-1-4615-6305-1_15