Minimizing conflicts: a heuristic repair method for constraint satisfaction and scheduling problems
Artificial Intelligence - Special volume on constraint-based reasoning
Rules of encounter: designing conventions for automated negotiation among computers
Rules of encounter: designing conventions for automated negotiation among computers
Multiagent negotiation under time constraints
Artificial Intelligence
Comparative Models of the File Assignment Problem
ACM Computing Surveys (CSUR)
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Data Allocation in a Dynamically Reconfigurable Environment
Proceedings of the Fourth International Conference on Data Engineering
Anytime coordination for progressive planning agents
AAAI '99/IAAI '99 Proceedings of the sixteenth national conference on Artificial intelligence and the eleventh Innovative applications of artificial intelligence conference innovative applications of artificial intelligence
Negotiation as a mechanism for language evolution
Proceedings of the first international joint conference on Autonomous agents and multiagent systems: part 2
Automated negotiation and decision making in multiagent environments
Mutli-agents systems and applications
Automated Negotiation and Decision Making in Multiagent Environments
EASSS '01 Selected Tutorial Papers from the 9th ECCAI Advanced Course ACAI 2001 and Agent Link's 3rd European Agent Systems Summer School on Multi-Agent Systems and Applications
An Adaptive Agent Society for Environmental Scanning through the Internet
PRIMA 2001 Proceedings of the 4th Pacific Rim International Workshop on Multi-Agents, Intelligent Agents: Specification, Modeling, and Applications
Suitability assessment framework of agent-based software architectures
Information and Software Technology
Hi-index | 0.00 |
We propose a strategic negotiation model that takes into account the passage of time during the negotiation process itself in order to solve the problem of data allocation in environments with self-motivated servers which have no common interest and no central controller. The model considers situations characterized by complete, as well as incomplete, information. Using this negotiation mechanism, the servers have simple and stable negotiation strategies that result in efficient agreements without delays. We provide heuristics for finding the details of the strategies which depend on the specific settings of the environment, and demonstrate the quality of the heuristics, using simulations. We prove that our methods yield better results than the static allocation policy currently used for data allocation for servers in distributed systems.