Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

On a ruckle problem in discrete games of ambush

On a ruckle problem in discrete games of ambush The following zero‐sum game 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. © 1997 John Wiley & Sons, Inc. Naval Research Logistics 44: 353–364, 1997 http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Naval Research Logistics: An International Journal Wiley

On a ruckle problem in discrete games of ambush

Download PDF
12 pages

Loading next page...
 
/lp/wiley/on-a-ruckle-problem-in-discrete-games-of-ambush-N9plub0jEM

References (2)

Publisher
Wiley
Copyright
Copyright © 1997 John Wiley & Sons, Inc.
ISSN
0894-069X
eISSN
1520-6750
DOI
10.1002/(SICI)1520-6750(199706)44:4<353::AID-NAV5>3.0.CO;2-5
Publisher site
See Article on Publisher Site

Abstract

The following zero‐sum game 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. © 1997 John Wiley & Sons, Inc. Naval Research Logistics 44: 353–364, 1997

Journal

Naval Research Logistics: An International Journal – Wiley

Published: Jun 1, 1997

There are no references for this article.