TY - CHAP
T1 - Heuristic-based approaches for CP-Nets in negotiation
AU - Aydoǧan, Reyhan
AU - Baarslag, Tim
AU - Hindriks, Koen V.
AU - Jonker, Catholijn M.
AU - Yolum, PInar
PY - 2013/1/1
Y1 - 2013/1/1
N2 - 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.
AB - 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.
UR - https://www.scopus.com/pages/publications/84870399071
UR - https://www.scopus.com/inward/citedby.url?scp=84870399071&partnerID=8YFLogxK
U2 - 10.1007/978-3-642-30737-9_7
DO - 10.1007/978-3-642-30737-9_7
M3 - Chapter
AN - SCOPUS:84870399071
SN - 9783642307362
T3 - Studies in Computational Intelligence
SP - 113
EP - 123
BT - Complex Automated Negotiations
PB - Springer/Verlag
ER -