The complexity of contract negotiation

DOI10.1016/j.artint.2005.01.006zbMath1132.68539OpenAlexW2023522391MaRDI QIDQ2457671

Michael R. Laurence, Paul E. Dunne, Michael Wooldridge

Publication date: 23 October 2007

Published in: Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.artint.2005.01.006

zbMATH Keywords

computational complexitymultiagent systemsnegotiation

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Learning and adaptive systems in artificial intelligence (68T05)

Related Items (10)

Minimising inequality in multiagent resource allocation: structural analysis of a distributed approach ⋮ Maximizing Nash product social welfare in allocating indivisible goods ⋮ Distributed fair allocation of indivisible goods ⋮ Postulates for revising BDI structures ⋮ The price to pay for forgoing normalization in fair division of indivisible goods ⋮ A survey of approximability and inapproximability results for social welfare optimization in multiagent resource allocation ⋮ The complexity of deciding reachability properties of distributed negotiation schemes ⋮ Solving coalitional resource games ⋮ Multiagent resource allocation in \(k\)-additive domains: preference representation and complexity ⋮ A formal analysis of interest-based negotiation

Cites Work

• A Boolean function requiring 3n network size
• The network complexity and the Turing machine complexity of finite functions
• Complexity-theoretic models of phase transitions in search problems
• Bounds to Complexities of Networks for Sorting and for Switching
• Relations Among Complexity Measures
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The complexity of contract negotiation