Pure Nash equilibria in graphical games and treewidth (Q2343086): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: A sufficiently fast algorithm for finding close to optimal clique trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: On problems without polynomial kernels / rank
 
Normal rank
Property / cites work
 
Property / cites work: A $c^k n$ 5-Approximation Algorithm for Treewidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Settling the complexity of computing two-player Nash equilibria / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Computing a Nash Equilibrium / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mixed searching and proper-path-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4633883 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fundamentals of parameterized complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5715720 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Single Parameter FPT-Algorithms for Non-trivial Games / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of some colorful problems parameterized by treewidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the parameterized complexity of multiple-interval graph problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parametrized complexity theory. / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of constrained Nash equilibria in graphical games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized two-player Nash equilibrium / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of \(k\)-SAT / rank
 
Normal rank
Property / cites work
 
Property / cites work: Which problems have strongly exponential complexity? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Action-graph games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Disjoint homotopic paths and trees in a planar graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4967164 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5365080 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3002818 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5710169 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing correlated equilibria in multi-player games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. II. Algorithmic aspects of tree-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Incremental Satisfiability and Implication for UTVPI Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Treewidth and Pure Nash Equilibria / rank
 
Normal rank

Latest revision as of 00:34, 10 July 2024

scientific article
Language Label Description Also known as
English
Pure Nash equilibria in graphical games and treewidth
scientific article

    Statements

    Pure Nash equilibria in graphical games and treewidth (English)
    0 references
    0 references
    0 references
    0 references
    4 May 2015
    0 references
    Nash equilibria
    0 references
    graphical games
    0 references
    parameterized complexity
    0 references
    treewidth
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers