arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2010.02148cs.GTmath.OC
收藏

Atomic Splittable Flow Over Time游戏

Atomic Splittable Flow Over Time Games

Antonia Adamik, Leon Sering

摘要:

在一个原子可拆分的时间流游戏中,多个玩家通过一个网络动态地路由流,其中边配备有过境时间,指定穿越时间,并具有容量,限制流速。由同一个玩家控制的无限小的流动粒子以恒定的速率到达玩家的原点,玩家的目标是在给定的时间范围内最大化到达玩家目的地的流量。因此,由确定性排队模型描述的流动态,即,不同玩家的流量完美融合,但过多的流量不得不在瓶颈前排队等待。为了确定这种博弈中的纳什均衡,主要的挑战是考虑对参与者策略的适当定义,这取决于参与者在整个博弈中获得的信息水平。对于最严格的版本,其中的参与者没有收到任何关于网络状态的信息,我们可以证明,一般来说,不存在纳什均衡,甚至对于只有两条边的网络也不存在。然而,如果随着时间的推移提供当前边优先级,则玩家可以动态地采用他们的路线选择。我们表明,这些策略的配置文件总是导致一个独特的可行的流量随着时间的推移。因此,那些原子可分裂的时间流游戏是定义良好的。对于平行边网络纳什均衡存在和总流量到达的时间等于最大流量的价值随着时间的推移,导致无政府状态的无政府代价为1。

英文摘要:

In an atomic splittable flow over time game, finitely many players route flow dynamically through a network, in which edges are equipped with transit times, specifying the traversing time, and with capacities, restricting flow rates. Infinitesimally small flow particles controlled by the same player arrive at a constant rate at the player's origin and the player's goal is to maximize the flow volume that arrives at the player's destination within a given time horizon. Hereby, the flow dynamics described by the deterministic queuing model, i.e., flow of different players merges perfectly, but excessive flow has to wait in a queue in front of the bottle-neck. In order to determine Nash equilibria in such games, the main challenge is to consider suitable definitions for the players' strategies, which depend on the level of information the players receive throughout the game. For the most restricted version, in which the players receive no information on the network state at all, we can show that there is no Nash equilibrium in general, not even for networks with only two edges. However, if the current edge congestions are provided over time, the players can adopt their route choices dynamically. We show that a profile of those strategies always lead to a unique feasible flow over time. Hence, those atomic splittable flow over time games are well-defined. For parallel-edge networks Nash equilibria exists and the total flow arriving in time equals the value of a maximum flow over time leading to a price of anarchy of 1.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑