A Flexible Model for Tree-Sructured Multi-Commodity Markets
2005 (English)In: CEC 2005: Seventh IEEE International Conference on E-Commerce Technology, 2005, 50-58 p.Conference paper (Refereed)
In this paper we study tree-structured multi-commodity, multi-unit 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.
Place, publisher, year, edition, pages
2005. 50-58 p.
multi commodity markets, electronic markets, computational markets, equilibrium markets, resource allocation, power markets, bandwidth markets, computational complexity
IdentifiersURN: urn:nbn:se:uu:diva-79117ISBN: 0-7695-2277-7OAI: oai:DiVA.org:uu-79117DiVA: diva2:107030