A formal analysis of interest-based negotiation

DOI10.1007/s10472-009-9145-6zbMath1186.68477OpenAlexW2059176050WikidataQ57406200 ScholiaQ57406200MaRDI QIDQ1039587

Liz Sonenberg, Iyad Rahwan, Philippe Pasquier, F. P. M. Dignum

Publication date: 23 November 2009

Published in: Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/21.11116/0000-0002-D3E7-B

zbMATH Keywords

multi-agent systems

Mathematics Subject Classification ID

Agent technology and artificial intelligence (68T42)

Related Items (3)

Syntactic reasoning with conditional probabilities in deductive argumentation ⋮ On bipolarity in argumentation frameworks ⋮ Where logic and agents meet

Cites Work

• Unnamed Item
• The complexity of deciding reachability properties of distributed negotiation schemes
• Negotiating using rewards
• Reaching agreements through argumentation: a logical model and implementation
• A reasoning model based on the production of acceptable arguments
• The complexity of contract negotiation
• The Logical Handling of Threats, Rewards, Tips, and Warnings
• Agents that reason and negotiate by arguing
• The IFF proof procedure for abductive logic programming
• Argumentation in Multi-Agent Systems
• A General Framework for Argumentation-Based Negotiation
• On the Benefits of Exploiting Hierarchical Goals in Bilateral Automated Negotiation
• Handling threats, rewards, and explanatory arguments in a unified setting
• Constraint proposal method for computing Pareto solutions in multi-party negotiations

This page was built for publication: A formal analysis of interest-based negotiation