Learnability and rationality of choice

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.