TY - JOUR
T1 - Learning Economic Parameters from Revealed Preferences
AU - Balcan, Maria Florina
AU - Urner, Ruth
AU - Daniely, Amit
AU - Mehta, Ruta
AU - Vazirani, Vijay V.
N1 - Publisher Copyright:
© Springer International Publishing Switzerland 2014.
PY - 2014
Y1 - 2014
N2 - A recent line of work, starting with Beigman and Vohra [4] and Zadimoghaddam and Roth [30], has addressed the problem of learning a utility function from revealed preference data. The goal here is to make use of past data describing the purchases of a utility maximizing agent when faced with certain prices and budget constraints in order to produce a hypothesis function that can accurately forecast the future behavior of the agent. In this work we advance this line of work by providing sample complexity guarantees and efficient algorithms for a number of important classes. By drawing a connection to recent advances in multi-class learning, we provide a computationally efficient algorithm with tight sample complexity guarantees (˜(d/ε) for the case of d goods) for learning linear utility functions under a linear price model. This solves an open question in Zadimoghaddam and Roth [30]. Our technique yields numerous generalizations including the ability to learn other well-studied classes of utility functions, to deal with a misspecified model, and with non-linear prices.
AB - A recent line of work, starting with Beigman and Vohra [4] and Zadimoghaddam and Roth [30], has addressed the problem of learning a utility function from revealed preference data. The goal here is to make use of past data describing the purchases of a utility maximizing agent when faced with certain prices and budget constraints in order to produce a hypothesis function that can accurately forecast the future behavior of the agent. In this work we advance this line of work by providing sample complexity guarantees and efficient algorithms for a number of important classes. By drawing a connection to recent advances in multi-class learning, we provide a computationally efficient algorithm with tight sample complexity guarantees (˜(d/ε) for the case of d goods) for learning linear utility functions under a linear price model. This solves an open question in Zadimoghaddam and Roth [30]. Our technique yields numerous generalizations including the ability to learn other well-studied classes of utility functions, to deal with a misspecified model, and with non-linear prices.
KW - Efficient algorithms
KW - Linear
KW - Query learning
KW - Revealed preference
KW - SPLC and Leontief utility functions
KW - Statistical learning
UR - http://www.scopus.com/inward/record.url?scp=84914145876&partnerID=8YFLogxK
U2 - 10.1007/978-3-319-13129-0_28
DO - 10.1007/978-3-319-13129-0_28
M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???
AN - SCOPUS:84914145876
SN - 0302-9743
VL - 8877
SP - 338
EP - 353
JO - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
JF - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
ER -