Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely:   study tree-structured multicommodity, multi-unit markets. The concept is a way to handle dependencies beten commodities on the market in a tractable way. The winner determination problem of a general combinatorial market is ll 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.  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.
['Per Carlsson', 'Arne Andersson']
I am writing a research paper on a idea A flexible model for tree-structured multi-commodity markets
[{"from": "human", "value": "I am writing a research paper on a idea A flexible model for tree-structured multi-commodity markets"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely:   study tree-structured multicommodity, multi-unit markets. The concept is a way to handle dependencies beten commodities on the market in a tractable way. The winner determination problem of a general combinatorial market is ll 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.  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."}]