Tecnologia de subastas para la formacion automatizada de cadenas de suministro
RB-LBP: Scaling Up Decentralized supply chain formation
Publication Type:
Conference PaperSource:
5th International Workshop on Optimization in Multi-Agent Systems @AAMAS (OPTMAS), Valencia (2012)Abstract:
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 and have limited knowledge about the capabilities of other agents. The decentralized SCF problem has been recently cast as an optimization problem that can be efficiently approximated using max-sum loopy belief propagation. Along this direction, in this paper we propose a novel encoding of the problem into a binary factor graph (containing only binary variables) as well as an alternative algorithm. We empirically show that our approach allows to significantly increase scalability, hence allowing to form supply chains in market scenarios with a large number of participants and high competition.
A scalable Message-Passing Algorithm for Supply Chain Formation
Publication Type:
Conference PaperSource:
AAAI Conf. on Artificial Intelligence, Toronto, Canada (2012)URL:
http://www.aaai.org/ocs/index.php/AAAI/AAAI12/paper/viewFile/5005/5480Abstract:
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 and have limited knowledge about the capabilities of other agents. The decentralized SCF problem has been recently cast as an optimization problem that can be efficiently approximated using max-sum loopy belief propagation. Along this direction, in this paper we propose a novel encoding of the problem into a binary factor graph (containing only binary variables) as well as an alternative algorithm. We empirically show that our approach allows to significantly increase scalability, hence allowing to form supply chains in market scenarios with a large number of participants and high competition.
PDFFile:
Scalable decentralized supply chain formation through binarized belief propagation
Publication Type:
Conference PaperSource:
International Joint Conference on Autonomous Agents and Multi-agent Systems, Valencia (2012)URL:
http://www.ifaamas.org/Proceedings/aamas2012/papers/Z2_13.pdfAbstract:
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 e ciently 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.
Sequential mixed auctions
Solving Sequential Mixed Auctions with Integer Programming
Empirical hardness for mixed auctions
Auctions and bidding: a guide for computer scientists
