The complexity of deciding reachability properties of distributed negotiation schemes

DOI10.1016/j.tcs.2008.01.031zbMath1147.91018OpenAlexW2137839355MaRDI QIDQ924139

Paul E. Dunne, Yann Chevaleyre

Publication date: 28 May 2008

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2008.01.031

zbMATH Keywords

computational complexitymultiagent resource allocationstraight-line programdistributed negotiationpspace-completeness

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Auctions, bargaining, bidding and selling, and other market models (91B26)

Related Items (1)

A formal analysis of interest-based negotiation

Cites Work

• Distributed fair allocation of indivisible goods
• BOB: Improved winner determination in combinatorial auctions and generalizations
• The network complexity and the Turing machine complexity of finite functions
• The computational complexity of propositional STRIPS planning
• The effect of false-name bids in combinatorial auctions: new fraud in internet auctions.
• The complexity of contract negotiation
• Relationships between nondeterministic and deterministic tape complexities
• Relations Among Complexity Measures
• Algorithm for optimal winner determination in combinatorial auctions
• Unnamed Item
• Unnamed Item

This page was built for publication: The complexity of deciding reachability properties of distributed negotiation schemes