The complexity of deciding reachability properties of distributed negotiation schemes (Q924139): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: The computational complexity of propositional STRIPS planning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed fair allocation of indivisible goods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3994882 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5715692 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of contract negotiation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relations Among Complexity Measures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithm for optimal winner determination in combinatorial auctions / rank
 
Normal rank
Property / cites work
 
Property / cites work: BOB: Improved winner determination in combinatorial auctions and generalizations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relationships between nondeterministic and deterministic tape complexities / rank
 
Normal rank
Property / cites work
 
Property / cites work: The network complexity and the Turing machine complexity of finite functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: The effect of false-name bids in combinatorial auctions: new fraud in internet auctions. / rank
 
Normal rank

Latest revision as of 10:57, 28 June 2024

scientific article
Language Label Description Also known as
English
The complexity of deciding reachability properties of distributed negotiation schemes
scientific article

    Statements

    The complexity of deciding reachability properties of distributed negotiation schemes (English)
    0 references
    0 references
    0 references
    28 May 2008
    0 references
    0 references
    distributed negotiation
    0 references
    multiagent resource allocation
    0 references
    computational complexity
    0 references
    pspace-completeness
    0 references
    straight-line program
    0 references
    0 references