Pairwise cooperations in selfish ring routing for minimax linear latency (Q443709): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Strong price of anarchy / rank
 
Normal rank
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: Path decomposition under a new cost measure with applications to optical network design / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3254691 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Price of Routing Unsplittable Flow / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multicuts and integral multiflows in rings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stability vs. optimality in selfish ring routing / rank
 
Normal rank
Property / cites work
 
Property / cites work: The price of atomic selfish ring routing / rank
 
Normal rank
Property / cites work
 
Property / cites work: The price of anarchy of finite congestion games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Worst-case equilibria / 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: Algorithms, games, and the internet / 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: The price of anarchy is independent of the network topology / rank
 
Normal rank
Property / cites work
 
Property / cites work: How bad is selfish routing? / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Ring Loading Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear time algorithms for the ring loading problem with demand splitting / rank
 
Normal rank

Revision as of 12:51, 5 July 2024

scientific article
Language Label Description Also known as
English
Pairwise cooperations in selfish ring routing for minimax linear latency
scientific article

    Statements

    Pairwise cooperations in selfish ring routing for minimax linear latency (English)
    0 references
    0 references
    0 references
    0 references
    13 August 2012
    0 references
    selfish routing
    0 references
    linear latency
    0 references
    Nash equilibrium
    0 references
    price of anarchy
    0 references
    pairwise stability
    0 references

    Identifiers