New approach to linear Stackelberg problems with multiple leaders-follower (Q2779011)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: New approach to linear Stackelberg problems with multiple leaders-follower |
scientific article; zbMATH DE number 1723809
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | New approach to linear Stackelberg problems with multiple leaders-follower |
scientific article; zbMATH DE number 1723809 |
Statements
31 May 2003
0 references
Stackelberg game
0 references
linear programming
0 references
penalty function method
0 references
New approach to linear Stackelberg problems with multiple leaders-follower (English)
0 references
A linear static Stackelberg problem with mutiple leaders-followers is studied in this paper. The players within each group may or may not cooperate. This model extends the Stackelberg leader-follower model. An exact penalty function method, in which to the leaders objective function is added the duality gaps of the followers problem with a penalty, is developed. Because of its structure, the composite problem decomposes into a series of linear programming problems. This leads to an efficient algorithm for the composite problem. It is shown that local optimality is reached for an exact penalty function. Three examples are also presented.
0 references
0.8263760209083557
0 references