Machine intelligence 14
Power, dependence and stability in multiagent plans
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
Bargaining theory with applications
Bargaining theory with applications
Weak, strong, and strong cyclic planning via symbolic model checking
Artificial Intelligence - special issue on planning with uncertainty and incomplete information
Extending Classical Planning to the Multi-agent Case: A Game-Theoretic Approach
ECSQARU '07 Proceedings of the 9th European Conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty
Reasoning about bargaining situations
AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 1
Observation reduction for strong plans
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
A formalization of equilibria for multiagent planning
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Negotiation using logic programming with consistency restoring rules
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Structured plans and observation reduction for plans with contexts
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Hi-index | 0.00 |
This paper studies the problem of multi-agent planning in the environment where agents may need to cooperate in order to achieve their individual goals but they do so only if the cooperation is beneficial to each of them. We assume that each agent has a reward function and a cost function that determines the agent's utility over all possible plans. The agents negotiate to form a joint plan through a procedure of alternating offers of joint plans and side-payments. We propose an algorithm that generates an agreement for any given planning problem and show that this agreement maximizes the gross utility and minimizes the distance to the ideal utility point.