An improved algorithm for finding saddlepoints of two-person zero-sum games

Research output: Contribution to journalArticle

Abstract

It is well-known that one can sort (order)n real numbers in at most F0(n) =nl - 2l + 1 steps (comparisons), where l = [log2n]. We snow how to find the strict saddlepoint or prove its absence in an m by n matrix, m ≤n, in at most F0(m)+F0(m+1)+n+m - 3 + (n-m) [log2(m+1)] steps.

Original languageEnglish (US)
Pages (from-to)149-159
Number of pages11
JournalInternational Journal of Game Theory
Volume20
Issue number2
DOIs
StatePublished - Jun 1 1991

All Science Journal Classification (ASJC) codes

  • Statistics and Probability
  • Mathematics (miscellaneous)
  • Social Sciences (miscellaneous)
  • Economics and Econometrics
  • Statistics, Probability and Uncertainty

Fingerprint Dive into the research topics of 'An improved algorithm for finding saddlepoints of two-person zero-sum games'. Together they form a unique fingerprint.

  • Cite this