We solve the following two-person zero-sum game, introduced by Ruckle. Players I and II simultaneously choose sequences of m m and n n consecutive integers respectively from the integers 1 to p p inclusive. The payoff to I is the number of integers in the intersection of the two sequences. A continuous version of this game is also solved as well as the variations in which one of the players need not choose his integers consecutively.
No takes yet. Share an insight, caveat, or question.
Baston et al. (1989) studied this question.
Synapse has enriched 5 related papers. Consider them for comparative context: