Routing Resource Distribution Strategy Based on Game Theory

FONT face; Verdana; DONG Jun; ZHAN Cong-min; SHU Jing; FONT

您当前的位置：

首页 >

文章列表页 >

Routing Resource Distribution Strategy Based on Game Theory

更新时间：2025-07-16

- Routing Resource Distribution Strategy Based on Game Theory
- Acta Electronica Sinica Vol. 38, Issue 2A, Pages: 143-147(2010)
- 作者机构：
  
  （华东师范大学软件学院，）,上海,200062
- 作者简介：
- 基金信息：
- DOI：
  CLC： TP393.0
- Published：2010
- 稿件说明：
移动端阅览
FONT face, Verdana, DONG Jun, et al. Routing Resource Distribution Strategy Based on Game Theory[J]. Acta Electronica Sinica, 2010, 38(2A): 143-147.
DOI：

FONT face, Verdana, DONG Jun, et al. Routing Resource Distribution Strategy Based on Game Theory[J]. Acta Electronica Sinica, 2010, 38(2A): 143-147. DOI：

摘要

<FONT face=Verdana>对策论提供对独立参与者之间冲突进行建模的框架，可用以综合考虑路由选择和拥塞控制问题.经典的对策论不一定直接能应用于网络.本文在路由选择的多Agent系统的基础上，给出具有“惩恶扬善”行为的基于对策论的路由资源分配策略.它奖励避免拥塞、惩罚行为不合要求的用户.在用户都是理性的前提下，系统能稳定在纳什均衡状态.

Abstract

<FONT face=Verdana>Game theory is alternative framework to model confliction between independence players

which can be used to solve the problem.However

classic game theory couldn’t be applied to network directly.Game theory based routing approach MPS

which <FONT face=Verdana>can “encourage merit and punish evil”

is presented.It rewards congestion avoiding users and punishes misbehaving users.A Nash Equilibrium could be reached when players are rational.

关键词

Keywords

references

Views

1132

下载量

CSCD

Alert me when the article has been cited

提交

Tools

Publicity Resources

No data

Related Author

No data

Related Institution

No data

⁰