Benoît Hudson, Tuomas Sandholm  Home/Search
Context Related
| cmu.edu/~sandholm/...citaton.amec02.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: cmu.edu/~sandholm/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Combinatorial auctions where agents can bid on bundles of items are desirable because they allow the agents to express complementarity and substitutability between the items. However, expressing one's preferences can require bidding on all bundles. Selective incremental preference elicitation by the auctioneer was recently proposed to address this problem [4], but the idea was not evaluated. In this paper we show, experimentally and theoretically, that automated elicitation provides a... (Update)
Context of citations to this paper: More
...for free, that is, their valuation functions are monotone. However, experimentally, preference elicitation appears to help quite a bit [9]. Nonetheless, the amount of querying can be prohibitively large when the bidders have general (monotone) preferences. An analogous issue...
Cited by: More
Using Value Queries in Combinatorial Auctions - Beno Hudson Tuomas (2003) (Correct)
Computational Criticisms of the Revelation Principle - Conitzer, Sandholm (2003) (Correct)
Making Markets and Democracy Work: A Story of Incentives and.. - Sandholm (2003) (Correct)
Similar documents (at the sentence level):
31.7%: Generalizing Preference Elicitation in Combinatorial Auctions - Sandholm (2003) (Correct)
18.0%: Effectiveness of Query Types and Policies for Preference.. - Hudson, Sandholm (2004) (Correct)
Active bibliography (related documents): More All
0.6: Differential-Revelation VCG Mechanisms for Combinatorial.. - Conen, Sandholm (2002) (Correct)
0.3: Preference Elicitation and Query Learning - Blum, Jackson, Sandholm, Zinkevich (2003) (Correct)
0.3: Preference Estimation and Query Learning - Blum, Jackson, al. (2004) (Correct)
Similar documents based on text: More All
2.7: Effectiveness of Preference Elicitation in Combinatorial.. - Hudson, Sandholm (2002) (Correct)
0.8: Preference Elicitation and Allocation with Read-Once.. - Zinkevich, Blum, Sandholm (2002) (Correct)
0.7: Minimal Preference Elicitation in Combinatorial Auctions - Conen, Sandholm (2001) (Correct)
Related documents from co-citation: More All
11: Preference elicitation in combinatorial auctions: Extended abstract - Conen, Sandholm - 2001
9: The communication complexity of efficient allocation problems - Nisan, Segal - 2002
8: Partial-revelation VCG mechanism for combinatorial auctions - Conen, Sandholm - 2002
BibTeX entry: (Update)
Benoit Hudson and Tuomas Sandholm. Effectiveness of preference elicitation in combinatorial auctions. In AAMAS-02 workshop on Agent-Mediated Electronic Commerce (AMEC), Bologna, Italy, 2002. Extended version: Carnegie Mellon University, Computer Science Department, CMU-CS-02-124, March. Also: Stanford Institute for Theoretical Economics workshop (SITE02) . 10 http://citeseer.ist.psu.edu/article/hudson02effectiveness.html More
@misc{ hudson02effectiveness,
author = "B. Hudson and T. Sandholm",
title = "Effectiveness of preference elicitation in combinatorial auctions",
text = "Benoit Hudson and Tuomas Sandholm. Effectiveness of preference elicitation
in combinatorial auctions. In AAMAS-02 workshop on Agent-Mediated Electronic
Commerce (AMEC), Bologna, Italy, 2002. Extended version: Carnegie Mellon
University, Computer Science Department, CMU-CS-02-124, March. Also: Stanford
Institute for Theoretical Economics workshop (SITE02) . 10",
year = "2002",
url = "citeseer.ist.psu.edu/article/hudson02effectiveness.html" }
Citations (may not include all citations):215 Multipart pricing of public goods (context) - Clarke - 1971
184 Computationally manageable combinatorial auctions - Rothkopf, Peke et al. - 1998
184 Algorithm for optimal winner determination in combinatorial .. - Sandholm - 2002
177 An implementation of the contract net protocol based on marg.. - Sandholm - 1993
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
51 eMediator: A next generation electronic commerce server - Sandholm - 2000
37 Optimal auction design for agents with hard valuation proble.. - Parkes - 1999
34 Partial-revelation VCG mechanism for combinatorial auctions - Conen, Sandholm - 2002
32 anonymous-price combinatorial auction (context) - Wurman, Wellman et al. - 2000
29 Bidding languages for combinatorial auctions - Hoos, Boutilier - 2001
29 Towards a universal test suite for combinatorial auction alg.. (context) - Leyton-Brown, Pearson et al. - 2000
27 Why are Vickrey auctions rare (context) - Rothkopf, Teisberg et al. - 1990
23 Linear programming and Vickrey auctions - Bikhchandani, de Vries et al. - 2001
17 The communication complexity of efficient allocation problem.. - Nisan, Segal - 2002
10 Constructing and clearing combinatorial exchanges using pref.. - Smith, Sandholm et al. - 2002
4 Deliberation in equilibrium: Bargaining in computationally c.. - Larson, Sandholm - 2000
3 Coherent pricing of efficient allocations in combinatorial e.. - Conen, Sandholm - 2002
1 A more detailed description of the algorithmic aspects appea.. (context) - Conen, Sandholm et al. - 2001
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