A Flexible Model for Tree-Structured Multi-commodity Markets

Munich, Germany July 19-July 22

DOI Bookmark:

http://doi.ieeecomputersociety.org/10.1109/ICECT.2005.2

Seventh IEEE International Conference ...

	This Article
	PURCHASE ARTICLE: $19 PDF HTML IEEE Xplore Subscribers
	Share
	Email this Article to a friend
	Bibliographic References
	ASCII Text BibTex RefWorks Procite/RefMan/Endnote
	Add to:
	Digg Furl Spurl Blink Simpy Google Del.icio.us Y!MyWeb
	Search
	Similar Articles Articles by Per Carlsson Articles by Arne Andersson

	ASCII Text	x
	Per Carlsson, Arne Andersson, "A Flexible Model for Tree-Structured Multi-commodity Markets," E-Commerce Technology, IEEE International Conference on, pp. 50-57, Seventh IEEE International Conference on E-Commerce Technology (CEC'05), 2005.

	BibTex	x
	@article{ 10.1109/ICECT.2005.2, author = {Per Carlsson and Arne Andersson}, title = {A Flexible Model for Tree-Structured Multi-commodity Markets}, journal ={E-Commerce Technology, IEEE International Conference on}, volume = {0}, year = {2005}, issn = {1530-1354}, pages = {50-57}, doi = {http://doi.ieeecomputersociety.org/10.1109/ICECT.2005.2}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }

	RefWorks Procite/RefMan/Endnote	x
	TY - CONF JO - E-Commerce Technology, IEEE International Conference on TI - A Flexible Model for Tree-Structured Multi-commodity Markets SN - 1530-1354 SP50 EP57 A1 - Per Carlsson, A1 - Arne Andersson, PY - 2005 KW - multi commodity markets KW - electronic markets KW - computational markets KW - equilibrium markets KW - resource allocation KW - power markets KW - bandwidth markets KW - computational complexity VL - 0 JA - E-Commerce Technology, IEEE International Conference on ER -

Per Carlsson, EnerSearch and Uppsala University

Arne Andersson, Uppsala University

In this paper we study tree-structured multi-commodity, multi-unit markets. The concept is a wav to handle dependencies between commodities on the market an 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 combanatorial 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 as 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.

Index Terms:

multi commodity markets, electronic markets, computational markets, equilibrium markets, resource allocation, power markets, bandwidth markets, computational complexity

Citation:

Per Carlsson, Arne Andersson, "A Flexible Model for Tree-Structured Multi-commodity Markets," cec, pp.50-57, Seventh IEEE International Conference on E-Commerce Technology (CEC'05), 2005

Peer Review Notice | Give Us Feedback

Usage of this product signifies your acceptance of the Terms of Use.