The following pages link to How bad is selfish routing? (Q3196642):
Displaying 50 items.
- A survey on networking games in telecommunications (Q2567161) (← links)
- A paradox in optimal flow control of \(M/M/n\) queues (Q2567166) (← links)
- A mathematical model for the TCP tragedy of the commons (Q2570124) (← links)
- Linear tolls suffice: new bounds and algorithms for tolls in single source networks (Q2581266) (← links)
- Selfish unsplittable flows (Q2581267) (← links)
- Nonlinear day-to-day traffic dynamics with driver experience delay: modeling, stability and bifurcation analysis (Q2630999) (← links)
- Worst-case Nash equilibria in restricted routing (Q2637289) (← links)
- Social interactions and the prophylaxis of SI epidemics on networks (Q2656375) (← links)
- Minimizing the total travel time with limited unfairness in traffic networks (Q2664349) (← links)
- On tightness of the Tsaknakis-Spirakis algorithm for approximate Nash equilibrium (Q2670913) (← links)
- Modifying link capacity to avoid Braess paradox considering elastic demand (Q2675881) (← links)
- The price of anarchy as a classifier for mechanism design in a Pareto-Bayesian-Nash context (Q2698591) (← links)
- Signalling and obfuscation for congestion control (Q2799244) (← links)
- Network Topologies for Weakly Pareto Optimal Nonatomic Selfish Routing (Q2817846) (← links)
- Efficiency of Equilibria in Uniform Matroid Congestion Games (Q2819451) (← links)
- On the Price of Anarchy of Highly Congested Nonatomic Network Games (Q2819452) (← links)
- Dynamic Resource Allocation Games (Q2819456) (← links)
- Computing (and Life) Is All about Tradeoffs (Q2848971) (← links)
- An overview on game theory applications to engineering (Q2852569) (← links)
- A mean-risk model for the traffic assignment problem with stochastic travel times (Q2875605) (← links)
- Computing approximate Nash equilibria in network congestion games (Q2913950) (← links)
- The Cost of Free Spectrum (Q2957452) (← links)
- Optimal Cost-Sharing in General Resource Selection Games (Q2957453) (← links)
- <i>r</i>-extreme signalling for congestion control (Q2979529) (← links)
- Restoring Pure Equilibria to Weighted Congestion Games (Q3012946) (← links)
- Collusion in Atomic Splittable Routing Games (Q3012948) (← links)
- Braess's Paradox in large random graphs (Q3061184) (← links)
- Network Games with Quantum Strategies (Q3064327) (← links)
- Self-Interested Routing in Queueing Networks (Q3114915) (← links)
- Braess's paradox in expanders (Q3145837) (← links)
- Bottleneck Congestion Games with Logarithmic Price of Anarchy (Q3162521) (← links)
- Price competition with elastic traffic (Q3184599) (← links)
- Fast, Fair, and Efficient Flows in Networks (Q3392070) (← links)
- Tight Bounds for Cost-Sharing in Weighted Congestion Games (Q3449511) (← links)
- Further Results on Capacitated Network Design Games (Q3449582) (← links)
- Excluding Braess’s Paradox in Nonatomic Selfish Routing (Q3449597) (← links)
- The Price of Matching with Metric Preferences (Q3452808) (← links)
- Dynamics of a 2D Piecewise Linear Braess Paradox Model: Effect of the Third Partition (Q3457734) (← links)
- Computing Approximate Nash Equilibria in Network Congestion Games (Q3511400) (← links)
- Distributed Learning of Wardrop Equilibria (Q3543331) (← links)
- Malicious Bayesian Congestion Games (Q3602834) (← links)
- Stackelberg Strategies and Collusion in Network Games with Splittable Flow (Q3602835) (← links)
- Scheduling to Maximize Participation (Q3608460) (← links)
- A Survey of Uniqueness Results for Selfish Routing (Q3614959) (← links)
- Traffic Networks and Flows over Time (Q3637317) (← links)
- Management of Variable Data Streams in Networks (Q3637322) (← links)
- Models of Non-atomic Congestion Games – From Unicast to Multicast Routing (Q3637323) (← links)
- A bin packing game with cardinality constraints under the best cost rule (Q4634294) (← links)
- (Q4828932) (← links)
- Price of anarchy for Mean Field Games (Q4967881) (← links)
