必应词典为您提供price-of-anarchy的释义,网络释义: 代价;无政府的代价;
POA等于这个game中的全局最优解 比 纳什均衡解中的最小值,也就是说,POA越大,意味着纳什均衡解中差的那一面越差。 POS等于这个game中的全局最优解 比 纳什均衡解中的最大值,POS越接近1,代表这个纳什均衡解好的那一面越好。 发布于 2018-11-23 22:54 AI 总结 如何理解博弈论中的POA(price of ana...
这是lecture note里面的介绍,但是是这章大后期了 POA (price of anarchy)就是在equilibrium情况下总cost和最小cost的比值。(这个东西很有意义 是因为在没有任何管理的情况下,并不是所有的情况都会发生,每个流量都会前往让自己cost最小的情况,而不是随机的,所以是合理的设定) 当前的例子,equilibrium 是上边走1/2...
Most of us prefer to commute by the shortest route available, without taking into account the traffic congestion that we cause for others. Many networks, including computer networks, suffer from some type of this "selfish routing." In Selfish Routing and the Price of Anarchy, Tim Roughgarden st...
Price of anarchySynonymsCoordination ratioYears and Authors of Summarized Original Work2005; KoutsoupiasProblem DefinitionThe price of anarchy captures the lack of coordination in systems where users are selfish anddoi:10.1007/978-3-642-27848-8_299-2George Christodoulou...
Intrinsic Robustness of the Price of Anarchy Summary: The price of anarchy (POA) is a worst-case measure of the inefficiency of selfish behavior, defined as the ratio of the objective function value o... T Roughgarden - DBLP 被引量: 627发表: 2009年 On the Price of Anarchy and Stability...
Price of Anarchy 作者:Surhone, Lambert M.; Tennoe, Mariam T.; Henssonow, Susan F. 页数:104 ISBN:9786133260474 豆瓣评分 目前无人评价 评价: 写笔记 写书评 加入购书单 分享到 推荐 我要写书评 Price of Anarchy的书评 ···(全部 0 条)
Section 3 quantifies the price of anarchy for the limiting case of an infinite number of agents. In Section 4, we investigate the effect heterogeneity has in the value of the game, while Section 5 provides some directions for future work....
In this paper, we define a network service provider game. We show that the price of anarchy of the defined game can be bounded by analyzing a local search heuristic for a related facility location problem called thek-facility location problem. As a result, we show that thek-facility locat...
PoA = Price of Anarchy Anarchy = 无政府主义、混乱 如果不要中心化的authority来组织,那要付出多大的代价(相比性能下降多少)(我的理解)Notation game G = (N,S,u) 玩家有 N 个,单个某个玩家记为 i 单个某个玩家的策略集合为 S_i (这里只假定做的策略是确定性的,只选择某一个动作) 单个某个玩家...