A Preliminary Analysis of Computational Complexity of the Threshold Adjusting Mechanism in Multi-issue Negotiations

Authors:
Katsuhide Fujita;Takayuki Ito
Affiliations:
-;-
Venue:
WI-IATW '07 Proceedings of the 2007 IEEE/WIC/ACM International Conferences on Web Intelligence and Intelligent Agent Technology - Workshops
Year:
2007

Citing 4
Cited 0

Adaptive, Confidence-Based Multiagent Negotiation Strategy

AAMAS '04 Proceedings of the Third International Joint Conference on Autonomous Agents and Multiagent Systems - Volume 3
Optimal Negotiation of Multiple Issues in Incomplete Information Settings

AAMAS '04 Proceedings of the Third International Joint Conference on Autonomous Agents and Multiagent Systems - Volume 3
Towards Genetically Optimised Multi-Agent Multi-Issue Negotiations

HICSS '05 Proceedings of the Proceedings of the 38th Annual Hawaii International Conference on System Sciences (HICSS'05) - Track 1 - Volume 01
Multi-issue negotiation protocol for agents: exploring nonlinear utility spaces

IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we propose a threshold adjusting mechanismin complex negotiations among software agents. The mechanism reduces computational complexity to find agreements that produce higher social welfare. Multi-issue negotiation protocols have been studied widely and represent a promising field since most negotiation problems in the real world involve interdependent multiple issues. We have proposed negotiation protocols where a bidding-based mechanism is used to find social-welfare maximizing deals. The threshold adjusting mechanism proposed here reduces the number of candidate bids. The preliminary experimental results show that the threshold adjusting mechanism can reduce the computational cost while keeping enough optimality.