IDEAS home Printed from https://ideas.repec.org/a/inm/oropre/v10y1962i3p300-309.html
   My bibliography  Save this article

A Theory of Reconnaissance: II

Author

Listed:
  • John M. Danskin

    (Institute of Defense Analyses, Cambridge, Massachusetts)

Abstract

In Part I of this two-part paper, the author considered the one-sided reconnaissance problem, in which the reconnoiterer seeks to maximize the information (minimize the confusion) obtained as a result of the expenditure of a given effort, it being assumed that the side being reconnoitered remains passive. This problem was formulated as a problem in information theory. This part concerns the two-sided reconnaissance problem, in which the side being reconnoitered seeks to minimize the information (maximize the confusion) obtained by the reconnoiterer, while maintaining at least a certain minimum acceptable threat with a fixed budget. This problem, formulated as a zero-sum, two-person game, is solved for one special case (fixed equipment) and it is proved that there exists a solution in mixed strategies for the general case. A model is given for evaluating the effectiveness of a photo-interpreter by separating the confusion caused by the photointerpreter from that caused by the photographs.

Suggested Citation

  • John M. Danskin, 1962. "A Theory of Reconnaissance: II," Operations Research, INFORMS, vol. 10(3), pages 300-309, June.
    • Handle: RePEc:inm:oropre:v:10:y:1962:i:3:p:300-309
    DOI: 10.1287/opre.10.3.300
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.10.3.300
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.10.3.300?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Moshe Kress & Kyle Lin & Roberto Szechtman, 2008. "Optimal discrete search with imperfect specificity," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 68(3), pages 539-549, December.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:inm:oropre:v:10:y:1962:i:3:p:300-309. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.