Modeling bilateral negotiations over multiple, interdependent issues using utility graphs

Journal article (2005)

Authors

Valentin Robu Centrum Wiskunde & Informatica (CWI)
Koye Somefun Centrum Wiskunde & Informatica (CWI)
J.A. la Poutré Centrum Wiskunde & Informatica (CWI)
Affiliation
External organisation
More Info
expand_more

Published Date

01-12-2005

Language

English

Reuse Rights

Other than for strictly personal use, it is not permitted to download, forward or distribute the text or part of it, without the consent of the author(s) and/or copyright holder(s), unless the work is under an open content license such as Creative Commons.

Affiliation

External organisation

Abstract

This paper presents an agent strategy for automated negotiation over a set of issues with interdependent valuations. First, we show how complex utility functions over a set of binary issues (or bundle of items) can be concisely represented using the formalism of utility graphs. Next, a heuristic is proposed for automated learning of an opponent's preference function, starting from a given (maximal) factorization of this function as a utility graph. The contribution of our approach is that it speeds up learning considerably compared to other techniques proposed in existing literature for this problem. An extended version of this paper is given in [1], while [2] provides a further extension of this work, in which collaborative filtering is used to learn the starting structure of such graphs.