Interest based negotiation automation

Authors:
Xuehong Tao;Yuan Miao;ZhiQi Shen;ChunYan Miao;Nicola Yelland
Affiliations:
School of Education, Victoria University, Melbourne, VIC, Australia;School of Computer Science and Mathematics, Victoria University, Melbourne, VIC, Australia;Information Communication Institute of Singapore, Nanyang Technological University, Singapore;School of Computer Engineering, Nanyang Technological University, Singapore;School of Education, Victoria University, Melbourne, VIC, Australia
Venue:
ICIC'06 Proceedings of the 2006 international conference on Computational Intelligence and Bioinformatics - Volume Part III
Year:
2006

Citing 7
Cited 0

On the complexity of propositional knowledge base revision, updates, and counterfactuals

Artificial Intelligence
A Machine-Oriented Logic Based on the Resolution Principle

Journal of the ACM (JACM)
An automated negotiation mechanism based on co-evolution and game theory

Proceedings of the 2002 ACM symposium on Applied computing
Optimal length tree-like resolution refutations for 2SAT formulas

ACM Transactions on Computational Logic (TOCL)
Automated Multi-Attribute Negotiation with Efficient Use of Incomplete Preference Information

AAMAS '04 Proceedings of the Third International Joint Conference on Autonomous Agents and Multiagent Systems - Volume 3
Argumentation-based negotiation

The Knowledge Engineering Review
Argument-based negotiation in a social context

Proceedings of the fourth international joint conference on Autonomous agents and multiagent systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

The negotiation in general sense, as one of the most fundamental and powerful interaction of human beings, represents the dynamic process of exchanging information and perspectives towards mutual understanding and agreements. Interest based negotiation allows negotiators to discuss the concerns behind the negotiation issues so that a mutually acceptable win-win solution is more likely to be reached. This paper, for the first time, proposes a computational model for interest based negotiation automation which enables the automation of the fundamental elements of negotiation. Based on the model, algorithms are designated to automate the fundamental elements with practical computational complexity. This model provides not only a theoretical foundation for software agent based negotiation automation, but also a practical approach.