\(\mathcal{NP}\)-hardness of pure Nash equilibrium in scheduling and network design games (Q390917): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: The Price of Stability for Network Design with Fair Cost Allocation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3002793 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3579396 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Network design with weighted players / rank
 
Normal rank
Property / cites work
 
Property / cites work: Designing Network Protocols for Good Equilibria / rank
 
Normal rank
Property / cites work
 
Property / cites work: Non-clairvoyant scheduling games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inner product spaces for MinSum coordination mechanisms / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Complexity of Pure-Strategy Nash Equilibria in Congestion and Local-Effect Games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nash Equilibria in Voronoi Games on Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convergence time to Nash equilibrium in load balancing / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of pure Nash equilibria / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Complexity of Pareto-optimal Nash and Strong Equilibria / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coordination mechanisms for selfish scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Potential games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Non-cooperative games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic Game Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: A class of games possessing pure-strategy Nash equilibria / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3549719 / rank
 
Normal rank

Latest revision as of 05:35, 7 July 2024

scientific article
Language Label Description Also known as
English
\(\mathcal{NP}\)-hardness of pure Nash equilibrium in scheduling and network design games
scientific article

    Statements

    \(\mathcal{NP}\)-hardness of pure Nash equilibrium in scheduling and network design games (English)
    0 references
    0 references
    9 January 2014
    0 references
    pure Nash equilibria
    0 references
    \(\mathcal{NP}\)-hardness
    0 references
    scheduling games
    0 references
    network design games
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references