Satisfying user preferences while negotiating meetings
International Journal of Human-Computer Studies - Special issue: group support systems
Software agents
Multiagent Systems: A Modern Approach to Distributed Artificial Intelligence
Multiagent Systems: A Modern Approach to Distributed Artificial Intelligence
Multi-Agent Systems: An Introduction to Distributed Artificial Intelligence
Multi-Agent Systems: An Introduction to Distributed Artificial Intelligence
Encyclopedia of Artificial Intelligence
Encyclopedia of Artificial Intelligence
Programming and Deploying Java Mobile Agents Aglets
Programming and Deploying Java Mobile Agents Aglets
Developing an Automated Distributed Meeting Scheduler
IEEE Expert: Intelligent Systems and Their Applications
The Contract Net Protocol: High-Level Communication and Control in a Distributed Problem Solver
IEEE Transactions on Computers
Plan, Commit, Execute Protocol in Multi-agent Systems
HoloMAS '09 Proceedings of the 4th International Conference on Industrial Applications of Holonic and Multi-Agent Systems: Holonic and Multi-Agent Systems for Manufacturing
| Hi-index | 0.00 |
This paper presents an algorithm called Nstar (N*) that performs optimizing agent-based negotiation. N* borrows concepts from branch-and-bound and A* optimal search algorithms. The N* negotiation algorithm can be used for a general class of negotiation problems that requires consensus among two or more collaborating agents. N* schedules events through a negotiation protocol that mimics a process of proposing and counter proposing. It makes use of an evaluation function that represents an underestimation of the "global" preference for a particular proposal. This preference is computed based on a user preference model. An optimal solution is found when there is a compromise and the evaluation function is maximized.