Dominance Solvability
Dominance Solvability is a solution concept in game theory that refers to the property of a game where iterated elimination of strictly dominated strategies results in a unique strategy profile, thereby resolving the game through rationality alone.
23
Publications
1.1K
Citations
44
Authors
44
Institutions
Publications per year
2017–2026
1
Parents
23
Dominance Solvable Voting Schemes
Hervé Moulin · Econometrica · 1979 · 263 citations
Dominance solvability and cournot stability
Hervé Moulin · Mathematical Social Sciences · 1984 · 147 citations
Total Version of the Domination Game
Michael A. Henning, Sandi Klavžar, Douglas F. Rall · Graphs and Combinatorics · 2014 · 74 citations
1–5 of 23
44
2
h-index
2
h-index
2
h-index
1
h-index
1
h-index
1–5 of 44
44

Centre National de la Recherche Scientifique
Paris, France
2 h-index
2 publications
44 citations

University of Warwick
Coventry, United Kingdom
2 h-index
3 publications
153 citations

University of Ljubljana
Ljubljana, Slovenia
2 h-index
2 publications
125 citations

University of Johannesburg
Johannesburg, South Africa
2 h-index
2 publications
105 citations
Aix-Marseille Université
Marseille, France
1 h-index
1 publications
13 citations
Ben-Gurion University of the Negev
Beersheba, Israel
1 h-index
4 publications
80 citations
Centre d'Économie de la Sorbonne
Paris, France
1 h-index
1 publications
13 citations
Université Claude Bernard Lyon 1
Villeurbanne, France
1 h-index
1 publications
13 citations
1–8 of 44
4 publications · 133 citations
4
h-index
3 publications · 299 citations
3
h-index
2 publications · 45 citations
2
h-index
1 publications · 17 citations
1
h-index
1 publications · 51 citations
1
h-index
1–5