Pages that link to "Item:Q2373789"
From MaRDI portal
The following pages link to Rationalizability of choice functions by game trees (Q2373789):
Displayed 4 items.
- Observable implications of Nash and subgame-perfect behavior in extensive games (Q393277) (← links)
- The computational complexity of rationalizing boundedly rational choice behavior (Q2427841) (← links)
- The testable implications of zero-sum games (Q2427873) (← links)
- Weakened WARP and top-cycle choice rules (Q2468509) (← links)