Zero‐sum games with multiple goals

Wade D. Cook

Naval Research Logistics Quarterly, 1976, vol. 23, issue 4, 615-621

Abstract: This paper investigates a class of two‐person zero‐sum multiple payoff games in which each component is deterministic. The problem of minimizing a player's total underachievement of a fixed set of goals is shown to reduce to a linear programming problem. Applications are discussed and illustrative examples are presented.

Date: 1976
References: Add references at CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
https://doi.org/10.1002/nav.3800230406

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:wly:navlog:v:23:y:1976:i:4:p:615-621

Access Statistics for this article

More articles in Naval Research Logistics Quarterly from John Wiley & Sons
Bibliographic data for series maintained by Wiley Content Delivery ().