Sciweavers

9 search results - page 2 / 2
» A mixed multi-unit combinatorial auctions test suite
Sort
View
ATAL
2007
Springer
13 years 11 months ago
Winner determination for mixed multi-unit combinatorial auctions via petri nets
Mixed Multi-Unit Combinatorial Auctions (MMUCAs) allow agents to bid for bundles of goods to buy, goods to sell, and transformations of goods. In particular, MMUCAs offer a high ...
Andrea Giovannucci, Juan A. Rodríguez-Aguil...
CAEPIA
2009
Springer
13 years 6 months ago
Empirical Hardness for Mixed Auctions
Mixed Multi-Unit Combinatorial Auctions (MMUCAs) offer a high potential to be employed for the automated assembly of supply chains of agents. However, little is known about the fac...
Pablo Almajano, Jesús Cerquides, Juan A. Ro...
SIGECOM
2000
ACM
127views ECommerce» more  SIGECOM 2000»
13 years 9 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
WECWIS
2002
IEEE
129views ECommerce» more  WECWIS 2002»
13 years 10 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, ...