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 , while  provides a further extension of this work, in which collaborative filtering is used to learn the starting structure of such graphs.
|Number of pages||2|
|Journal||Belgian/Netherlands Artificial Intelligence Conference|
|Publication status||Published - 1 Dec 2005|
|Event||17th Belgium-Netherlands Conference on Artificial Intelligence, BNAIC 2005 - Brussels, Belgium|
Duration: 17 Oct 2005 → 18 Oct 2005