Characterization of Consistent Assessments in Extensive Form Games

In this paper an algebraic characterization of consistent assessments in extensive form games (in the sense of3, is given. As a corollary, we show that consistency can be characterized by so-called “simple” sequences of assessments. The algebraic characterization is used to develop an algorithm whic...

Full description

Saved in:
Bibliographic Details
Published in:Games and economic behavior 1997-10, Vol.21 (1-2), p.238-252
Main Authors: Perea y Monsuwé, Andres, Jansen, Mathijs, Peters, Hans
Format: Article
Language:English
Subjects:
Game theory
Games
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:In this paper an algebraic characterization of consistent assessments in extensive form games (in the sense of3, is given. As a corollary, we show that consistency can be characterized by so-called “simple” sequences of assessments. The algebraic characterization is used to develop an algorithm which computes the set of consistent assessments. Moreover, the geometrical structure of the set of consistent assessments is described: It turns out to be the intersection of a finite product of simplices with a finite number of logarithmic cones.Journal of Economic LiteratureClassification Number: 210.
ISSN:0899-8256
1090-2473
DOI:10.1006/game.1997.0584