当前位置: X-MOL 学术J. Comput. Syst. Sci. › 论文详情
Multi-round cooperative search games with multiple players
Journal of Computer and System Sciences ( IF 1.129 ) Pub Date : 2020-05-22 , DOI: 10.1016/j.jcss.2020.05.003
Amos Korman; Yoav Rodeh

A treasure is placed in one of M boxes according to a known distribution and k searchers are searching for it in parallel during T rounds. How can one incentivize selfish players so that the probability that at least one player finds the treasure is maximized? We focus on congestion policies C(ℓ) specifying the reward a player receives being one of the ℓ players that (simultaneously) find the treasure first. We prove that the exclusive policy, in which C(1)=1 and C(ℓ)=0 for ℓ>1, yields a price of anarchy of (1−(1−1/k)k)−1, which is the best among all symmetric reward policies. We advocate the use of symmetric equilibria, and show that besides being fair, they are highly robust to crashes of players. Indeed, in many cases, if some small fraction of players crash, symmetric equilibria remain efficient in terms of their group performance while also serving as approximate equilibria.
更新日期:2020-05-22

 

全部期刊列表>>
Springer化学材料学
骄傲月
如何通过Nature平台传播科研成果
跟Nature、Science文章学绘图
隐藏1h前已浏览文章
中洪博元
课题组网站
新版X-MOL期刊搜索和高级搜索功能介绍
ACS材料视界
x-mol收录
南开大学
朱守非
廖良生
郭东升
汪铭
伊利诺伊大学香槟分校
徐明华
中山大学化学工程与技术学院
试剂库存
天合科研
down
wechat
bug