Sebastien M. Lahaie, David C. Parkes  Home/Search
Context Related
| harvard.edu/econcs/bib/....lahaie04.pdf Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: harvard.edu/econcs/bib/date (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We consider the parallels between the preference elicitation problem in combinatorial auctions and the problem of learning an unknown function from learning theory. We show that learning algorithms can be used as a basis for preference elicitation algorithms. The resulting elicitation algorithms perform a polynomial number of queries. We also give conditions under which the resulting algorithms have polynomial communication. Our conversion procedure allows us to generate combinatorial auction... (Update)
Cited by: More
The Communication Cost of Selshness: - Ex Post Implementation (Correct)
Exponential Communication Inefficiency of Demand Queries - Nisan, Segal (Correct)
Combinatorial Auctions with k-wise Dependent Valuations - Conitzer, Sandholm, Santi (2005) (Correct)
Active bibliography (related documents): More All
1.1: Applying Learning Algorithms to Preference Elicitation in.. - Lahaie, Parkes (2004) (Correct)
0.6: Making Markets and Democracy Work: A Story of Incentives and.. - Sandholm (2003) (Correct)
0.2: Effectiveness of Query Types and Policies for Preference.. - Hudson, Sandholm (2004) (Correct)
Similar documents based on text: More All
0.4: Ascending Price Vickrey Auctions Using Primal-Dual Algorithms - Mishra, Parkes (2004) (Correct)
0.3: Preference Elicitation in Proxied Multiattribute Auctions - Aditya Sunderam David (2002) (Correct)
0.3: Using Virtual Markets to Program Global Behavior in .. - Mainland, Kang.. (2004) (Correct)
Related documents from co-citation: More All
6: Preference elicitation in combinatorial auctions: Extended abstract - Conen, Sandholm - 2001
5: Ascending auction with package bidding - Ausubel, Milgrom - 2002
5: Preference elicitation and query learning - Blum, rey et al. - 2003
BibTeX entry: (Update)
S. Lahaie and D. Parkes. Applying learning algorithms to preference elicitation. ACM-EC, 2004. http://citeseer.ist.psu.edu/lahaie04applying.html More
@misc{ lahaie04applying,
author = "S. Lahaie and D. Parkes",
title = "Applying learning algorithms to preference elicitation",
text = "S. Lahaie and D. Parkes. Applying learning algorithms to preference elicitation.
ACM-EC, 2004.",
year = "2004",
url = "citeseer.ist.psu.edu/lahaie04applying.html" }
Citations (may not include all citations):537 A theory of the learnable (context) - Valiant - 1984
441 Queries and concept learning (context) - Angluin - 1987
317 Learning quickly when irrelevant attributes abound: A new li.. (context) - Littlestone - 1988
248 An Introduction to Computational Learning Theory (context) - Kearns, Vazirani - 1994
244 Learning regular sets from queries and counterexamples (context) - Angluin - 1987
147 Taming the computational complexity of combinatorial auction.. (context) - Fujishima, Leyton-Brown et al. - 1999
128 Bidding and allocation in combinatorial auctions - Nisan - 2000
76 CABOB: A fast optimal algorithm for combinatorial auctions - Sandholm, Suri et al. - 2001
69 Iterative combinatorial auctions: Theory and practice - Parkes, Ungar - 2000
63 Integer programming for combinatorial auction winner determi.. - Andersson, Tenhunen et al. - 2000
34 Partial-revelation VCG mechanism for combinatorial auctions - Conen, Sandholm - 2002
32 The Package Assignment Model (context) - Bikhchandani, Ostroy - 2002
20 Learning sparse multivariate polynomials over a field with q.. - Schapire, Sellie - 1993
11 Preference elicitation and query learning - Blum, Jackson et al. - 2003
11 On polynomial-time preference elicitation with value-queries - Zinkevich, Blum et al. - 2003
9 Price-based information certificates for minimal-revelation .. - Parkes - 2002
8 Auction design with costly preference elicitation - Parkes - 2003
6 cient allocations and supporting Lindahl prices (context) - Nisan, Segal et al. - 2003
3 Using value queries in combinatorial auctions - Hudson, Sandholm - 2003
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.eecs.harvard.edu/econcs/bib/date.html): More
An Iterative Generalized Vickrey Auction: Strategy-Proofness.. - Parkes (2001) (Correct)
An Options-Based Method to Solve the Composability Problem in.. - Juda, Parkes (Correct)
Distributed Implementations of Vickrey-Clarke-Groves Mechanisms - Parkes, Shneidman (2004) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC