Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Rosenschein, J., Zlotkin, G.: Rules of Encounter - Designing Conventions for Automated Negotiation among Computers. MIT Press (1994)
Rubinstein, A.: Perfect equilibrium in a bargaining model. Econometrica 50(1), 97–102 (1982)
Fatima, S.S., Wooldridge, M., Jennings, N.R.: Multi-issue negotiation with deadlines. Journal of Artificial Intelligence Research 27, 381–417 (2006)
Gatti, N., Giunta, F.D., Marino, S.: Alternating-offers bargaining with one-sided uncertain deadlines: an efficient algorithm. Artificial Intelligence 172(8-9), 1119–1157 (2008)
Sandholm, T., Vulkan, N.: Bargaining with deadlines. In: Proc. of AAAI, pp. 44–51 (1999)
Faratin, P., Sierra, C., Jennings, N.R.: Negotiation decision functions for autonomous agents. Robotics and Autonomous Systems 24(3-4), 159–182 (1998)
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)
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)
Jennings, N., Faratin, P., Lomuscio, A., Parsons, S., Wooldridge, M., Sierra, C.: Automated negotiation: Prospects methods and challenges. Group Decision and Negotiation 10(2), 199–215 (2001)
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)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this paper
Cite this paper
Delecroix, F., Morge, M., Routier, JC. (2014). Bilateral Negotiation of a Meeting Point in a Maze: Demonstration. In: Demazeau, Y., Zambonelli, F., Corchado, J.M., Bajo, J. (eds) Advances in Practical Applications of Heterogeneous Multi-Agent Systems. The PAAMS Collection. PAAMS 2014. Lecture Notes in Computer Science(), vol 8473. Springer, Cham. https://doi.org/10.1007/978-3-319-07551-8_30
Download citation
DOI: https://doi.org/10.1007/978-3-319-07551-8_30
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-07550-1
Online ISBN: 978-3-319-07551-8
eBook Packages: Computer ScienceComputer Science (R0)