Pareto-optimal algorithm in bilateral automated negotiation
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-equ...
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Advanced Institute of Convergence Information Technology
2011
|
| Online Access: | http://psasir.upm.edu.my/id/eprint/22465/ http://psasir.upm.edu.my/id/eprint/22465/1/Pareto-optimal%20algorithm%20in%20bilateral%20automated%20negotiation.pdf |
| _version_ | 1848844492032966656 |
|---|---|
| author | Jazayeriy, Hamid Azmi Murad, Masrah Azrifah Sulaiman, Md. Nasir Udzir, Nur Izura |
| author_facet | Jazayeriy, Hamid Azmi Murad, Masrah Azrifah Sulaiman, Md. Nasir Udzir, Nur Izura |
| author_sort | Jazayeriy, Hamid |
| building | UPM Institutional Repository |
| collection | Online Access |
| description | 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. |
| first_indexed | 2025-11-15T08:31:47Z |
| format | Article |
| id | upm-22465 |
| institution | Universiti Putra Malaysia |
| institution_category | Local University |
| language | English |
| last_indexed | 2025-11-15T08:31:47Z |
| publishDate | 2011 |
| publisher | Advanced Institute of Convergence Information Technology |
| recordtype | eprints |
| repository_type | Digital Repository |
| spelling | upm-224652016-06-08T09:00:42Z http://psasir.upm.edu.my/id/eprint/22465/ Pareto-optimal algorithm in bilateral automated negotiation Jazayeriy, Hamid Azmi Murad, Masrah Azrifah Sulaiman, Md. Nasir Udzir, Nur Izura 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. Advanced Institute of Convergence Information Technology 2011 Article PeerReviewed application/pdf en http://psasir.upm.edu.my/id/eprint/22465/1/Pareto-optimal%20algorithm%20in%20bilateral%20automated%20negotiation.pdf 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 http://www.aicit.org/dl/citation.html?id=JDCTA-390 10.4156/jdcta.vol5.issue3.1 |
| spellingShingle | Jazayeriy, Hamid Azmi Murad, Masrah Azrifah Sulaiman, Md. Nasir Udzir, Nur Izura Pareto-optimal algorithm in bilateral automated negotiation |
| title | Pareto-optimal algorithm in bilateral automated negotiation |
| title_full | Pareto-optimal algorithm in bilateral automated negotiation |
| title_fullStr | Pareto-optimal algorithm in bilateral automated negotiation |
| title_full_unstemmed | Pareto-optimal algorithm in bilateral automated negotiation |
| title_short | Pareto-optimal algorithm in bilateral automated negotiation |
| title_sort | pareto-optimal algorithm in bilateral automated negotiation |
| url | http://psasir.upm.edu.my/id/eprint/22465/ http://psasir.upm.edu.my/id/eprint/22465/ http://psasir.upm.edu.my/id/eprint/22465/ http://psasir.upm.edu.my/id/eprint/22465/1/Pareto-optimal%20algorithm%20in%20bilateral%20automated%20negotiation.pdf |