On the Complexity of Equilibria Problems in Angel-Daemon Games (Q3511310): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Mathematical Foundations of Computer Science 2005 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms and Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4321931 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4289646 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fault Tolerant Implementation / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of succinct zero-sum games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5715720 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4843270 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5844986 / rank
 
Normal rank
Property / cites work
 
Property / cites work: When selfish meets evil / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic Game Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3576736 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4298260 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Computational Complexity of Nash Equilibria in Concisely Represented Games / rank
 
Normal rank

Latest revision as of 13:12, 28 June 2024

scientific article
Language Label Description Also known as
English
On the Complexity of Equilibria Problems in Angel-Daemon Games
scientific article

    Statements

    On the Complexity of Equilibria Problems in Angel-Daemon Games (English)
    0 references
    0 references
    0 references
    0 references
    10 July 2008
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references