UPM Institutional Repository

Pareto-optimal algorithm in bilateral automated negotiation


Jazayeriy, Hamid and Azmi Murad, Masrah Azrifah and Sulaiman, Md. Nasir and Udzir, Nur Izura (2011) Pareto-optimal algorithm in bilateral automated negotiation. International Journal of Digital Content Technology and its Applications, 5 (3). pp. 1-11. ISSN 1975-9339; ESSN: 2233-9310


In this paper we present a Pareto-optimal algorithm in bilateral automated negotiation where the negotiation is modeled by "split the pie" game and alternating-offer protocol. Pareto-optimality is the seminal condition in the bargaining problem which leads autonomous agents to the Nash-equilibrium. Generating Pareto-optimal offer in multi-issue bargaining is a computationally complex problem, specially, when autonomous agents have incomplete information about deadline, outside options and the opponent's preferences. Unfortunately, yet to date, there is no articulation that clearly describes an algorithm to generate offer in multi-issue negotiation with perfect information. To this end, we present the maximum greedy trade-offs (MGT) algorithm that generate offers at any aspiration-level in O(n) with assuming that the order of greedy choices is given, otherwise the complexity will be O(n bg n). We also provide analytical proof for the correctness of the maximum greedy trade-offs algorithm.

Download File

PDF (Abstract)
Pareto-optimal algorithm in bilateral automated negotiation.pdf

Download (33kB) | Preview
Official URL or Download Paper: http://www.aicit.org/dl/citation.html?id=JDCTA-390

Additional Metadata

Item Type: Article
Divisions: Faculty of Computer Science and Information Technology
DOI Number: https://doi.org/10.4156/jdcta.vol5.issue3.1
Publisher: Advanced Institute of Convergence Information Technology
Keywords: Algorithm; Bilateral negotation; Multi issues; Pareto-optimal
Depositing User: Nabilah Mustapa
Date Deposited: 08 Jun 2016 09:00
Last Modified: 08 Jun 2016 09:00
Altmetrics: http://www.altmetric.com/details.php?domain=psasir.upm.edu.my&doi=10.4156/jdcta.vol5.issue3.1
URI: http://psasir.upm.edu.my/id/eprint/22465
Statistic Details: View Download Statistic

Actions (login required)

View Item View Item