Abstract
CP-Nets have proven to be an effective representation for capturing preferences. However, their use in multiagent negotiation is not straightforward. The main reason for this is that CP-Nets capture partial ordering of preferences, whereas negotiating agents are required to compare any two outcomes based on the request and offers. This makes it necessary for agents to generate total orders from their CP-Nets. We have previously proposed a heuristic to generate total orders from a given CP-Net. This paper proposes another heuristic based on Borda count, applies it in negotiation, and compares its performance with the previous heuristic.
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
Aydoğan, R., Yolum, P.: Heuristics for cp-nets: Negotiating effectively with partial preferences. In: HUCOM Workshop in Group Decision and Negotiation, The Netherlands (2010)
Baarslag, T., Hindriks, K., Jonker, C., Kraus, S., Lin, R.: The First Automated Negotiating Agents Competition (ANAC 2010). In: Ito, T., Zhang, M., Robu, V., Fatima, S., Matsuo, T. (eds.) New Trends in Agent-Based Complex Automated Negotiations. SCI, vol. 383, pp. 113–135. Springer, Heidelberg (2012)
Black, D.: The Theory of Committees and Elections. Cambridge University Press (1958)
Boutilier, C., Bacchus, F., Brafman, R.I.: Ucp-networks: A directed graphical representation of conditional utilities. In: Proceedings of UAI 2001, USA, pp. 56–64 (2001)
Boutilier, C., Brafman, R.I., Domshlak, C., Hoos, H.H., Poole, D.: Cp-nets: A tool for representing and reasoning with conditional ceteris paribus preference statements. J. Artif. Intell. Res. (JAIR) 21, 135–191 (2004)
Faratin, P., Sierra, C., Jennings, N.R.: Negotiation decision functions for autonomous agents. Int. Journal of Robotics and Autonomous Systems 24(3-4), 159–182 (1998)
Fatima, S.S., Wooldridge, M., Jennings, N.R.: On Efficient Procedures for Multi-issue Negotiation. In: Fasli, M., Shehory, O. (eds.) TADA/AMEC 2006. LNCS (LNAI), vol. 4452, pp. 31–45. Springer, Heidelberg (2007)
Hindriks, K., Tykhonov, D.: Opponent modelling in automated multi-issue negotiation using bayesian learning. In: 7th International Joint Conference on Autonomous Agents and Multiagent Systems, AAMAS, Estorial, Portugal, pp. 331–338 (2008)
Jonker, C.M., Robu, V., Treur, J.: An agent architecture for multi-attribute negotiation using incomplete preference information. JAAMAS 15(2), 221–252 (2007)
Li, M., Vo, Q.B., Kowalczyk, R.: An efficient procedure for collective decision-making with cp-nets. In: Proceeding of ECAI 2010, Lisbon, Portugal, pp. 375–380 (2010)
Lin, R., Kraus, S., Baarslag, T., Tykhonov, D., Hindriks, K., Jonker, C.M.: Genius: An integrated environment for supporting the design of generic automated negotiators. Computational Intelligence (2012)
Rossi, F., Venable, K.B., Walsh, T.: mcp nets: Representing and reasoning with preferences of multiple agents. In: Proceeding of AAAI 2004, pp. 729–734 (2004)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Aydoğan, R., Baarslag, T., Hindriks, K.V., Jonker, C.M., Yolum, P. (2013). Heuristic-Based Approaches for CP-Nets in Negotiation. In: Ito, T., Zhang, M., Robu, V., Matsuo, T. (eds) Complex Automated Negotiations: Theories, Models, and Software Competitions. Studies in Computational Intelligence, vol 435. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-30737-9_7
Download citation
DOI: https://doi.org/10.1007/978-3-642-30737-9_7
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-30736-2
Online ISBN: 978-3-642-30737-9
eBook Packages: EngineeringEngineering (R0)