Martin A. Zinkevich, Avrim Blum, Tuomas Sandholm  Home/Search
Context Related
| cmu.edu/~sandholm/...tation.acmec03.pdf Cached: 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.
PS.gz PS Image Update HelpFrom: cmu.edu/~sandholm/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Preference elicitation --- the process of asking queries to determine parties' preferences --- is a key part of many problems in electronic commerce. For example, a shopping agent needs to know a user's preferences in order to correctly act on her behalf, and preference elicitation can help an auctioneer in a combinatorial auction determine how to best allocate a given set of items to a given set of bidders. Unfortunately, in the worst case, preference elicitation can require an exponential... (Update)
Similar documents based on text: More All
2.7: On Polynomial-Time Preference Elicitation with Value Queries - Zinkevich, Blum, Sandholm (2003) (Correct)
1.0: Preference Elicitation and Allocation with Read-Once.. - Zinkevich, Blum, Sandholm (2002) (Correct)
0.5: Constructing and Clearing Combinatorial Exchanges Using.. - Smith, Sandholm, Simmons (2002) (Correct)
BibTeX entry: (Update)
Martin Zinkevich, Avrim Blum, and Tuomas Sandholm. On polynomial-time preference elicitation with value queries. In Proceedings of the ACM Conference on Electronic Commerce (ACM-EC), pages 176--185, San Diego, CA, 2003. http://citeseer.ist.psu.edu/zinkevich03polynomialtime.html More
@misc{ zinkevich03polynomialtime,
author = "M. Zinkevich and A. Blum and T. Sandholm",
title = "On polynomial-time preference elicitation with value queries",
text = "Martin Zinkevich, Avrim Blum, and Tuomas Sandholm. On polynomial-time preference
elicitation with value queries. In Proceedings of the ACM Conference on
Electronic Commerce (ACM-EC), pages 176--185, San Diego, CA, 2003.",
year = "2003",
url = "citeseer.ist.psu.edu/zinkevich03polynomialtime.html" }
Citations (may not include all citations):441 Queries and concept learning (context) - Angluin - 1988
97 Learning read-once formulas with queries - Angluin, Hellerstein et al. - 1993
69 Iterative combinatorial auctions: Theory and practice - Parkes, Ungar - 2000
40 Preference elicitation in combinatorial auctions: Extended a.. - Conen, Sandholm - 2001
34 Partial-revelation VCG mechanism for combinatorial auctions - Conen, Sandholm - 2002
32 anonymous-price combinatorial auction (context) - Wurman, Wellman et al. - 2000
26 Learning arithmetic read-once formulas (context) - Bshouty, Hancock et al. - 1995
23 Linear programming and Vickrey auctions - Bikhchandani, de Vries et al. - 2001
13 An algorithm to learn read-once threshold formulas - Bshouty, Hancock et al. - 1994
5 ectiveness of preference elicitation in combinatorial auctio.. (context) - Hudson, Sandholm - 2002
3 erential-revelation VCG mechanisms for combinatorial auction.. (context) - Conen, Sandholm - 2002
3 cient allocation problems (context) - Nisan, Segal et al. - 2002
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www-2.cs.cmu.edu/~sandholm/): More
Miscomputing Ratio: The Social Cost of Selfish Computing - Larson, Sandholm (2003) (Correct)
Complexity of Determining Nonemptiness of the Core - Conitzer, Sandholm (2002) (Correct)
Definition and Complexity of Some Basic Metareasoning Problems - Conitzer, Sandholm (2002) (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