N个竞争AIMD连接的进化博弈
Evolutionary game of N competing AIMD connections
摘要：
本文利用演化博弈的方法对网络的动态行为进行建模。今天有许多不同的协议用于通过互联网进行数据传输，为用户提供更好或更差的服务。选择更好的协议的过程可以被认为是一个与参与者（用户）的动态博弈，试图最大化他们的收益（例如吞吐量）。本文利用右端不连续的微分方程建立了网络的动态模型，证明了解的存在唯一性，建立了网络博弈的支付矩阵，并根据损失敏感性参数得到了网络博弈平衡点存在的条件。仿真结果说明了这一点
英文摘要：
This paper deals with modeling of network's dynamic using evolutionary games approach. Today there are many different protocols for data transmission through the Internet, providing users with better or worse service. The process of choosing better protocol could be considered as a dynamic game with players (users), trying to maximize their payoffs (eg throughput). In this work we presented the model of network's dynamic using differential equations with discontinuous right side and proved existence and uniqueness of the solution, formulated payoff matrix for a network game and found conditions of equilibrium existence depending on loss sensitivity parameter. The results are illustrated by simulations
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
