Combinatorial auctions for supply chain formation
Proceedings of the 2nd ACM conference on Electronic commerce
Decentralised coordination of low-power embedded devices using the max-sum algorithm
Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems - Volume 2
Decentralized supply chain formation: a market protocol and competitive equilibrium analysis
Journal of Artificial Intelligence Research
Bidding languages and winner determination for mixed multi-unit combinatorial auctions
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Charting the tractability frontier of mixed multi-unit combinatorial auctions
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Decentralised Supply Chain Formation: A Belief Propagation-based Approach
Proceedings of the 2010 conference on ECAI 2010: 19th European Conference on Artificial Intelligence
| Hi-index | 0.00 |
Supply Chain Formation (SCF) is the process of determining the participants in a supply chain, who will exchange what with whom, and the terms of the exchanges. Decentralized SCF appears as a highly intricate task because agents only possess local information, have limited knowledge about the capabilities of other agents, and prefer to preserve privacy. Very recently, the decentralized SCF problem has been cast as an optimization problem that can be efficiently approximated using max-sum loopy belief propagation. Unfortunately, the memory and communication requirements of this approach largely hinder its scalability. This paper presents a novel encoding of the problem into a binary factor graph (containing only binary variables) along with an alternative algorithm. These allow to scale up to form supply chains in markets with higher degrees of competition.