On the order of eliminating dominated strategies
type: Item
instance of: scholarly article
title: On the order of eliminating dominated strategies
zbMATH Open document ID: 0696.90091
DOI: 10.1016/0167-6377(90)90046-8
author: Itzhak Gilboa
author: Ehud Kalai
author: Eitan Zemel
published in: Operations Research Letters
publication date: 1990-01-01T00:00:00Z
full work available at URL: 789.pdf
Mathematics Subject Classification ID: 91A10
zbMATH DE Number: 4141840
zbMATH Keywords: dominated strategies
zbMATH Keywords: reduced game
MaRDI profile type: Publication
OpenAlex ID: W1969363584
cites work: Q5801631
cites work: On the Strategic Stability of Equilibria
cites work: A note on strategy elimination in bimatrix games
cites work: Q3252269
cites work: Dominance Solvable Voting Schemes
cites work: Q3335556
cites work: Q5332984
Recommended article: The Complexity of Eliminating Dominated Strategies
Recommended article: Elimination of dominated strategies and inessential players
Recommended article: The computational complexity of iterated elimination of dominated strategies
Recommended article: Iterated Elimination of Dominated Strategies in a Bertrand-Edgeworth Model
Recommended article: Strategy Elimination in Games with Interaction Structures
Recommended article: Dominant strategy implementability and zero length cycles
Recommended article: Iterative elimination of weakly dominated strategies in binary voting agendas with sequential voting
Recommended article: Dominated strategies in searching for evolutionary stable strategies
Recommended article: The order independence of iterated dominance in extensive games
Recommended article: Iterated strict dominance in general games
description: scientific article; zbMATH DE number 4141840