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. © 2014 Springer International Publishing Switzerland.
CITATION STYLE
Delecroix, F., Morge, M., & Routier, J. C. (2014). Bilateral negotiation of a meeting point in a maze: Demonstration. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8473 LNAI, pp. 327–330). Springer Verlag. https://doi.org/10.1007/978-3-319-07551-8_30
Mendeley helps you to discover research relevant for your work.