Dominance Solvable Games

Resumen

  • This chapter first analyzes how to represent games in normal form (using matrices) and in extensive form (using game trees). We afterwards describe how to systematically detect strictly dominated strategies, i.e., strategies that a player would not use regardless of the action chosen by his opponents.

fecha de publicación

  • 2016

chapter number

  • Capítulo 1

Edición

  • Springer

Líneas de investigación

  • Describe Player
  • Dominance Solvable Games
  • Game Tree
  • Iterative Deletion
  • Matrix Player

Número Estándar Internacional de Libros (ISBN) 10

  • 978-3319329635

Página inicial

  • 1

Última página

  • 23

Volumen

  • 1st Edition