Pseudotrees and Order Theory

Carlos Alós-Ferrer and Klaus Ritzberger

Chapter 3 in The Theory of Extensive Form Games, 2016, pp 57-66 from Springer

Abstract: Abstract This chapter is a brief digression into related concepts from order theory. In particular, the order-theoretic concept of a pseudotree is related to consistent and directed subsets, to complete partially ordered sets (CPOs), and to meet-semilattices. The insight for the general theme of the book concerns set representations again: If one does not insist on decision trees, there is still a canonical set representation, though not by plays, but by plays together with extensible chains.

Keywords: Pseudot; Order Theory; Chain Extensibility; Koppelberg; Complete Meet-semilattice (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:
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_3

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

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

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 ().