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

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Importer (talk | contribs)
Changed an Item
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 91A10 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 91A43 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68Q17 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6243794 / rank
 
Normal rank
Property / zbMATH Keywords
 
pure Nash equilibria
Property / zbMATH Keywords: pure Nash equilibria / rank
 
Normal rank
Property / zbMATH Keywords
 
\(\mathcal{NP}\)-hardness
Property / zbMATH Keywords: \(\mathcal{NP}\)-hardness / rank
 
Normal rank
Property / zbMATH Keywords
 
scheduling games
Property / zbMATH Keywords: scheduling games / rank
 
Normal rank
Property / zbMATH Keywords
 
network design games
Property / zbMATH Keywords: network design games / rank
 
Normal rank

Revision as of 15:04, 29 June 2023

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