Stackelberg strategies for atomic congestion games (Q987387): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Created claim: DBLP publication ID (P1635): journals/mst/Fotakis10a, #quickstatements; #temporary_batch_1731483406851
 
(2 intermediate revisions by 2 users not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s00224-008-9152-8 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1965228255 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact Price of Anarchy for Polynomial Congestion Games / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Price of Routing Unsplittable Flow / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum cost flow algorithms for series-parallel networks / 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: The price of anarchy of finite congestion games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Selfish Routing in Capacitated Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automata, Languages and Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automata, Languages and Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: The price of optimum in Stackelberg games on arbitrary single commodity networks and latency functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stackelberg strategies for selfish routing in general multicommodity networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3409969 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4737207 / rank
 
Normal rank
Property / cites work
 
Property / cites work: STACS 2004 / 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: Stackelberg Scheduling Strategies / rank
 
Normal rank
Property / cites work
 
Property / cites work: Selfish load balancing and atomic congestion games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2934708 / rank
 
Normal rank
Property / DBLP publication ID
 
Property / DBLP publication ID: journals/mst/Fotakis10a / rank
 
Normal rank

Latest revision as of 08:48, 13 November 2024

scientific article
Language Label Description Also known as
English
Stackelberg strategies for atomic congestion games
scientific article

    Statements

    Stackelberg strategies for atomic congestion games (English)
    0 references
    0 references
    13 August 2010
    0 references
    congestion games
    0 references
    Stackelberg routing
    0 references
    price of anarchy
    0 references

    Identifiers