A note on strategy elimination in bimatrix games

Authors:
Donald E. Knuth;Christos H. Papadimitriou;John N. Tsitsiklis
Affiliations:
Department of Computer Science, Stanford University, Stanford, CA 94305, USA;Department of Computer Science and Engineering, University of California at San Diego, CA, USA;Department of Electrical Engineering and Computer Science, M.I.T., Cambridge, MA, USA
Venue:
Operations Research Letters
Year:
1988

Citing 1
Cited 2

Matrix multiplication via arithmetic progressions

STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing

Perspectives on multiagent learning

Artificial Intelligence
On the order of eliminating dominated strategies

Operations Research Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

In bimatrix games we study the process of successively eliminating strategies which are dominated by other pure strategies. We show how to perform this simplification in O(n^3) time, where n is the number of strategies. We also prove that the problem is P-complete, which suggests that it is inherently sequential.