scispace - formally typeset
Search or ask a question
Topic

Stackelberg competition

About: Stackelberg competition is a research topic. Over the lifetime, 6611 publications have been published within this topic receiving 109213 citations.


Papers
More filters
Journal ArticleDOI
TL;DR: In this paper, the concept of generalized Stackelberg strategy for nonzero-sum games is extended to allow for a nonunique "rational" response of the follower, which leads to the notion of a generalized Staceck strategy for the leader, which guarantees him a cost value that cannot be exceeded, no matter what the rational response of a follower.
Abstract: The concept of Stackelberg strategy for a nonzero-sum two-person game is extended to allow for a nonunique “rational” response of the follower. This leads to the notion of a generalized Stackelberg strategy for the leader, which guarantees him a cost value that cannot be exceeded, no matter what the “rational” response of the follower. Then, a generalized Stackelberg strategy pair is defined. A simple example is given. The idea of a generalized Stackelberg strategy and strategy pair is then applied to the situation of one leader and many “rational” followers.

223 citations

Journal ArticleDOI
TL;DR: Under certain convexity assumptions, it is shown that the feasible region induced by the leader is continuous in the original problem variables, and this observation is used as a basis for a hybrid algorithm which clings to the inducible region until a local optimum is found.
Abstract: In this paper a model for a two-level planning problem is presented in the form of a static Stackelberg game. By assumption, play is sequential and noncooperative; however, the leader can influence the actions of the followers through a set of coordination variables while the followers' responses may partly determine the leader's payoff. Under certain convexity assumptions, it is shown that the feasible region induced by the leader is continuous in the original problem variables. This observation, coupled with two corollary results, are used as a basis for a hybrid algorithm which clings to the inducible region until a local optimum is found. A branching scheme is then employed to located other segments of the region, eventually terminating with the global optimum. A number of examples are given to highlight the results, while the algorithm's performance is tested in a comparison with two other procedures.

223 citations

Journal ArticleDOI
TL;DR: The Seller's optimal bidding and Buyers' optimal contracting strategies in a von Stackelberg game with the Seller as the leader are derived and it is shown that Buyer's optimal reservation level follows an index that combines the Seller's reservation and execution cost.

221 citations

Journal ArticleDOI
TL;DR: This paper considers a two-echelon reverse supply chain with dual-recycling channels where the recyclable dealer acts as a Stackelberg game leader and the recycler act as a follower and proposes two complementary contracts which succeed in coordinating the reverse supplychain system and create a win-win situation.

220 citations

Journal ArticleDOI
TL;DR: A formal description of the network design problem with continuous decision variables representing link capacities can be cast into a framework of multilevel programming and various suboptimal procedures to solve it are developed.
Abstract: Recently much attention has been focused on multilevel programming, a branch of mathematical programming that can be viewed either as a generalization of min-max problems or as a particular class of Stackelberg games with continuous variables The network design problem with continuous decision variables representing link capacities can be cast into such a framework We first give a formal description of the problem and then develop various suboptimal procedures to solve it Worst-case behaviour results concerning the heuristics, as well as numerical results on a small network, are presented

216 citations


Network Information
Related Topics (5)
Scheduling (computing)
78.6K papers, 1.3M citations
84% related
Optimization problem
96.4K papers, 2.1M citations
83% related
Supply chain
84.1K papers, 1.7M citations
81% related
Markov chain
51.9K papers, 1.3M citations
78% related
Network packet
159.7K papers, 2.2M citations
77% related
Performance
Metrics
No. of papers in the topic in previous years
YearPapers
2023551
20221,041
2021563
2020557
2019582
2018487