Sciweavers

227 search results - page 12 / 46
» Combinatorial Auctions with Budgets
Sort
View
WECWIS
2002
IEEE
129views ECommerce» more  WECWIS 2002»
15 years 3 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, ...
AI
2002
Springer
14 years 10 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
ATAL
2009
Springer
15 years 4 months ago
A mixed multi-unit combinatorial auctions test suite
Supply Chain Formation (SCF) is the process of determining the participants in a supply chain, who will exchange what with whom, and the terms of the exchanges. Mixed multi-unit c...
Andrea Giovannucci, Jesús Cerquides, Ulle E...
SIGECOM
2008
ACM
152views ECommerce» more  SIGECOM 2008»
14 years 10 months ago
On characterizations of truthful mechanisms for combinatorial auctions and scheduling
We characterize truthful mechanisms in two multi-parameter domains. The first characterization shows that every mechanism for combinatorial auctions with two subadditive bidders t...
Shahar Dobzinski, Mukund Sundararajan
WECWIS
2007
IEEE
130views ECommerce» more  WECWIS 2007»
15 years 4 months ago
Improved Rules for the Resource Allocation Design
Iterative Combinatorial Auctions (ICA) have been getting increasing attention both from researchers and in practice as they can increase efficiency of complex markets with substi...
Pasha Shabalin, Bernd Laqua, Alexander Pikovsky