The University of Southampton
University of Southampton Institutional Repository

Heuristic-based approaches for (CP)-nets in negotiation

Heuristic-based approaches for (CP)-nets in negotiation
Heuristic-based approaches for (CP)-nets in negotiation
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.
978-3-642-30736-2
1860-949X
435
113-123
Springer
Aydogan, Reyhan
2ef7ca96-a5f0-48a1-91f3-1beae0ff5e5d
Baarslag, Tim
a7c541d8-8141-467b-a08c-7a81cd69920e
Hindriks, Koen V.
04b551cd-49a6-49cf-9c83-e1a19317eb0d
Jonker, Catholijn M.
b55441b1-d0fb-49f7-9a09-9375a9201fd0
Yolum, Pinar
33fbbb91-f459-46dd-8ef2-c1f50029a435
Ito, Takayuki
Zhang, Minjie
Robu, Valentin
Matsuo, Tokuro
Aydogan, Reyhan
2ef7ca96-a5f0-48a1-91f3-1beae0ff5e5d
Baarslag, Tim
a7c541d8-8141-467b-a08c-7a81cd69920e
Hindriks, Koen V.
04b551cd-49a6-49cf-9c83-e1a19317eb0d
Jonker, Catholijn M.
b55441b1-d0fb-49f7-9a09-9375a9201fd0
Yolum, Pinar
33fbbb91-f459-46dd-8ef2-c1f50029a435
Ito, Takayuki
Zhang, Minjie
Robu, Valentin
Matsuo, Tokuro

Aydogan, Reyhan, Baarslag, Tim, Hindriks, Koen V., Jonker, Catholijn M. and Yolum, Pinar (2013) Heuristic-based approaches for (CP)-nets in negotiation. In, Ito, Takayuki, Zhang, Minjie, Robu, Valentin and Matsuo, Tokuro (eds.) Complex Automated Negotiations: Theories, Models, and Software Competitions. (Studies in Computational Intelligence, , (doi:10.1007/978-3-642-30737-9_7), 435) Heidelberg, DE. Springer, pp. 113-123. (doi:10.1007/978-3-642-30737-9_7).

Record type: Book Section

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.

PDF
Heuristic-based Approaches for CP-Nets in Negotiation.pdf - Version of Record
Restricted to Registered users only
Download (404kB)
Request a copy

More information

Published date: 2013
Organisations: Agents, Interactions & Complexity

Identifiers

Local EPrints ID: 373211
URI: https://eprints.soton.ac.uk/id/eprint/373211
ISBN: 978-3-642-30736-2
ISSN: 1860-949X
PURE UUID: 7d62e68b-a334-4d38-a3fe-ced992c3584d
ORCID for Tim Baarslag: ORCID iD orcid.org/0000-0002-1662-3910

Catalogue record

Date deposited: 13 Jan 2015 12:53
Last modified: 06 Jun 2018 12:22

Export record

Altmetrics

Download statistics

Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.

View more statistics

Atom RSS 1.0 RSS 2.0

Contact ePrints Soton: eprints@soton.ac.uk

ePrints Soton supports OAI 2.0 with a base URL of https://eprints.soton.ac.uk/cgi/oai2

This repository has been built using EPrints software, developed at the University of Southampton, but available to everyone to use.

We use cookies to ensure that we give you the best experience on our website. If you continue without changing your settings, we will assume that you are happy to receive cookies on the University of Southampton website.

×