Note: A geometrical method of solving certain games

J. V. Howard

Naval Research Logistics (NRL), 1994, vol. 41, issue 1, 133-136

Abstract: One of the diagrammatic methods for solving two‐person 2 × n matrix games can be extended to solve m × n games where each column of the matrix is a concave function of the row number. This gives a simple proof of a theorem of Benjamin and Goldman that such games have solutions involving no more than two consecutive strategies for the row player, and no more than two strategies for the column player. Two extensions are discussed. © 1994 John Wiley & Sons, Inc.

Date: 1994
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
https://doi.org/10.1002/1520-6750(199402)41:13.0.CO;2-E

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:navres:v:41:y:1994:i:1:p:133-136

Access Statistics for this article

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