A guided genetic algorithm for bilateral negotiation with incomplete information
Reaching an agreement between negotiators is a complex process. The complexity of the problem is depicted by the difference preference of negotiators, the size of the solution space and the negotiation procedure. The aim of this study is to develop an automated negotiation method using a genetic alg...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Book Series |
| Published: |
2018
|
| Subjects: | |
| Online Access: | https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=84901479938&origin=inward http://cmuir.cmu.ac.th/jspui/handle/6653943832/53526 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | Chiang Mai University |
| Summary: | Reaching an agreement between negotiators is a complex process. The complexity of the problem is depicted by the difference preference of negotiators, the size of the solution space and the negotiation procedure. The aim of this study is to develop an automated negotiation method using a genetic algorithm as a mechanism. The proposed method uses theestimation of the zone of agreementtoguide negotiation. Time and joint utility are used as performance indicators. The result shows that the proposed method hasa better time usage than others'.However, our method could have poor value of joint utility in some cases. A likely explanation is that the progress rate of the negotiators affects the joint payoff. © (2014) Trans Tech Publications, Switzerland. |
|---|