关于交通网络上最优流不公平性的研究

考虑实际交通网络中每个局中人成本的问题.在网络中每条边的成本函数为线性函数的条件下,寻找使整个网络可以达到成本最小时的每个局中人的成本;同时考虑每个局中人选择路由策略使自己达到成本最小.研究在可分流（每个局中人的决策对其他局中人的影响可忽略）的自私路由环境中,交通网络每边的成本为线性函数时网络最优流的不公平性.得到在各边的成本函数属于线性函数类时,最优流的不公平性至多为1.

The Unfairness of Optimal Flow in Network Congestion Game

Considering the problem of each player＇s cost in realistic traffic network. If each line has linear latency function in network, we search for each player＇s cost when the entire network can be achieved the minimum cost; at the same time, we search for each player＇s minimum cost if each player taking into ac count the selfish routing. We analyze the network congestion game with nonatomic players （each commod ity represents a large population of individuals, each of whom controls a negligible amount of traffic）. And we research the unfairness of the optimal flow to each commodity. Finally, we have proved that the UOF is at most 1 when each line has linear latency function.