Collusion in atomic splittable routing games (Q2392243): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q3056948 / 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: On the Value of Coordination in Network Design / rank
 
Normal rank
Property / cites work
 
Property / cites work: Competitive routing in networks with polynomial costs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2934597 / 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: Q4633887 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Price of Collusion in Series-Parallel Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4398864 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stackelberg Routing in Arbitrary Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Technical Note—Traffic Equilibrium Paradoxes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strong and Pareto Price of Anarchy in Congestion Games / 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: On the performance of approximate equilibria in congestion games / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Impact of Oligopolistic Competition in Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Selfish Routing in Capacitated Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Topology of series-parallel networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strong Price of Anarchy for Machine Load Balancing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear tolls suffice: new bounds and algorithms for tolls in single source networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4737150 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation and Online Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Selfish unsplittable flows / rank
 
Normal rank
Property / cites work
 
Property / cites work: Atomic congestion games among coalitions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Faster Algorithms for Minimum Cycle Basis in Directed Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stackelberg strategies and collusion in network games with splittable flow / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing Pure Nash and Strong Equilibria in Bottleneck Congestion Games / rank
 
Normal rank
Property / cites work
 
Property / cites work: The effect of collusion in congestion games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3409969 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stronger Bounds on Braess's Paradox and the Maximum Latency of Selfish Routing / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polynomial algorithm for minimum quadratic cost flow problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5491447 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Existence and Uniqueness of Equilibrium Points for Concave N-Person Games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stackelberg Scheduling Strategies / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5501360 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the severity of Braess's paradox: designing networks for selfish users is hard / rank
 
Normal rank
Property / cites work
 
Property / cites work: Intrinsic robustness of the price of anarchy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5365041 / rank
 
Normal rank
Property / cites work
 
Property / cites work: How bad is selfish routing? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2934708 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Braess's Paradox in large random graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coalitions in Nonatomic Network Congestion Games / rank
 
Normal rank

Latest revision as of 17:33, 6 July 2024

scientific article
Language Label Description Also known as
English
Collusion in atomic splittable routing games
scientific article

    Statements

    Collusion in atomic splittable routing games (English)
    0 references
    0 references
    1 August 2013
    0 references
    0 references
    selfish routing
    0 references
    collusion
    0 references
    social cost
    0 references
    Nash equilibria
    0 references
    exact algorithms
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references