Abstract. Mixed Multi-Unit Combinatorial Auctions extend and generalise all the preceding types of combinatorial auctions. In this paper, we try to make headway on the practical ap...
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...
We present a novel algorithm for computing the optimal winning bids in a combinatorial auction (CA), that is, an auction in which bidders bid for bundles of goods. All previously ...
Kevin Leyton-Brown, Yoav Shoham, Moshe Tennenholtz
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...
Mixed Multi-Unit Combinatorial Auctions extend and generalize all the preceding types of combinatorial auctions. In this paper, we try to make headway on the practical application...