Discrete Extensive Forms

Carlos Alós-Ferrer and Klaus Ritzberger

Chapter 6 in The Theory of Extensive Form Games, 2016, pp 131-161 from Springer

Abstract: Abstract This chapter starts from the properties of the game tree that were identified in the previous chapter, but adds a down-discreteness condition. While still consistent with most of the literature, this step dramatically simplifies the framework: Three of the (four) defining conditions of an EDP collapse to a single one. Furthermore, in the resulting discrete trees all decision points are reached by a finite number of steps from the root, even though the game may have an infinite horizon. The freedom to take either plays or nodes as primitives is preserved, however, as shown by an elementary definition with nodes as primitives: Simple extensive forms are equivalent to discrete extensive forms.

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:
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:spschp:978-3-662-49944-3_6

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

DOI: 10.1007/978-3-662-49944-3_6

Access Statistics for this chapter

More chapters in Springer Series in Game Theory from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().