Decision theory: an introduction to the mathematics of rationality
Decision theory: an introduction to the mathematics of rationality
Introduction to operations research, 4th ed.
Introduction to operations research, 4th ed.
Resolving adversarial conflicts: an approach integration case-based and analytic methods
Resolving adversarial conflicts: an approach integration case-based and analytic methods
Data allocation in distributed database systems
ACM Transactions on Database Systems (TODS)
Multistage negotiation in distributed planning
Distributed Artificial Intelligence
Negotiating task decomposition and allocation using partial global planning
Distributed artificial intelligence: vol. 2
Social conceptions of knowledge and action: DAI foundations and open systems semantics
Artificial Intelligence
Minimizing conflicts: a heuristic repair method for constraint satisfaction and scheduling problems
Artificial Intelligence - Special volume on constraint-based reasoning
Progressive negotiation for resolving conflicts among distributed heterogeneous cooperating agents
AAAI '94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 1)
In search of the best constraint satisfaction search
AAAI '94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 1)
Rules of encounter: designing conventions for automated negotiation among computers
Rules of encounter: designing conventions for automated negotiation among computers
Agent theories, architectures, and languages: a survey
ECAI-94 Proceedings of the workshop on agent theories, architectures, and languages on Intelligent agents
Multiagent negotiation under time constraints
Artificial Intelligence
An overview of distributed artificial intelligence
Foundations of distributed artificial intelligence
Deriving consensus in multiagent systems
Artificial Intelligence
Satisfying user preferences while negotiating meetings
International Journal of Human-Computer Studies - Special issue: group support systems
Comparative Models of the File Assignment Problem
ACM Computing Surveys (CSUR)
Genetic Algorithms in Search, Optimization and Machine Learning
Genetic Algorithms in Search, Optimization and Machine Learning
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Allocating Data and Operations to Nodes in Distributed Database Design
IEEE Transactions on Knowledge and Data Engineering
Data Allocation in a Dynamically Reconfigurable Environment
Proceedings of the Fourth International Conference on Data Engineering
A Service-Oriented Negotiation Model between Autonomous Agents
Proceedings of the 8th European Workshop on Modelling Autonomous Agents in a Multi-Agent World: Multi-Agent Rationality
Bidding Mechanisms for Data Allocation in Multi-Agent Environments
ATAL '97 Proceedings of the 4th International Workshop on Intelligent Agents IV, Agent Theories, Architectures, and Languages
Benefits of learning in negotiation
AAAI'97/IAAI'97 Proceedings of the fourteenth national conference on artificial intelligence and ninth conference on Innovative applications of artificial intelligence
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
A Classification Structure for Automated Negotiations
WI-IATW '06 Proceedings of the 2006 IEEE/WIC/ACM international conference on Web Intelligence and Intelligent Agent Technology
Using AI and games for decision support in command and control
Decision Support Systems
| Hi-index | 0.00 |
In this paper, we consider the problem of data allocation in environments of self-motivated servers, where information servers respond to queries from users. New data items arrive frequently and have to be allocated in the distributed system. The servers have no common interests, and each server is concerned with the exact location of each of the data items. There is also no central controller. We suggest using a negotiation framework which takes into account the passage of time during the negotiation process itself. 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 which cannot be provided to the agents in advance. We demonstrate the quality of the heuristics, using simulations. We consider situations characterized by complete, as well as incomplete, information and prove that our methods yield better results than the static allocation policy currently used for data allocation for servers in distributed systems.