We introduce a new class of games, asynchronous congestion games (ACGs). In an ACG, each player has a task that can be carried out by any element of a set of resources, and each resource executes its assigned tasks in a random order. Each player's aim is to minimize his expected cost which is the sum of two terms - the sum of the fixed costs over the set of his utilized resources and the expected cost of his task execution. The cost of a player's task execution is determined by the earliest time his task is completed, and thus it might be beneficial for him to assign his task to several resources. We prove the existence of pure strategy Nash equilibria in ACGs. Moreover, we present a polynomial time algorithm for finding such an equilibrium in a given ACG.
我们介绍了一种新型游戏,即异步拥塞游戏 I>(ACG)。在ACG中,每个玩家都有一个可由资源集中的任何元素执行的任务,并且每个资源都以随机顺序执行其分配的任务。每个参与者的目标是最小化他的预期成本,该预期成本是两个条件的总和-固定成本在其已利用资源集合上的总和以及其任务执行的预期成本。玩家执行任务的成本取决于其任务最早完成的时间,因此将其任务分配给多个资源可能对他有利。我们证明了纯策略纳什均衡在ACG中的存在。此外,我们提出了一种在给定的ACG中找到这种平衡的多项式时间算法。 P>
pure-strategy Nash equilibrium;
机译:通过网络拥塞游戏方法的交通拥堵定价
机译:游戏时间表拥塞会影响每周工作负载,但在半专业篮球中没有个别游戏需求
机译:基于空间代理的拥塞博弈模型:空间演化博弈论
机译:异步拥塞游戏
机译:异步传输模式网络中可用比特率服务的显式拥塞控制算法。
机译:赛程安排拥挤会影响每周的工作量但不会影响半职业篮球的个人比赛需求
机译:异步拥塞游戏