The polynomial hierarchy and a simple model for competitive analysis (Q3716806): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Relativizations of the $\mathcal{P} = ?\mathcal{NP}$ Question / rank
 
Normal rank
Property / cites work
 
Property / cites work: On two-level optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of theorem-proving procedures / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Representation and Economic Interpretation of a Two-Level Programming Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4182257 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3050157 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Games against nature / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5573961 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4070959 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stackelberg-Nash-Cournot Equilibria: Characterizations and Computations / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Multiple Leader Stackelberg Model and Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5560258 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The polynomial-time hierarchy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5603731 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complete sets and the polynomial-time hierarchy / rank
 
Normal rank

Revision as of 12:32, 17 June 2024

scientific article
Language Label Description Also known as
English
The polynomial hierarchy and a simple model for competitive analysis
scientific article

    Statements

    The polynomial hierarchy and a simple model for competitive analysis (English)
    0 references
    1985
    0 references
    NP-completeness
    0 references
    computational complexity
    0 references
    Stackelberg strategies
    0 references
    multi- level linear programs
    0 references
    sequenced-move games
    0 references
    polynomial hierarchy
    0 references
    0 references

    Identifiers