Heuristic-based approaches for CP-Nets in negotiation

Reyhan Aydoǧan*, Tim Baarslag, Koen V. Hindriks, Catholijn M. Jonker, PInar Yolum

*Corresponding author for this work

Research output: Chapter in Book / Report / Conference proceedingChapterAcademicpeer-review

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.

Original languageEnglish
Title of host publicationComplex Automated Negotiations
Subtitle of host publicationTheories, Models, and Software Competitions
PublisherSpringer/Verlag
Pages113-123
Number of pages11
ISBN (Print)9783642307362
DOIs
Publication statusPublished - 1 Jan 2013
Externally publishedYes

Publication series

NameStudies in Computational Intelligence
Volume435
ISSN (Print)1860-949X

Cite this

Aydoǧan, R., Baarslag, T., Hindriks, K. V., Jonker, C. M., & Yolum, PI. (2013). Heuristic-based approaches for CP-Nets in negotiation. In Complex Automated Negotiations: Theories, Models, and Software Competitions (pp. 113-123). (Studies in Computational Intelligence; Vol. 435). Springer/Verlag. https://doi.org/10.1007/978-3-642-30737-9_7