This paper presents new clearing algorithms for multi-unit single-item and multi-unit combinatorial auctions with piecewise linear demand/supply functions. We analyse the complexi...
Distributed allocation and multiagent coordination problems can be solved through combinatorial auctions (CAs). However, most of the existing winner determination algorithms (WDAs...
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
Mixed multi-unit combinatorial auctions are combinatorial auctions in which the auctioneer and the bidders negotiate over transformations rather than over simple goods. By proposi...
Combinatorial auctions have been studied by the multiagent systems community for some time, since these auctions are an effective mechanism for resource allocation when agents are...