The Minimax Property in Infinite Two-Person Win-Lose Games
研究了无限策略两人输赢博弈的极小化极大定理，在可数情形给出组合条件，在一般情形证明博弈及其所有子博弈满足极小化极大性质当且仅当没有子博弈同构于“较大数博弈”，并推广了Hanneke等人的定理。
We explore a version of the minimax theorem for two-person win-lose games with infinitely many pure strategies. In the countable case, we give a combinatorial condition on the game which implies the minimax property. In the general case, we prove that a game satisfies the minimax property along with all its subgames if and only if none of its subgames is isomorphic to the “larger number game.” This generalizes a recent theorem of Hanneke, Livni, and Moran. We also propose several applications of our results outside of game theory.