排序方式: 共有2条查询结果,搜索用时 0 毫秒
1
1.
In this article we shall deal with some two-person games on a lattice. These are games of search and ambush where the set of strategies of one of the players is determined by functions on the lattice. We give a general method to obtain a solution of these games and we apply it to three particular games. © 1993 John Wiley & Sons, Inc. 相似文献
2.
This article deals with a two‐person zero‐sum game in which player I chooses in integer interval [1, N] two integer intervals consisting of p and q points where p + q < N, and player II chooses an integer point in [1, N]. The payoff to player I equals 1 if the point chosen by player II is at least in one of the intervals chosen by player II and 0 otherwise. This paper complements the results obtained by Ruckle, Baston and Bostock, Lee, Garnaev, and Zoroa, Zoroa and Fernández‐Sáez. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48: 98–106, 2001 相似文献
1