Recent algorithms provide powerful solutions to the problem of determining cost-minimizing (or revenue-maximizing) allocations of items in combinatorial auctions. However, in many...
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, ...
Super solutions provide a framework for finding robust solutions to Constraint Satisfaction Problems [5, 3]. We present a novel application of super solutions to combinatorial auc...
We study auction-like algorithms for the distributed allocation of tasks to cooperating agents. To reduce the team cost of sequential single-item auction algorithms, we generalize...
Sven Koenig, Craig A. Tovey, Xiaoming Zheng, Ilgaz...
This paper presents a method for designing bundles in a combinatorial auction protocol that is robust against false-name bids. Internet auctions have become an integral part of El...