BOFA - A Framework for Fairness in Automated Negotiations

Bachelor thesis (2022)

Authors

N. Blagoev Electrical Engineering, Mathematics and Computer Science

Contributors

S.K. Kuilman Interactive Intelligence - EEMCS (mentor)
Luciano Cavalcante Siebert Interactive Intelligence - EEMCS (mentor)
M. Weinmann Computer Graphics and Visualisation - EEMCS (graduation committee member)
Faculty
Electrical Engineering, Mathematics and Computer Science, Electrical Engineering, Mathematics and Computer Science
Copyright: © 2022 Nikolay Blagoev
More Info
expand_more

Published Date

22-06-2022

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.

Faculty

Electrical Engineering, Mathematics and Computer Science

Abstract

As automated negotiating agents become more and more part of our daily life, additional care needs to be taken that the agents can negotiate fairly. Humans each have their own intrinsic view on fairness, which affects the negotiation processes and the degree to which the outcome is viewed as satisfactory. However, most current agents are built around a specific notion of fairness, which could be potentially unwanted in certain scenarios or by some individuals. This paper presents a generic framework through which varying fairness notions can be implemented. The performance of the framework is tested through a selection of proposed agents with different fairness views. The results show that the agents are able to reach an agreement on the pareto frontier that is fair given their notion. Thus they do not sacrifice optimality for fairness.

Files

Research_Paper_Template_8_.pdf
(pdf | 0.563 Mb)
Unknown license