Chess-like games are dominance solvable in at most two steps
Accéder
Auteur(s)
Ewerhart, Christian
Accéder
Texte intégral indisponibleTexte intégral indisponibleDescrizione
We show that strictly competitive, finite games of perfect information that may end in one of three possible ways can be solved by applying only two rounds of elimination of dominated strategies.
Institution partenaire
Langue
English
Data
2000
Le portail de l'information économique suisse
© 2016 Infonet Economy
