Price of anarchy for highly congested routing games in parallel networks (Q1733382): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s00224-017-9834-1 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2782168685 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5186236 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3992980 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Selfish Routing in Capacitated Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast, Fair, and Efficient Flows in Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: A geometric approach to the price of anarchy in nonatomic congestion games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5633348 / 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: Sensitivity of Wardrop equilibria / rank
 
Normal rank
Property / cites work
 
Property / cites work: The price of anarchy in large games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3409969 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a theorem of Schmeidler / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generic Uniqueness of Equilibrium in Large Crowding Games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Social optimality and cooperation in nonatomic congestion games. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms, games, and the internet / 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: Q3524727 / rank
 
Normal rank
Property / cites work
 
Property / cites work: How bad is selfish routing? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounding the inefficiency of equilibria in nonatomic congestion games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3524726 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Equilibrium points of nonatomic games / rank
 
Normal rank

Latest revision as of 21:04, 18 July 2024

scientific article
Language Label Description Also known as
English
Price of anarchy for highly congested routing games in parallel networks
scientific article

    Statements

    Price of anarchy for highly congested routing games in parallel networks (English)
    0 references
    0 references
    0 references
    21 March 2019
    0 references
    0 references
    nonatomic routing games
    0 references
    price of anarchy
    0 references
    regularly varying functions
    0 references
    wardrop equilibrium
    0 references
    parallel networks
    0 references
    high congestion
    0 references
    0 references