"Every choice correspondence is backwards-induction rationalizable."

John Rehbeck (2014)

> Home

Details and statistics

DOI: 10.1016/J.GEB.2014.10.005

access: closed

type: Journal Article

metadata version: 2020-02-22

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/geb/Rehbeck14
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/geb/Rehbeck14
John Rehbeck:
Every choice correspondence is backwards-induction rationalizable. Games Econ. Behav. 88: 207-210 (2014)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.