原子拥塞博弈中最坏情况纳什均衡的脆弱性
On the Fragility of Worst-Case Nash Equilibria in Atomic Congestion Games
- University of Colorado at Colorado Springs（科罗拉多大学科罗拉多斯普林斯分校）
- Politecnico di Torino（都灵理工大学）
- Thayer School of Engineering, Dartmouth College（达特茅斯学院塔克工程学院）
机构由 AI 辅助整理，请以论文原文为准。
AI总结：
本研究证明原子拥塞博弈中，智能体在均衡时的满意度与系统效率正相关，且最坏情况纳什均衡具有脆弱性，即智能体在均衡与最优行动间无差异，满意度与低效不可兼得。
AI中文摘要：
智能出行系统中的总体性能在很大程度上依赖于参与其中的自私、资源共享智能体的涌现行为。因此，近期研究聚焦于系统设计者如何利用激励措施来影响行为，从而使系统成本（例如交通拥堵）最小化。这些结果表明，与系统最优配置相比，最坏情况均衡可能相当低效。然而，尚不清楚在这些最坏情况场景中，智能体在多大程度上对其决策感到“满意”。我们证明，在任何有激励的原子拥塞博弈中，智能体在均衡时的总体满意度（相对于其在最优配置中的行动）与相应系统成本的效率相关，即如果智能体对其均衡选择非常满意，则该均衡必然相对高效。此外，我们表明最坏情况纳什均衡是脆弱的，因为每个智能体在其最坏情况均衡行动与系统最优配置行动之间是无差异的。总之，在均衡状态下，要么智能体对其决策高度满意，要么其决策高度低效，但两者不可能同时成立。这项工作补充了其他类别博弈的近期结果，这些结果表明最坏情况均衡效率保证仅在智能体对其决策无差异时出现。
英文摘要：
Aggregate performance in smart mobility systems depends heavily on the emergent behavior of selfish, resource-sharing agents that participate within the systems. As a result, recent work has focused on how a system designer can leverage incentives to influence behavior so that system cost (e.g., traffic congestion) is minimized. These results show that worst-case equilibria can be quite inefficient compared to system-optimal allocations. However, it is unclear to what extent agents are ``satisfied'' with their decisions in these worst-case scenarios. We demonstrate that in any incentivized atomic congestion game, agents' aggregate satisfaction at equilibrium (relative to their actions in an optimal allocation) is correlated with the efficiency of the corresponding system cost, in the sense that if agents are very satisfied with their equilibrium choices, the equilibrium must be relatively efficient. Further, we show that worst-case Nash equilibria are fragile, as every agent is indifferent between their action in a worst-case equilibrium and their action in a system-optimal allocation. In summary, at equilibrium, either agents are highly satisfied with their decisions or their decisions are highly inefficient, but both cannot be true simultaneously. This work adds to recent results for other classes of games which indicate that worst-case equilibrium efficiency guarantees only occur when agents are indifferent about their decisions.
