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...
Bids submitted in auctions are usually treated as enforceable commitments in most bidding and auction theory literature. In reality bidders often withdraw winning bids before the ...
Proxy bidding has been proposed for combinatorial auctions as a means to speed up the auctions, to simplify the user interface, and to limit strategic behavior. The only previousl...
This paper presents a new combinatorial auction protocol (LDS protocol) that is robust against false-name bids. Internet auctions have become an integral part of Electronic Commer...
Iterative Combinatorial Auctions (ICA) have been getting increasing attention in computer science and economics, as they provide an efficient solution to resource allocation prob...
Alexander Pikovsky, Pasha Shabalin, Martin Bichler