Abstract
We describe an approach for learning the model of the opponent in spatio-temporal negotiation. We use the Children in the Rectangular Forest canonical problem as an example. The opponent model is represented by the physical characteristics of the agents: the current location and the destination. We assume that the agents do not disclose any of their information voluntarily; the learning needs to rely on the study of the offers exchanged during normal negotiation. Our approach is Bayesian learning, with the main contribution being four techniques through which the posterior probabilities are determined. The calculations rely on (a) feasibility of offers, (b) rationality of offers, (c) the assumption of decreasing utility, and (d) the assumption of accepting offer which is better than the next counter-offer.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Bui, H.H., Kieronska, D., Venkatesh, S.: Learning other agents’ preferences in multiagent negotiation. In: Proceedings of the National Conference on Artificial Intelligence (AAAI 1996), pp. 114–119. AAAI Press, Menlo Park (1996)
Dmytro Tykhonov, K.H.: Opponent modelling in automated multi-issue negotiation using bayesian learning. In: Seventh International Conference on Autonomous Agents and Multiagent Systems (AAMAS 2008), pp. 331–338 (2008)
Faratin, P., Sierra, C., Jennings, N.R.: Using similarity criteria to make issue trade-offs in automated negotiations. Artificial Intelligence 142, 205–237 (2002)
Fatima, S.S., Wooldridge, M., Jennings, N.R.: Multi-issue negotiation with deadlines. Journal of Artificial Intelligence Research 27, 381–417 (2006)
Ficici, S., Pfeffer, A.: Simultaneously modeling humans’ preferences and their beliefs about others’ preferences. In: Seventh International Conference on Autonomous Agents and Multiagent Systems (AAMAS 2008), pp. 323–330 (2008)
Li, J., Cao, Y.-D.: Bayesian learning in bilateral multi-issue negotiation and its application in mas-based electronic commerce. Iat, 437–440 (2004)
Luo, Y., Bölöni, L.: Children in the forest: towards a canonical problem of spatio-temporal collaboration. In: The Sixth Intl. Joint Conf. on Autonomous Agents and Multi-Agent Systems (AAMAS 2007), pp. 986–993 (2007)
Luo, Y., Bölöni, L.: Collaborative and competitive scenarios in spatio-temporal negotiation with agents of bounded rationality. In: Proceedings of the 1st International Workshop on Agent-based Complex Automated Negotiations, in conjunction with the The Seventh Intl. Joint Conf. on Autonomous Agents and Multi-Agent Systems (AAMAS 08), pp. 40–47 (2008)
Tim McLain, R.W.B.: Unmanned air vehicle testbed for cooperative control experiments. In: American Control Conference, Boston, MA, pp. 5327–5331 (2004)
Zeng, D., Sycara, K.: Bayesian learning in negotiation. Int. J. Hum.-Comput. Stud. 48(1), 125–141 (1998)
Zheng, X., Koenig, S.: Reaction functions for task allocation to cooperative agents. In: Seventh International Conference on Autonomous Agents and Multiagent Systems (AAMAS 2008), pp. 559–566 (2008)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 ICST Institute for Computer Science, Social Informatics and Telecommunications Engineering
About this paper
Cite this paper
Luo, Y., Bölöni, L. (2009). Learning Models of the Negotiation Partner in Spatio-temporal Collaboration. In: Bertino, E., Joshi, J.B.D. (eds) Collaborative Computing: Networking, Applications and Worksharing. CollaborateCom 2008. Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering, vol 10. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-03354-4_18
Download citation
DOI: https://doi.org/10.1007/978-3-642-03354-4_18
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-03353-7
Online ISBN: 978-3-642-03354-4
eBook Packages: Computer ScienceComputer Science (R0)