101. Transformations of Games
- Author
-
Andrés Perea
- Subjects
Computer Science::Computer Science and Game Theory ,symbols.namesake ,Conjecture ,Nash equilibrium ,Computer science ,ComputingMilieux_PERSONALCOMPUTING ,symbols ,Rationality ,Equilibrium solution ,Invariant (physics) ,Mathematical economics ,Extensive-form game - Abstract
In this chapter we investigate how rationality criteria for extensive form games react to certain transformations of games, that is, functions which map an extensive form game to some new game. In particular, it is analyzed whether the set of conjecture profiles selected by the criterion in the new game “coincides” with the set of conjecture profiles selected in the original game. If this is the case, we say that the criterion is invariant to the transformation under consideration. Invariance is a desirable property for a rationality criterion if one believes that the transformation does not affect the “strategic features” of the game.
- Published
- 2001
- Full Text
- View/download PDF