.png){kind=icon}
返回
Searching for multiple objects in multiple locations
.png){kind=icon}
OA
AI
DOI：10.1016/j.ejor.2019.05.002.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Many practical search problems concern the search for multiple hidden objects or agents, such as earthquake survivors. In such problems, knowing only the list of possible locations, the Searcher needs to find all the hidden objects by visiting these locations one by one. To study this problem, we formulate new game-theoretic models of discrete search between a Hider and a Searcher. The Hider hides k balls in n boxes, and the Searcher opens the boxes one by one with the aim of finding all the balls. Every time the Searcher opens a box she must pay its search cost, and she either finds one of the balls it contains or learns that it is empty. If the Hider is an adversary, an appropriate payoff function may be the expected total search cost paid to find all the balls, while if the Hider is Nature, a more appropriate payoff function may be the difference between the total amount paid and the amount the Searcher would have to pay if she knew the locations of the balls a priori (the regret). We give a full solution to the regret version of this game, and a partial solution to the search cost version. We also consider variations on these games for which the Hider can hide at most one ball in each box. The search cost version of this game has already been solved in previous work, and we give a partial solution in the regret version. (C) 2019 Elsevier B.V. All rights reserved.
Keyword:
Game theory
Search games
Discrete optimization
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6
论文数:
2.2W
被引数:
6.4W
机构
引用论文
分享收藏分享收藏REGRET THEORY - AN ALTERNATIVE THEORY OF RATIONAL CHOICE UNDER UNCERTAINTY后悔理论 -- 不确定条件下理性选择的另一种理论.png)
ECONOMIC JOURNAL
ECONOMIC JOURNALIF3.6
PREAI
分享收藏
查看更多内容