Pages that link to "Item:Q5397569"

The following pages link to Every Choice Function Is Backwards-Induction Rationalizable (Q5397569):

Displaying 8 items.

• Identification of payoffs in repeated games (Q324145) (← links)
• Observable implications of Nash and subgame-perfect behavior in extensive games (Q393277) (← links)
• Note on unique Nash equilibrium in continuous games (Q1651236) (← links)
• Every random choice rule is backwards-induction rationalizable (Q2013370) (← links)
• Revealed preferences of individual players in sequential games (Q2237886) (← links)
• Sequential rationalization of multivalued choice (Q2344373) (← links)
• Every choice correspondence is backwards-induction rationalizable (Q2345216) (← links)
• Backwards-induction rationalizability of choice functions over an arbitrary set (Q6154274) (← links)