Sciweavers

94 search results - page 5 / 19
» An Algorithm for Multi-Unit Combinatorial Auctions
Sort
View
AI
2002
Springer
13 years 6 months ago
Algorithm for optimal winner determination in combinatorial auctions
Combinatorial auctions, that is, auctions where bidders can bid on combinations of items, tend to lead to more efficient allocations than traditional auction mechanisms in multi-i...
Tuomas Sandholm
WECWIS
2002
IEEE
129views ECommerce» more  WECWIS 2002»
13 years 11 months ago
On the Sensitivity of Incremental Algorithms for Combinatorial Auctions
Despite the large amounts of runtime needed to adequately solve a combinatorial auction (CA), existing iterative CA auction protocols require winner determination during every rou...
Ryan Kastner, Christina Hsieh, Miodrag Potkonjak, ...
FC
2009
Springer
118views Cryptology» more  FC 2009»
14 years 1 months ago
Cryptographic Combinatorial Clock-Proxy Auctions
We present a cryptographic protocol for conducting efficient, provably correct and secrecy-preserving combinatorial clock-proxy auctions. The “clock phase” functions as a trust...
David C. Parkes, Michael O. Rabin, Christopher Tho...
SIGECOM
2000
ACM
127views ECommerce» more  SIGECOM 2000»
13 years 11 months ago
Towards a universal test suite for combinatorial auction algorithms
General combinatorial auctions—auctions in which bidders place unrestricted bids for bundles of goods—are the subject of increasing study. Much of this work has focused on alg...
Kevin Leyton-Brown, Mark Pearson, Yoav Shoham
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