Dominance Solvable Games

Felix Munoz-Garcia and Daniel Toro-Gonzalez
Additional contact information
Daniel Toro-Gonzalez: Universidad Tecnológica de Bolívar
Authors registered in the RePEc Author Service: Daniel Toro González ()

Chapter Chapter 1 in Strategy and Game Theory, 2016, pp 1-23 from Springer

Abstract: Abstract 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.

Keywords: Dominance Solvable Games; Game Tree; Iterative Deletion; Describe Player; Matrix Player (search for similar items in EconPapers)
Date: 2016
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
Chapter: Dominance Solvable Games (2019)
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sptchp:978-3-319-32963-5_1

Ordering information: This item can be ordered from
http://www.springer.com/9783319329635

DOI: 10.1007/978-3-319-32963-5_1

Access Statistics for this chapter

More chapters in Springer Texts in Business and Economics from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().