Price of anarchy and an approximation algorithm for the binary-preference capacitated selfish replication game (Q503156): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: On the impact of combinatorial structure on congestion games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tight Bounds for Selfish and Greedy Load Balancing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Selfish caching in distributed systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Selfish Routing in Capacitated Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: A decomposition theorem for partially ordered sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of pure Nash equilibria / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cache Me If You Can: Capacitated Selfish Replication Games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Network formation and social coordination / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficiency loss in a network resource allocation game: the case of elastic supply / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3409969 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Congestion games with player-specific payoff functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Dual of Dilworth's Decomposition Theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Potential games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic Game Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Game Theoretic Approach for Efficient Graph Coloring / rank
 
Normal rank

Latest revision as of 07:28, 13 July 2024

scientific article
Language Label Description Also known as
English
Price of anarchy and an approximation algorithm for the binary-preference capacitated selfish replication game
scientific article

    Statements

    Price of anarchy and an approximation algorithm for the binary-preference capacitated selfish replication game (English)
    0 references
    0 references
    0 references
    0 references
    11 January 2017
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    capacitated selfish replication game
    0 references
    pure Nash equilibrium (NE)
    0 references
    potential function
    0 references
    quasi-polynomial algorithm
    0 references
    price of anarchy
    0 references
    optimal allocation
    0 references
    0 references