A negotiation framework for linked combinatorial optimization problems
- 277 Downloads
We tackle the challenge of applying automated negotiation to self-interested agents with local but linked combinatorial optimization problems. Using a distributed production scheduling problem, we propose two negotiation strategies for making concessions in a joint search space of agreements. In the first strategy, building on Lai and Sycara (Group Decis Negot 18(2):169–187, 2009), an agent concedes on local utility in order to achieve an agreement. In the second strategy, an agent concedes on the distance in an attribute space while maximizing its local utility. Lastly, we introduce a Pareto improvement phase to bring the final agreement closer to the Pareto frontier. Experimental results show that the new attribute-space negotiation strategy outperforms its utility-based counterpart on the quality of the agreements and the Pareto improvement phase is effective in approaching the Pareto frontier. This article presents the first study of applying automated negotiation to self-interested agents each with a local, but linked, combinatorial optimization problem.
KeywordsCombinatorial optimization Production scheduling Multi-agent negotiation Negotiation framework Negotiation strategy Pareto efficiency
Unable to display preview. Download preview PDF.
- 1.An, B., Lesser, V., & Sim, K. M. (2008). Decommitment in multi-resource negotiation. In Proceedings of the 7th International Joint Conference on Autonomous Agents and Multi-Agent Systems, Estoril, Portugal (pp. 1553–1556). Richland, SC: International Foundation for Autonomous Agents and Multiagent Systems.Google Scholar
- 4.Burke, D. A., Brown, K. N., Dogru, M., & Lowe, B. (2007). Supply chain coordination through distributed constraint optimisation. In Proceedings of the 9th International Workshop on Distributed Constraint Reasoning, Providence, RI. Available from http://sites.google.com/site/ekrubdivad/burke-DCR07.pdf.
- 5.Cachon P. G. (2008) Matching supply with demand: An introduction to operations management. McGraw-Hill/Irwin, New YorkGoogle Scholar
- 6.Crawford, E., & Veloso, M. (2008). Negotiation in semi-cooperative agreement problems. In Proceedings of the 2008 IEEE/WIC/ACM International Conference on Intelligent Agent Technology, Sydney, Australia (pp. 252–258). IEEE.Google Scholar
- 7.Duan, L., Doğru, M. K., & Özen, U., & Beck, J. C. (2010). Multi-agent negotiation for distributed production scheduling problems. In Proceedings of The Third International Workshop on Agent-based Complex Automated Negotiations, Toronto, ON, Canada. Available from http://tidel.mie.utoronto.ca/pubs/cr_acno2010.pdf.
- 10.Fleischmann, B., & Meyr, H. (2003). Supply chain management: Design, coordination and operation. In Planning hierarchy, modeling and advanced planning systems, Chap. 9. Amsterdam: Elsevier.Google Scholar
- 11.Grubshtein, A., Zivan, R., Grinshpoun, T., & Meisels, A. (2010). Local search for distributed asymmetric optimization. In Proceedings of the Ninth International Conference on Autonomous Agents and Multiagent Systems, Toronto, ON, Canada (pp. 1015–1022). Richland, SC: International Foundation for Autonomous Agents and Multiagent Systems.Google Scholar
- 14.Mas-Colell A., Whinston M. D., Green J. R. (1995) Microeconomic theory. Oxford University Press, OxfordGoogle Scholar
- 17.Silver E. A., Pyke D. F., Peterson R. (1998) Inventory management and production planning and scheduling. Wiley, New YorkGoogle Scholar
- 18.Smith, S. F., Gallagher, A., Zimmerman, T., Barbulescu, L., & Rubinstein, Z. (2007). Distributed management of flexible times schedules. In Proceedings of the 6th International Joint Conference on Autonomous Agents and Multiagent Systems, Honolulu, HI (pp. 472–479). New York: ACM.Google Scholar
- 19.Wooldridge M. (2009) An introduction to multiagent systems, 2nd ed. Wiley, New YorkGoogle Scholar
- 20.Zhang, X., & Lesser, V. (2002). Multi-linked negotiation in multi-agent systems. In Proceedings of the First International Joint Conference on Autonomous Agents and Multiagent Systems, Bologna, Italy (pp. 1207–1214). New York: ACM.Google Scholar