3:50 PM - 4:10 PM
[3P4-J-7-01] Explainable Compromising Algorithm based on Constraint Relaxation for Automated Negotiating Agents
Keywords:automatic negotiation, Multi-Agent System, compromise
This paper presents an explainable concession process based on constraint relaxation in multi-agent negotiation.
Automated negotiation has been studied widely and is the promising technology for the future smart city where multiple heterogeneous agents, like driver-less cars, are conicting and collaborating. There are a lot of studies on negotiating agents including international competitions. The problem is that most of the proposed negotiating agents employ ad-hoc conceding process, where basically they are adjusting threshold to accept their opponents offers. Because it is just adjusting a threshold, it is very difficult to show how and what the agent conceded even after agreement. In this paper, we propose an explainable concession process by using a constraint relaxation process. Here, an agent changes its belief not to believe some constraint so that he/she can accept its opponent offer. Our experimental results demonstrate that our method can work effectively.
Automated negotiation has been studied widely and is the promising technology for the future smart city where multiple heterogeneous agents, like driver-less cars, are conicting and collaborating. There are a lot of studies on negotiating agents including international competitions. The problem is that most of the proposed negotiating agents employ ad-hoc conceding process, where basically they are adjusting threshold to accept their opponents offers. Because it is just adjusting a threshold, it is very difficult to show how and what the agent conceded even after agreement. In this paper, we propose an explainable concession process by using a constraint relaxation process. Here, an agent changes its belief not to believe some constraint so that he/she can accept its opponent offer. Our experimental results demonstrate that our method can work effectively.