Sciweavers

5 search results - page 1 / 1
» Effectiveness of Query Types and Policies for Preference Eli...
Sort
View
ATAL
2004
Springer
13 years 10 months ago
Effectiveness of Query Types and Policies for Preference Elicitation in Combinatorial Auctions
Combinatorial auctions, where agents can bid on bundles of items (resources, tasks, etc.), are desirable because the agents can express complementarity and substitutability among ...
Benoît Hudson, Tuomas Sandholm
CORR
2002
Springer
105views Education» more  CORR 2002»
13 years 4 months ago
Effectiveness of Preference Elicitation in Combinatorial Auctions
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. Howe...
Benoît Hudson, Tuomas Sandholm
ATAL
2003
Springer
13 years 10 months ago
Generalizing preference elicitation in combinatorial auctions
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. Howe...
Benoît Hudson, Tuomas Sandholm
SIGECOM
2003
ACM
107views ECommerce» more  SIGECOM 2003»
13 years 10 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 10 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