On a ruckle problem in discrete games of ambush

On a ruckle problem in discrete games of ambush

0.00 Avg rating—0 Votes
Article ID: iaor1998342
Country: United States
Volume: 44
Issue: 4
Start Page Number: 353
End Page Number: 364
Publication Date: Jun 1997
Journal: Naval Research Logistics
Authors:
Keywords: military & defence
Abstract:

The following zero-sum games is considered. Red chooses in integer interval [1, n] two integer intervals consisting of k and m points where k + m < n, and Blue chooses an integer point in [1, n]. The payoff to Red equals 1 if the point chosen by Blue is at least in one of the intervals chosen by Red, and 0 otherwise. This work complements the results obtained by Ruckle, Baston and Bostock, and Lee.

Reviews

Required fields are marked *. Your email address will not be published.