Abstract
Conflicts of interest occur in various aspects of our daily life and we often come to an understanding by negotiating our way through these conflicts. This paper presents a simple interactive negotiation approach to resolve certain conflicts that involve multiple issues. The focus is on mediation to facilitate a solution based on alternating offers over a finite-time bargaining game. The mediator explores the possibilities and proposes a jointly optimal negotiation text for all the players participating in the negotiation process, based on their conditional preference networks (CP-nets). Each individual player then makes a decision to accept or reject the proposal based on their utility CP-nets. If any player rejects, the mediator offers another negotiation text and the process goes on until an agreement is achieved or some time limit is reached. Two algorithms are developed with regard to the players as well as the mediator, and a daily-life situation is investigated based on them. A historically important negotiation event has also been investigated using this model.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Apt, K.R., Rossi, F., Venable, K.B.: CP-nets and Nash equilibria. In: Proceedings of the 3rd International Conference on Computational Intelligence, Robotics and Autonomous Systems (CIRAS), pp. 13–16 (2005)
Aydogan, R., Baarslag, T., Hindriks, K., Jonker, C., Yolum, P.: Heuristic-based approaches for CP-nets in negotiation. In: Proceedings of the 4th International Workshop on Agent-based Complex Automated Negotiations (ACAN) (2011)
Bacchus, F., Grove, A.: Graphical models for preference and utility. In: Proceedings of the 11th Conference on Uncertainty in Artificial Intelligence, UAI’95, pp. 3–10 (1995)
Boutilier, C., Bacchus, F., Brafman, R.I.: UCP-networks: A directed graphical representation of conditional utilities. In: Proceedings of the 17th Conference on Uncertainty in Artificial Intelligence (UAI-01), pp. 56–64 (2001)
Boutilier, C., Brafman, R.I., Hoos, H.H., Poole, D.: CP-nets: a tool for representing and reasoning with conditional ceteris paribus preference statements. J. Artif. Intell. Res. 21, 135–191 (2004)
Boutilier, C., Brafman, R.I., Hoos, H.H., Poole, D.: Preference-based constrained optimization with CP-nets. Comput. Intell. 20, 137–157 (2004)
Chalamish, M., Kraus, S.: Automed: an automated mediator for multi-issue bilateral negotiations. Auton. Agent. Multi-Agent Syst. 24(3), 536–564 (2012)
Ehtamo, H., Kettunen, E., Hamalainen, R.P.: Searching for joint gains in multi-party negotiations. Eur. J. Oper. Res. 130(1), 54–69 (2001)
Fatima, S.S., Wooldridge, M., Jennings, N.R.: Bargaining with incomplete information. Ann. Math. Artifi. Intell. 44(3), 207–232 (2005)
Fisher, R.: International Mediation: A Working Guide. International Peace Academy, New York (1978)
Korhonen, P., Oretskin, N., Teich, J., Wallenius, J.: The impact of a biased starting position in a single negotiation text type mediation. Group Decis. Negot. 4, 357–374 (1995)
Li, M., Vo, Q.B., Kowalczyk, R.: Efficient heuristic approach to dominance testing in CP-nets. In: Proceedings of 10th International Conference on Autonomous Agents and Multiagent Systems (AAMAS), pp. 353–360 (2011)
Li, M., Vo, Q.B., Kowalczyk, R.: An efficient protocol for negotiation over combinatorial domains with incomplete information. In: Proceedings of the 27th Conference on Uncertainty in Artificial Intelligence (UAI), Barcelona, Spain. pp. 436–444 (2011)
Li, M., Vo, Q.B., Kowalczyk, R.: Majority-rule-based preference aggregation on multi-attribute domains with CP-nets, In: Tumer, K., Yolum, P., Sonenberg, L., Stone, P. (eds.) Proceedings of 10th International Conference on Autonomous Agents and Multiagent Systems (AAMAS), pp. 659–666 (2011)
Liu, Z., Li, X., Guo, S., Liu, J.: A game tree algorithm for optimal outcome of CP-nets. Int. J. Digital Content Technol. Appl. (JDCTA) 6(4), 173–179 (2012)
Oakman, J.: The Camp David Accords: A case study on international negotiation. Princeton University, Woodrow Wilson School of Public and International Affairs, Technical report (2002)
Pearl, J.: Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference. Morgan Kaufmann Publishers Inc, San Francisco, CA, USA (1988)
Purrington, K., Durfee, E.H.: Agreeing on social outcomes using individual CP-nets. Multiagent and Grid Syst. 5(4), 409–425 (2009)
Raiffa, H., Richardson, J., Metcalfe, D.: Negotiation Analysis: The Science and Art of Collaborative Decision Making. Belknap Press of Harvard University Press, Cambridge (2002)
Rasmusen, E.: Games and Information, 4th edn. Blackwell Publishing, New Jersy (2007)
Rossi, F., Venable, K.B., Walsh. T.: mCP nets: Representing and reasoning with preferences of multiple agents. In: Proceedings of the 19th National Conference on Artificial Intelligence (AAAI), pp. 729–734 (2004)
Telhami, S.: Evaluating bargaining performance: the case of Camp David. Polit. Sci. Q. 107, 629–653 (1993)
Acknowledgements
We gratefully acknowledge the anonymous reviewers of ICAART 2013 as well as of Transactions CCI whose comments helped us to improve this paper. We also acknowledge NWO research grant 600.065.120.08N- 201, Vici grant NWO 227-80-001, and a Lotus II grant from the EU.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Ghosh, S., Kyaw, T.H., Verbrugge, R. (2014). Conditional Preference Networks Support Multi-issue Negotiations with Mediator. In: Nguyen, N., Kowalczyk, R., Fred, A., Joaquim, F. (eds) Transactions on Computational Collective Intelligence XVII. Lecture Notes in Computer Science(), vol 8790. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-44994-3_9
Download citation
DOI: https://doi.org/10.1007/978-3-662-44994-3_9
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-662-44993-6
Online ISBN: 978-3-662-44994-3
eBook Packages: Computer ScienceComputer Science (R0)