Name
Abstract | ||
|---|---|---|
In combinatorial auctions not only single items but also bundles of items are sold simultaneously. A substantial ingredient to an auction mechanism is the way prices of bundles are determined. Prices determine the auctioneer's revenue and, ideally, justify the outcome of the auction to the bidder. Each bidder should be able to see why he won or lost a certain bundle comparing the determined price for a bundle and his bid's value. It is well known that linear prices cannot guarantee such a justification. We propose a new pricing scheme adding prices for bundle sizes to the traditional linear prices for items. We analyze this scheme and evaluate its ability to provide prices supporting a given allocation by means of a computational study using a well established combinatorial auctions test suite. We also compare our scheme to a scheme from literature with respect to the ability to generate market clearing prices. HighlightsA new pricing scheme for combinatorial auctions.Anonymous item prices and bundle size prices.Discussion about capability for market clearing.Computational study evaluating capability for market clearing. |
Year | DOI | Venue |
|---|---|---|
2016 | 10.1016/j.cor.2015.12.008 | Computers & Operations Research |
Keywords | Field | DocType |
Combinatorial auctions,Pricing scheme,Bundle prices | Revenue,Test suite,Mathematical optimization,Market clearing,Combinatorial auction,Bundle,Mathematics | Journal |
Volume | Issue | ISSN |
70 | C | 0305-0548 |
Citations | PageRank | References |
2 | 0.38 | 13 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Dirk Briskorn | 1 | 508 | 35.26 |
| Kurt Jørnsten | 2 | 232 | 24.52 |
| Philipp Zeise | 3 | 2 | 0.38 |