On the computational complexity of qualitative coalitional games (Q814613): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.artint.2004.04.002 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2029608926 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4003461 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph-Based Algorithms for Boolean Function Manipulation / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Boolean Hierarchy and the Polynomial Hierarchy: A Closer Connection / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3994882 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relations Among Complexity Measures / rank
 
Normal rank
Property / cites work
 
Property / cites work: More on non-cooperation in dialogue logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4385525 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Polynomial Time Hierarchy Collapses If the Boolean Hierarchy Collapses / rank
 
Normal rank
Property / cites work
 
Property / cites work: Method of determining lower bounds for the complexity of \(\Pi\)-circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3249579 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4305608 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3576736 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3221403 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of facets (and some facets of complexity) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2756787 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Modal Logic for Coalitional Power in Games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3924096 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds on monotone complexity of the logical permanent / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coalition structure generation with worst case guarantees / 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: Methods for task allocation via agent coalition formation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3198912 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complete sets and the polynomial-time hierarchy / rank
 
Normal rank

Latest revision as of 10:02, 24 June 2024

scientific article
Language Label Description Also known as
English
On the computational complexity of qualitative coalitional games
scientific article

    Statements

    On the computational complexity of qualitative coalitional games (English)
    0 references
    0 references
    0 references
    7 February 2006
    0 references
    Multiagent systems
    0 references
    Coalitional games
    0 references
    Computational complexity
    0 references

    Identifiers