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...
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Advanced Institute of Convergence Information Technology
2011
|
| Online Access: | http://psasir.upm.edu.my/id/eprint/22465/1/Pareto-optimal%20algorithm%20in%20bilateral%20automated%20negotiation.pdf http://psasir.upm.edu.my/id/eprint/22465/ http://www.aicit.org/dl/citation.html?id=JDCTA-390 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | 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. |
|---|