Sciweavers

20 search results - page 2 / 4
» Generalizing preference elicitation in combinatorial auction...
Sort
View
SIGECOM
2003
ACM
143views ECommerce» more  SIGECOM 2003»
13 years 11 months ago
Differential-revelation VCG mechanisms for combinatorial auctions
Combinatorial auctions, where bidders can submit bids on bundles of items, are economically efficient mechanisms for selling items to bidders, and are attractive when the bidders...
Wolfram Conen, Tuomas Sandholm
SIGECOM
2003
ACM
119views ECommerce» more  SIGECOM 2003»
13 years 11 months ago
Preference elicitation in proxied multiattribute auctions
We consider the problem of minimizing preference elicitation in efficient multiattribute auctions, that support dynamic negotiation over non-price based attributes such as qualit...
Aditya V. Sunderam, David C. Parkes
SIGECOM
2003
ACM
107views ECommerce» more  SIGECOM 2003»
13 years 11 months ago
Using value queries in combinatorial auctions
Combinatorial auctions, where bidders can bid on bundles of items are known to be desirable auction mechanisms for selling items that are complementary and/or substitutable. Howev...
Benoît Hudson, Tuomas Sandholm
SIGECOM
2003
ACM
122views ECommerce» more  SIGECOM 2003»
13 years 11 months ago
On polynomial-time preference elicitation with value queries
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 age...
Martin Zinkevich, Avrim Blum, Tuomas Sandholm
JAIR
2010
139views more  JAIR 2010»
13 years 4 months ago
Multiattribute Auctions Based on Generalized Additive Independence
We develop multiattribute auctions that accommodate generalized additive independent (GAI) preferences. We propose an iterative auction mechanism that maintains prices on potentia...
Yagil Engel, Michael P. Wellman