A note on strategy elimination in bimatrix games
From MaRDI portal
Publication:1102210
DOI10.1016/0167-6377(88)90075-2zbMath0643.90100OpenAlexW2055365588MaRDI QIDQ1102210
John N. Tsitsiklis, Donald E. Knuth, Christos H. Papadimitriou
Publication date: 1988
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0167-6377(88)90075-2
parallel complexitybimatrix gamesmatrix multiplicationP-completenessstrategy dominationstrategy elimination process
Analysis of algorithms and problem complexity (68Q25) Noncooperative games (91A10) 2-person games (91A05)
Related Items
The computational complexity of iterated elimination of dominated strategies, On the order of eliminating dominated strategies, Computer science and decision theory, Effort Games and the Price of Myopia, Perspectives on multiagent learning
Cites Work