Abstract
In this paper we study the learnability of the class of rationalizable choice functions using the basic concept of PAC-learnability from statistical learning theory. We prove that the class of rationalizable choice functions on N alternatives is learnable from O(N) examples and is optimal in terms of PAC-learnability among classes which are invariant under permutations of the elements.
Original language | English |
---|---|
Pages (from-to) | 104-117 |
Number of pages | 14 |
Journal | Journal of Economic Theory |
Volume | 113 |
Issue number | 1 |
DOIs | |
State | Published - Nov 2003 |
Keywords
- Choice
- Choice functions
- Learnability
- Rationality
- Testable implications