Prove that if a game is solvable by iterated strict dominance, it has a unique Nash equilibrium.
https://academicpapers.net/wp-content/uploads/2020/08/LOGO-300x75.png00Lizhttps://academicpapers.net/wp-content/uploads/2020/08/LOGO-300x75.pngLiz2021-07-30 23:23:082021-07-30 23:23:08Prove that if a game is solvable by iterated strict dominance, it has a unique Nash equilibrium.