E-Negotiation of Dependent Multiple Issues by Using a Joint Search Strategy
Date Issued
2006
Date
2006
Author(s)
Chou, Ta-Chiun
DOI
en-US
Abstract
Negotiations have been a widespread research topic in politics, economics, and management. Recently, with the rapid growth of on-line bargains, automatic negotiations have become more and more important. Although many automatic negotiation strategies have been presented, most of them focus on simple negotiations composed of independent multiple issues. These strategies can not be applied to realistic complicated negotiations made up of dependent multiple issues.
Therefore, in this thesis, we propose a mechanism to deal with complex real world negotiations. We also develop a joint search strategy to find the satisfactory contract accepted by both parties. Besides, we use the genetic algorithm to predict and learn opponent’s preferences. Finally, our experimental result will demonstrate that our strategy can make a deal more efficiently.
Subjects
自動化協商
相依多議題
聯合搜尋
遺傳基因演算法
Automatic Negotiation
Dependent Multiple Issues
Joint Search
Genetic Algorithm
Type
thesis
File(s)![Thumbnail Image]()
Loading...
Name
ntu-95-P92922001-1.pdf
Size
23.31 KB
Format
Adobe PDF
Checksum
(MD5):a729fca33c6bb1c1da974a7372e0b3d3