Zero‐sum games with multiple goals

Wade D. Cook

37 citations0/0 files storedNaval Research Logistics Quarterly

No readable copy stored yet — this record is metadata only.

No open-access location is known for this record yet.

Literature note Cite in a project Citation map

Game Theory and Applications Complexity and Algorithms in Graphs Optimization and Mathematical Programming

Abstract

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.

Paper brief

Loading…

Cite this work

Citation unavailable for this work.

BibTeX RIS CSL-JSON

No public copy is stored for this record, so only the metadata is cited.

Citations in this library

Citation map →

Stored only when both papers are in the corpus — 37 citations exist upstream.

References

1956An analog of the minimax theorem for vector payoffs 2007Multiple Criteria Decision Making

Cited by

2011Multicriteria Decision Making 1998Multicriteria Goal Games

Explore the map →

Papers that cite the same references — the relational fallback while embeddings are still backfilling.

Imported from OpenAlex (CC0) — nothing here is generated.