15th Triennial World Congress of the International Federation of Automatic Control
  Barcelona, 21–26 July 2002 
INCENTIVE STACKELBERG STRATEGIES FOR FLOW CONFIGURATION OF PARALLEL NETWORKS
Yuanwei Jing* Khosrow Sohraby**
Georgi M. Dimirovski***
* Faculty of Information Science and Engineering,
Northeastern University, Shenyang, 110006, P.R. China
** Computer Science Telecommunications, University of
Missouri - Kansas City, Kansas City, MO 64110, U.S.A.
*** Faculty of Electrical Engineering, St. Cyril and St.
Methodius University, Skopje, MK-91000, R. Macedonia

We consider the problem of flow control using incentive strategy in Stackelberg game theory. The network model employed here is that users route their flows from a common source to a common destination node, each of them trying to optimize its individual performance objective. First, the existing Stackelberg routing strategy is briefly introduced. And then, the linear Stackelberg incentive strategies are presented for both single-follower and multi-follower systems, by which the leader (manager) force the followers (the noncooperative users) adopt the team optimal flow configuration as their reply strategies. We show that our incentive strategy improves the existing Stackelberg routing strategy. A numerical example is given to illustrate our results strategy.
Keywords: Game Theory, Parallel network, Flow configuration, Optimum Routing, Stackelberg Strategy
Session slot T-Fr-M17: H2/H? Control and Differential Games/Area code 2d : Optimal Control