The complexity of deciding reachability properties of distributed negotiation schemes (Q924139)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The complexity of deciding reachability properties of distributed negotiation schemes |
scientific article; zbMATH DE number 5279828
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The complexity of deciding reachability properties of distributed negotiation schemes |
scientific article; zbMATH DE number 5279828 |
Statements
The complexity of deciding reachability properties of distributed negotiation schemes (English)
0 references
28 May 2008
0 references
distributed negotiation
0 references
multiagent resource allocation
0 references
computational complexity
0 references
pspace-completeness
0 references
straight-line program
0 references
