Agent33: An automated negotiator with heuristic method for searching bids around nash bargaining solution

1Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.
Get full text

Abstract

The international Automated Negotiating Agents Competition (ANAC) is being held annually since 2010 in order to bring together the researchers from the multi-agent negotiation community. In this regard, the Repeated Multilateral Negotiation League (RMNL), one of the four negotiation research challenges in ANAC 2018, requires participants to design and implement an intelligent negotiating agent, that is able to negotiate with two other opponents and that is able to learn from its previous negotiation experiences. In this context, in this paper, we design a negotiating agent that focuses on searching the space of suitable bids that provide high utilities for both sides near the Nash Bargaining Solution (NBS) using a novel heuristic method. The proposed agent has participated in the ANAC competition successfully and finished in the second place in the social welfare category.

Cite

CITATION STYLE

APA

Liu, S., Moustafa, A., & Ito, T. (2018). Agent33: An automated negotiator with heuristic method for searching bids around nash bargaining solution. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 11224 LNAI, pp. 519–526). Springer Verlag. https://doi.org/10.1007/978-3-030-03098-8_37

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free