Sciweavers

25 search results - page 4 / 5
» Prior-free auctions with ordered bidders
Sort
View
ATAL
2009
Springer
14 years 16 days ago
Pick-a-bundle: a novel bundling strategy for selling multiple items within online auctions
In this paper, we consider the design of an agent that is able to autonomously make optimal bundling decisions when selling multiple heterogeneous items within existing online auc...
Ioannis A. Vetsikas, Alex Rogers, Nicholas R. Jenn...
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
2009
ACM
111views ECommerce» more  SIGECOM 2009»
14 years 14 days ago
A qualitative vickrey auction
Restricting the preferences of the agents by assuming that their utility functions linearly depend on a payment allows for the positive results of the Vickrey auction and the Vick...
Paul Harrenstein, Mathijs de Weerdt, Vincent Conit...
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
IJCAI
2001
13 years 7 months ago
CABOB: A Fast Optimal Algorithm for Combinatorial Auctions
Combinatorial auctions where bidders can bid on bundles of items can lead to more economical allocations, but determining the winners is NP-complete and inapproximable. We present...
Tuomas Sandholm, Subhash Suri, Andrew Gilpin, Davi...