Abstract
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 ∈ R n 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 ∈ R m in an effort to minimizes his costs. In so doing, he indirectly affects the leader’s solution space and outcome.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1997 Springer Science+Business Media New York
About this chapter
Cite this chapter
Shimizu, K., Ishizuka, Y., Bard, J.F. (1997). The Stackelberg Problem: General Case. In: Nondifferentiable and Two-Level Mathematical Programming. Springer, Boston, MA. https://doi.org/10.1007/978-1-4615-6305-1_15
Download citation
DOI: https://doi.org/10.1007/978-1-4615-6305-1_15
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4613-7895-2
Online ISBN: 978-1-4615-6305-1
eBook Packages: Springer Book Archive