𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Super weak isomorphism of extensive games

✍ Scribed by André Casajus

Publisher
Elsevier Science
Year
2006
Tongue
English
Weight
178 KB
Volume
51
Category
Article
ISSN
0165-4896

No coin nor oath required. For personal study only.

✦ Synopsis

It is well known that the normal form suffices to determine some but not to determine all sequential equilibria of a game in general. How much more structure does so? In this addendum to Casajus [Casajus, A., 2003. Weak isomorphism of extensive games. Mathematical Social Sciences 46 (3) 267-290.], we suggest the concept of super weak isomorphism (SWI) as an attempt to answer this question. In contrast to weak isomorphism, SWI is not sensitive to the structure of the chance mechanism and the assignment of payoffs to the individual terminal nodes. Yet, sequential equilibrium remains invariant under SWI, i.e. the structural features preserved by SWI already determine sequential equilibrium. In addition, SWI is generically equivalent to isomorphism of the agent normal form for a larger set of games than weak isomorphism.

📜 SIMILAR VOLUMES

Enumeration of weak isomorphism classes
Enumeration of weak isomorphism classes of signed graphs
✍ Tadeusz Sozański 📂 Article 📅 1980 🏛 John Wiley and Sons 🌐 English ⚖ 869 KB

## Abstract A signed graph is a graph in which each line has a plus or minus sign. Two signed graphs are said to be weakly isomorphic if their underlying graphs are isomorphic through a mapping under which signs of cycles are preserved, the sign of a cycle being the product of the signs of its line