74 research outputs found
Characterizations of perfect recall
This paper considers the condition of perfect recall for the class of arbitrarily large discrete extensive form games. The known definitions of perfect recall are shown to be equivalent even beyond finite games. Further, a qualitatively new characterization in terms of choices is obtained. In particular, an extensive form game satisfies perfect recall if and only if the set of choices, viewed as sets of ultimate outcomes, fulfill the Trivial Intersection property, that is, any two choices with nonempty intersection are ordered by set inclusion
Reduced Normal Forms Are Not Extensive Forms
Fundamental results in the theory of extensive form games have singled out the reduced normal form as the key representation of a game in terms of strategic equivalence. In a precise sense, the reduced normal form contains all strategically relevant information. This note shows that a difficulty with the concept has been overlooked so far: given a reduced normal form alone, it may be impossible to reconstruct the game’s extensive form representation
Ex-Post Regret Learning in Games with Fixed and Random Matching: The Case of Private Values
VHB-JOURQUAL2: Method, Results, and Implications of the German Academic Association for Business Research’s Journal Ranking
Iterated elimination procedures
We study the existence and uniqueness (i.e.,order independence) of any arbitrary form of iterated elimination procedures in an abstract environment. By allowing for a transfinite elimination, we show a general existence of the iterated elimination procedure. Inspired by the seminal work of Gilboa, Kalai and Zemel (1990), we identify a fairly weak suffcient condition of Monotonicity* for the order independence of iterated elimination procedure. Monotonicity* requires a monotonicity property along any elimination path. Our approach is applicable to different forms of iterated elimination procedures used in (in)finite games, for example, iterated elimination of strictly dominated strategies, iterated elimination of weakly dominated strategies, rationalizability, and soon. We introduce a notion of CD* games, which incorporates Jackson's (1992) idea of "boundedness", and show the iterated elimination procedure is order independent in the class of CD* games. In finite games, we also formulate and show an "outcome" order-independence result suitable for Marx and Swinkels's (1997) notion of nice weak dominance
- …