Skip to main content

Bar-Gain Boxes: An Informative Illustration of the Pairing Problem

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 2980))

Abstract

A practical problem in command and control is to assign assets (e.g., bomber planes) to targets (e.g., hostile sites), one-on-one, in order to optimize an overall operation. The asset-target pairing must be completed quickly (before targets act), and the expected effectiveness of an asset against a target depends on a number of factual and judgmental factors. Here I present a diagram called ”Bar-Gain Boxes” designed to help people solve the problem. The diagram uses a matrix of boxes to illustrate the possible pairings, along with color-coded bars (in each box) to illustrate the gain associated with each individual asset-target pair. The diagram is informative because it displays algorithmic results and underlying reasons, for normative and alternative solutions.

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

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
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

Purchases are for personal use only

Learn about institutional subscriptions

References

  1. Bertsekas, D.P.: Auction Algorithms for Network Flow Problems: A Tutorial Introduction. Comput. Optim. Appl. 1, 7–66 (1992)

    MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Burns, K. (2004). Bar-Gain Boxes: An Informative Illustration of the Pairing Problem. In: Blackwell, A.F., Marriott, K., Shimojima, A. (eds) Diagrammatic Representation and Inference. Diagrams 2004. Lecture Notes in Computer Science(), vol 2980. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-25931-2_44

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-25931-2_44

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-21268-3

  • Online ISBN: 978-3-540-25931-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics