|
||||||||||||||||||||||||||||||||||||||||
|
||||||||||||||||||||||||||||||||||||||||
ABSTRACT
Multi-issue negotiation mechanisms have been studied very widely and represent a promising field because most negotiations in the real world are multi-issue negotiations. We model multi-issue negotiation with competitive agents. This reflects the real world in which people have to make agreements on constraints. A combinatorial winner determination mechanism is employed for solving a constraint satisfaction problem with competitive agents. The features of our protocol include Pareto efficiency on constraints. Our experimental results show that our proposed protocol is scalable with the number of agents, and that a heuristic method can achieve good utility. The above protocol is designed for linear utility domains. We also extend our protocol so that we can handle nonlinear utilities. REFERENCES
Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.
INDEX TERMS
Primary Classification:
Additional Classification:
Keywords:
|
||||||||||||||||||||||||||||||||||||||||