A flexible model for tree-structured multi-commodity markets

  • Authors:

  • Per Carlsson;Arne Andersson

  • Affiliations:

  • EnerSearch and Uppsala University, Office: Computer Science Department, Lund University, Lund, Sweden SE-221 00;Uppsala University, Uppsala, Sweden SE-751 05

  • Venue:
  • Electronic Commerce Research
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this article we study tree-structured multi-commodity markets. The concept is a way to handle dependencies between commodities on the market in a tractable way. The winner determination problem of a general combinatorial market is well known to be NP-hard.It has been shown that on single-unit single-sided combinatorial auctions with tree-structured bundles the problem can be computed in polynomial time. We show that it is possible to extend this to multi-unit double-sided markets. Further it is possible to handle the commodities of a bundle not only as complements but as perfect substitutes too. Under certain conditions the computation time is still polynomial.