Coordination of Distributed Problem Solvers
Coordination of Distributed Problem Solvers
A framework for problem-solving in a distributed processing environment.
A framework for problem-solving in a distributed processing environment.
Coordinating Learning Agents via Utility Assignment
IDEAL '02 Proceedings of the Third International Conference on Intelligent Data Engineering and Automated Learning
Making Rational Decisions in N-by-N Negotiation Games with a Trusted Third Party
PRIMA '99 Proceedings of the Second Pacific Rim International Workshop on Multi-Agents: Approaches to Intelligent Agents
Industrial deployment of multi-agent technologies: review and selected case studies
Autonomous Agents and Multi-Agent Systems
Bargaining Power in Electronic Negotiations: A Bilateral Negotiation Mechanism
EC-Web '08 Proceedings of the 9th international conference on E-Commerce and Web Technologies
Computational Logic in Multi-Agent Systems
Methods for task allocation via agent coalition formation
Artificial Intelligence
Secure agent-mediated auctionlike negotiation protocol for internet retail commerce
CIA'99 Proceedings of the 3rd international conference on Cooperative information agents III
Arbitration and matchmaking for agents with conflicting interests
CIA'99 Proceedings of the 3rd international conference on Cooperative information agents III
Agent-oriented programming: from prolog to guarded definite clauses
Agent-oriented programming: from prolog to guarded definite clauses
AAAI'90 Proceedings of the eighth National conference on Artificial intelligence - Volume 1
Negotiation and conflict resolution in non-cooperative domains
AAAI'90 Proceedings of the eighth National conference on Artificial intelligence - Volume 1
The utility of communication in coordinating intelligent agents
AAAI'91 Proceedings of the ninth National conference on Artificial intelligence - Volume 1
A fast first-cut protocol for agent coordination
AAAI'93 Proceedings of the eleventh national conference on Artificial intelligence
An empirical study of interest-based negotiation
Autonomous Agents and Multi-Agent Systems
ISSADS'05 Proceedings of the 5th international conference on Advanced Distributed Systems
A trust/honesty model in multiagent semi-competitive environments
PRIMA'04 Proceedings of the 7th Pacific Rim international conference on Intelligent Agents and Multi-Agent Systems
Multiagent systems, and the search for appropriate foundations
Proceedings of the 2013 international conference on Autonomous agents and multi-agent systems
Journal of Global Optimization
| Hi-index | 0.00 |
Research in Distributed Artificial Intelligence is concerned with how automated agents can be designed to interact effectively. One important capability that could aid inter-agent cooperation would be that of negotiation: agents could be built that are able to communicate their respective desires and compromise to reach mutually beneficial agreements. This work uses the language of game theory to analyze negotiation among automated agents in cooperative domains. However, while game theory generally deals with negotiation in continuous domains and among agents with full information, this research considers discrete domains and the case where agents have only partial information, assumptions of greater interest for artificial intelligence. A novel, stable, negotiation protocol is introduced for the case of agents who are able to share a discrete set of tasks with one another. The case of agents who may lie to one another during the negotiation, either by hiding some of their tasks or by creating fictitious tasks, is analyzed; it is shown that under some conditions lies are beneficial and "safe," i.e., undiscoverable, while under other circumstances, lies can never be safe.