Trees and Decisions
The traditional model of sequential decision making, for instance, in extensive form games, is a tree. Most texts de?ne a tree as a connected directed graph without loops and a distinguished node, called the root. But an abstract graph is not a domain for decision theory. Decision theory perceives of acts as functions from states to consequences. Sequential decisions, accordingly, get conceptualized by mappings from sets of states to sets of consequences. Thus, the question arises whether a natural de?nition of a tree can be given, where nodes are sets of states. We show that, indeed, trees can be de?ned as speci?c collections of sets. Without loss of generality the elements of these sets can be interpreted as representing plays. Therefore, the elements can serve as states and consequences at the same time.
|Date of creation:||Mar 2003|
|Date of revision:|
|Contact details of provider:|| Postal: Josefstädterstr. 39, A-1080 Vienna, Austria|
Phone: ++43 - (0)1 - 599 91 - 0
Fax: ++43 - (0)1 - 599 91 - 555
Web page: http://www.ihs.ac.at
More information through EDIRC
|Order Information:|| Postal: Institute for Advanced Studies - Library, Josefstädterstr. 39, A-1080 Vienna, Austria|
When requesting a correction, please mention this item's handle: RePEc:ihs:ihsesp:129. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Doris Szoncsitz)
If references are entirely missing, you can add them using this form.