Please use this identifier to cite or link to this item: http://hdl.handle.net/1959.3/2515

Title

Efficient algorithm for estimation of qualitative expected utility in possibilistic case-based reasoning

Author(s)

Brzostowski, Jakub;  Kowalczyk, Ryszard

Abstract

We propose an efficient algorithm for estimation of possibility based qualitative expected utility. It is useful for decision making mechanisms where each possible decision is assigned a multi-attribute possibility distribution. The computational complexity of ordinary methods calculating the expected utility based on discretization is growing exponentially with the number of attributes, and may become infeasible with a high number of these attributes. We present series of theorems and lemmas proving the correctness of our algorithm that exibits a linear computational complexity. Our algorithm has been applied in the context of selecting the most prospective partners in multi-party multi-attribute negotiation, and can also be used in making decisions about potential offers during the negotiation as other similar problems.

Publication type

Conference paper

Research centre

Swinburne University of Technology. Faculty of Information and Communication Technologies

Source

Proceedings of the 21st Conference on Uncertainty in Artificial Intelligence, 26-29 July 2005, Edinburgh, Scotland, UK, pp. 69-76

Publication year

2005

Publisher

AUAI Press

ISBN

0 9749039 1 4

Publisher URL

http://uai.sis.pitt.edu

Peer reviewed