Learnability and rationality of choice

被引:15
|
作者
Kalai, G [1 ]
机构
[1] Hebrew Univ Jerusalem, Inst Math, IL-91904 Jerusalem, Israel
[2] Hebrew Univ Jerusalem, Ctr Rational, IL-91904 Jerusalem, Israel
关键词
choice; rationality; learnability; choice functions; testable implications;
D O I
10.1016/S0022-0531(03)00083-8
中图分类号
F [经济];
学科分类号
02 ;
摘要
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. (C) 2003 Elsevier Science (USA). All rights reserved.
引用
收藏
页码:104 / 117
页数:14
相关论文
共 50 条