A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf
.
Multi-Round Cooperative Search Games with Multiple Players
2019
International Colloquium on Automata, Languages and Programming
Assume that a treasure is placed in one of M boxes according to a known distribution and that k searchers are searching for it in parallel during T rounds. We study the question of how to incentivize selfish players so that group performance would be maximized. Here, this is measured by the success probability, namely, the probability that at least one player finds the treasure. We focus on congestion policies C( ) that specify the reward that a player receives if it is one of players that
doi:10.4230/lipics.icalp.2019.146
dblp:conf/icalp/KormanR19
fatcat:5mc3epu63zeqddlvdhkuxds3gy