Every choice correspondence is backwards-induction rationalizable

John Rehbeck. Every choice correspondence is backwards-induction rationalizable. Games and Economic Behavior, 88:207-210, 2014. [doi]

Abstract

Abstract is missing.