Skip to main content
SpringerLink
Log in
Book cover

The Theory of Max-Min and its Application to Weapons Allocation Problems

  • Textbook
  • © 1967

Overview

Authors:
  1. John M. Danskin

    1. Center for Naval Analyses of the Franklin-Institute, Arlington, USA

    View author publications

    You can also search for this author in PubMed   Google Scholar

Part of the book series: Ökonometrie und Unternehmensforschung Econometrics and Operations Research (ÖKONOMETRIE, volume 5)

This is a preview of subscription content, log in via an institution to check access.

Access this book

Log in via an institution
eBook USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (7 chapters)

  1. Front Matter

    Pages I-IX
    Download chapter PDF

  2. Introduction

    • John M. Danskin
    Pages 1-9

  3. Finite allocation games

    • John M. Danskin
    Pages 10-18

  4. The directional derivative

    • John M. Danskin
    Pages 19-32

  5. Some Max-Min examples

    • John M. Danskin
    Pages 33-51

  6. A basic weapons selection model

    • John M. Danskin
    Pages 52-84

  7. A model for allocation of weapons to targets

    • John M. Danskin
    Pages 85-106

  8. On stability and Max-Min-Max

    • John M. Danskin
    Pages 107-122

  9. Back Matter

    Pages 123-127
    Download chapter PDF
Back to top

Keywords

About this book

Max-Min problems are two-step allocation problems in which one side must make his move knowing that the other side will then learn what the move is and optimally counter. They are fundamental in parti­ cular to military weapons-selection problems involving large systems such as Minuteman or Polaris, where the systems in the mix are so large that they cannot be concealed from an opponent. One must then expect the opponent to determine on an optlmal mixture of, in the case men­ tioned above, anti-Minuteman and anti-submarine effort. The author's first introduction to a problem of Max-Min type occurred at The RAND Corporation about 1951. One side allocates anti-missile defenses to various cities. The other side observes this allocation and then allocates missiles to those cities. If F(x, y) denotes the total residual value of the cities after the attack, with x denoting the defender's strategy and y the attacker's, the problem is then to find Max MinF(x, y) = Max [MinF(x, y)] .

Authors and Affiliations

  • Center for Naval Analyses of the Franklin-Institute, Arlington, USA

    John M. Danskin

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation