The complexity of contract negotiation

DOI10.1016/j.artint.2005.01.006zbMath1132.68539MaRDI 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 complexity; multiagent systems; negotiation

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

68T05: Learning and adaptive systems in artificial intelligence

Related Items

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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