A flexible model for tree-structured multi-commodity markets

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.

[1]  Ronald M. Harstad,et al.  Computationally Manageable Combinational Auctions , 1998 .

[2]  S. Borenstein,et al.  Dynamic Pricing, Advanced Metering, and Demand Response in Electricity Markets , 2002 .

[3]  Arne Andersson,et al.  A tractable mechanism for time dependent markets , 2003, EEE International Conference on E-Commerce, 2003. CEC 2003..

[4]  Noam Nisan,et al.  Bidding and allocation in combinatorial auctions , 2000, EC '00.

[5]  Toshihide Ibaraki,et al.  Resource allocation problems - algorithmic approaches , 1988, MIT Press series in the foundations of computing.

[6]  Moshe Tennenholtz.  Some Tractable Combinatorial Auctions , 2000, AAAI/IAAI.

[7]  Arne Andersson,et al.  Extending Equilibrium Markets , 2001, IEEE Intell. Syst..

[8]  Fredrik Ygge,et al.  Resource Allocation with Wobbly Functions , 2002, Comput. Optim. Appl..

[9]  Naoki Katoh,et al.  Resource Allocation Problems , 1998 .

[10]  Arne Andersson,et al.  Managing large scale computational markets , 1998, Proceedings of the Thirty-First Hawaii International Conference on System Sciences.

[11]  L. Rasmusson,et al.  Network components for market-based network admission and routing , 2002 .

[12]  Lars Rasmusson,et al.  Evaluating Resource Bundle Derivatives for Multi-agent Negotiation of Resource Allocation , 2001, E-Commerce Agents.

[13]  Arne Andersson,et al.  Efficient Resource Allocation with Non-Concave Objective Functions , 2001, Comput. Optim. Appl..