부산대학교 도서관

The General Lotto game is a well-studied model where two opposing players strategically allocate a limited amount resources to multiple contests. In the classic setup, each contest represents an individual battlefield with an associated value, and the objective is to maximize the accumulated value by winning individual battlefields. In this paper, we consider scenarios beyond the classic setup, where (i) success on a contest can depend on securing subsets of battlefields, and (ii) the winner of a battlefield can be based on alternate winning rules other than the classic winner-take-all rule. Our main results demonstrate that having an equilibrium solution to a single contest scenario can provide immediate equilibrium characterizations for the weakest-link extension (best-shot), where one player must win all (at least one) of the constituent contests in order to earn any value. We highlight the applicability of the derived theory on network defense problems.