Bilateral Negotiation of a Meeting Point in a Maze: Demonstration
Negotiation between agents aims at reaching an agreement in which the conflicting interests of agents are accommodated. In this demonstration, we present a concrete negotiation scenario where two agents are situated in a maze and the negotiation outcome is a cell where they will meet. Their individual preferences match with a minimal distance computed from their partial knowledge of the environment. We illustrate a bargaining protocol which allows agents to submit several proposals at the same round and a negotiation strategy which consists in starting from the best deal for the agent and then concedes. The path between the agents emerges from the repeated negotiations.
Unable to display preview. Download preview PDF.
- 1.Rosenschein, J., Zlotkin, G.: Rules of Encounter - Designing Conventions for Automated Negotiation among Computers. MIT Press (1994)Google Scholar
- 5.Sandholm, T., Vulkan, N.: Bargaining with deadlines. In: Proc. of AAAI, pp. 44–51 (1999)Google Scholar
- 7.Morge, M., Picard, G.: Privacy-preserving strategy for negotiating stable, equitable and optimal matchings. In: Demazeau, Y., Pěchoucěk, M., Corchado, J.M., Pérez, J.B. (eds.) Adv. on Prac. Appl. of Agents and Multi. Sys. AISC, pp. 97–102. Springer, Heidelberg (2011)Google Scholar
- 8.Aydoğan, R., Baarslag, T., Hindriks, K.V., Jonker, C.M., Yolum, P.: Heuristic-based approaches for CP-nets in negotiation. In: Ito, T., Zhang, M., Robu, V., Matsuo, T. (eds.) Complex Automated Negotiations. SCI, vol. 435, pp. 115–126. Springer, Heidelberg (2012)Google Scholar
- 10.Delecroix, F., Morge, M., Routier, J.C.: Bilateral negotiation of a meeting point in a maze. In: Demazeau, Y., Corchado, J.M., Zambonelli, F., Bajo, J. (eds.) PAAMS 2014. LNCS (LNAI), vol. 8473, pp. 86–97. Springer, Heidelberg (2014)Google Scholar