Learning a Latent Representation of the Opponent in Automated Negotiation

Bachelor thesis (2022)

Authors

R. Gaghi Electrical Engineering, Mathematics and Computer Science

Contributors

P.K. Murukannaiah Interactive Intelligence - EEMCS (supervisor 1)
B.M. Renting Interactive Intelligence - EEMCS (supervisor 1)
X. Zhang Pattern Recognition and Bioinformatics - EEMCS (supervisor 2)
Faculty
Electrical Engineering, Mathematics and Computer Science
Copyright: © 2022 Radu Gaghi
More Info
expand_more

Published Date

23-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

This paper introduces a strategy for learning opponent parameters in automated negotiation and using them for future negotiation sessions. The goal is to maximize the agent’s utility while being consistent in its performance over various negotiation scenarios. While a number of reinforcement learning approaches in the field have used Q-learning, this paper uses the newer Proximal Policy Optimization algorithm. Machine learning has been used in opponent modeling, classifying opponents, and learning strategies, but there have been few attempts to store and re-use this information. In an experimental setup, it is shown that this approach outperforms a baseline in terms of individual utility.