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!
|
Be the first to leave a comment!