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.
Links:
[1] http://www.iiia.csic.es/en/individual/toni-penya-alba
[2] http://www.iiia.csic.es/en/individual/meritxell-vinyals
[3] http://www.iiia.csic.es/en/individual/jesus-cerquides
[4] http://www.iiia.csic.es/en/individual/juan-a-rodriguez-aguilar
[5] http://www.ifaamas.org/Proceedings/aamas2012/papers/Z2_13.pdf
[6] http://www.iiia.csic.es/en/publications/export/tagged/4558
[7] http://www.iiia.csic.es/en/publications/export/xml/4558
[8] http://www.iiia.csic.es/en/publications/export/bib/4558
[9] http://www.iiia.csic.es/files/pdfs/Penya-Alba et al. - 2012 - 11th International Conference on Autonomous Agents and Multiagent Systems (AAMAS 2012) - Scalable decentralized supply chain formation through binarized belief propagation (Extended Abstract).pdf
[10] http://www.iiia.csic.es/en/project/at
[11] http://www.iiia.csic.es/en/project/eve
