The search value of a set
研究隐藏者可在有限位置藏匿的搜索博弈，假设搜索成本与顺序无关，推导出成本函数具有子模性，从而将固定隐藏者的搜索博弈置于合作博弈框架中。
We study search games in which the hider may hide in a finite number of locations. We assume that the cost of searching these locations does not depend on the order in which the locations are searched. From these assumptions we derive that the cost function is submodular, thus placing search games with an immobile hider in the context of coalitional games.