Network scheduling algorithm based on Stackelberg Game with incentive strategy

First, a Stackelberg Game network model was built. In this model, the existence of Nash equilibrium was analyzed and the team optimal solution of the network was available. Then a network scheduling algorithm based on Stackelberg Game with incentive strategy which can adjust the network from general...

Full description

Saved in:
Bibliographic Details
Main Authors: WEI Jiao-long, HU Jin, DAI Wen-juan, ZOU Jia-hong
Format: Article
Language:zho
Published: Editorial Department of Journal on Communications 2009-01-01
Series:Tongxin xuebao
Subjects:
Online Access:http://www.joconline.com.cn/zh/article/74652147/
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:First, a Stackelberg Game network model was built. In this model, the existence of Nash equilibrium was analyzed and the team optimal solution of the network was available. Then a network scheduling algorithm based on Stackelberg Game with incentive strategy which can adjust the network from general state to optimal state by dynamic Game and gradual induction was introduced into the network resource management. The team-optimal solution ensures the stability of network in the optimal state. Finally, the simulation results demonstrate the effectiveness of the algorithm.
ISSN:1000-436X