Pages that link to "Item:Q2373789"
From MaRDI portal
The following pages link to Rationalizability of choice functions by game trees (Q2373789):
Displaying 16 items.
- Observable implications of Nash and subgame-perfect behavior in extensive games (Q393277) (← links)
- Non-existence of continuous choice functions (Q406408) (← links)
- The computational complexity of rationalizing Pareto optimal choice behavior (Q483106) (← links)
- A foundation for strategic agenda voting (Q485757) (← links)
- Pareto-optimal matching allocation mechanisms for boundedly rational agents (Q682470) (← links)
- Every random choice rule is backwards-induction rationalizable (Q2013370) (← links)
- Cluster-shortlisted choice (Q2092770) (← links)
- Every choice correspondence is backwards-induction rationalizable (Q2345216) (← 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)
- Bounded rationality is rare (Q2675409) (← links)
- Sophisticated Strategic Choice (Q5874580) (← links)
- Backwards-induction rationalizability of choice functions over an arbitrary set (Q6154274) (← links)
- Choice structures in games (Q6160139) (← links)
- A simple model of two-stage choice (Q6559457) (← links)