Generating Pareto-Optimal Offers in Bilateral Automated Negotiation with One-Side Uncertain Importance Weights
Hamid Jazayeriy; Faculty of Electrical and Computer Engineering, Babol Nashirvani University of Technology, Babol, Mazandaran ; Masrah Azmi-Murad; Faculty of Computer Science and Information Technology, University of Putra Malaysia, Serdang ; Nasir Sulaiman; Faculty of Computer Science and Information Technology, University of Putra Malaysia, Serdang ; Nur Izura Udzir; Faculty of Computer Science and Information Technology, University of Putra Malaysia, Serdang
Computing and Informatics, Tome 31 (2013) no. 6, / Harvested from Computing and Informatics
Text on Computing and Informatics
Pareto efficiency is a seminal condition in the bargaining problem which leads autonomous agents to a Nash-equilibrium. This paper investigates the problem of the generating Pareto-optimal offers in bilateral multi-issues negotiation where an agent has incomplete information and the other one has perfect information. To this end, at first, the bilateral negotiation is modeled by split the pie game and alternating-offer protocol. Then, the properties of the Pareto-optimal offers are investigated. Finally, based on properties of the Pareto-optimal offers, an algorithmic solution for generating near-optimal offers with incomplete information is presented. The agent with incomplete information generates near-optimal offers in O(n łog n). The results indicate that, in the early rounds of the negotiation, the agent with incomplete information can generate near-optimal offers, but as time passes the agent can learn its opponents preferences and generate Pareto-optimal offers. The empirical analysis also indicates that the proposed algorithm outperform the smart random trade-offs (SRT) algorithm.
Publié le : 2013-01-24
Classification:  Bilateral negotiation, pareto-optimal offer, uncertain information, algorithm 
@article{cai1306,
     author = {Hamid Jazayeriy; Faculty of Electrical and Computer Engineering, Babol Nashirvani University of Technology, Babol, Mazandaran and Masrah Azmi-Murad; Faculty of Computer Science and Information Technology, University of Putra Malaysia, Serdang and Nasir Sulaiman; Faculty of Computer Science and Information Technology, University of Putra Malaysia, Serdang and Nur Izura Udzir; Faculty of Computer Science and Information Technology, University of Putra Malaysia, Serdang},
     title = {Generating Pareto-Optimal Offers in Bilateral Automated Negotiation with One-Side Uncertain Importance Weights},
     journal = {Computing and Informatics},
     volume = {31},
     number = {6},
     year = {2013},
     language = {en},
     url = {http://dml.mathdoc.fr/item/cai1306}
}

Hamid Jazayeriy; Faculty of Electrical and Computer Engineering, Babol Nashirvani University of Technology, Babol, Mazandaran; Masrah Azmi-Murad; Faculty of Computer Science and Information Technology, University of Putra Malaysia, Serdang; Nasir Sulaiman; Faculty of Computer Science and Information Technology, University of Putra Malaysia, Serdang; Nur Izura Udzir; Faculty of Computer Science and Information Technology, University of Putra Malaysia, Serdang. Generating Pareto-Optimal Offers in Bilateral Automated Negotiation with One-Side Uncertain Importance Weights. Computing and Informatics, Tome 31 (2013) no. 6, . http://gdmltest.u-ga.fr/item/cai1306/