@incollection{aydogan_heuristic-based_2013,
    address = {Berlin, Heidelberg},
    title = {Heuristic-{Based} {Approaches} for {CP}-{Nets} in {Negotiation}},
    isbn = {978-3-642-30737-9},
    url = {https://doi.org/10.1007/978-3-642-30737-9_7},
    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.},
    booktitle = {Complex {Automated} {Negotiations}: {Theories}, {Models}, and {Software} {Competitions}},
    publisher = {Springer Berlin Heidelberg},
    author = {Aydoğan, Reyhan and Baarslag, Tim and Hindriks, Koen V. and Jonker, Catholijn M. and Yolum, Pınar},
    editor = {Ito, Takayuki and Zhang, Minjie and Robu, Valentin and Matsuo, Tokuro},
    year = {2013},
    doi = {10.1007/978-3-642-30737-9_7},
    pages = {113--123},
}