Dominance elimination procedures on finite alternative games

DOI10.1007/BF01774300zbMath0516.90086MaRDI QIDQ1052938

Rodney Gretlein

Publication date: 1983

Published in: International Journal of Game Theory (Search for Journal in Brave)

zbMATH Keywords

sophisticated votingrepeated elimination of dominated strategiessophisticated outcomes

Mathematics Subject Classification ID

Noncooperative games (91A10) Multistage and repeated games (91A20) Social choice (91B14)

Related Items (10)

Order independence for iterated weak dominance ⋮ Rationalizability and logical inference ⋮ On rationalizability in extensive games ⋮ Scoring rule voting games and dominance solvability ⋮ On the outcome equivalence of backward induction and extensive form rationalizability ⋮ Dominance solvability of dynamic bargaining games ⋮ To fight or not to fight? That is the question ⋮ Iterated weak dominance and subgame dominance ⋮ Dominance solvability and Cournot stability ⋮ Iterated weak dominance in strictly competitive games of perfect information.

Cites Work

• A multistage game representation of sophisticated voting for binary procedures
• Dominance Solvable Voting Schemes
• Dominance Solvable Voting Schemes: A Comment
• Unnamed Item

This page was built for publication: Dominance elimination procedures on finite alternative games