Fast, Fair, and Efficient Flows in Networks

DOI10.1287/OPRE.1070.0383MaRDI QIDQ3392070zbMATH OpenOpenAlexWikidataFDO

Authors José R. Correa, Andreas S. Schulz, N. E. Stier-Moses

Publication date 13 August 2009

Published in Operations Research (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/f2d6ee0f08c07d4e9c4788c6f64a10415171540d

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Programming involving graphs or networks (90C35)

Recommendations

• Integer Programming and Combinatorial Optimization
• scientific article; zbMATH DE number 2119661
• Tradeoffs and average-case equilibria in selfish routing
• How bad is selfish routing?
• The price of selfish routing

Cited in

(34)

• Price of anarchy for highly congested routing games in parallel networks
• Price of anarchy in a linear-state stochastic dynamic game
• A trade-off between average and maximum arc congestion minimization in traffic assignment with user constraints
• Constraint games for stable and optimal allocation of demands in SDN
• System optimal routing of traffic flows with user constraints using linear programming
• Maximum flow under proportional delay constraint
• Stability vs. optimality in selfish ring routing
• A geometric approach to the price of anarchy in nonatomic congestion games
• Efficient and fair routing for mesh networks
• On the price of anarchy of highly congested nonatomic network games
• Fairness in resource allocation: foundation and applications
• Doing good with spam is hard
• scientific article; zbMATH DE number 3982887 (Why is no real title available?)
• Price of anarchy for supply chains with partial positive externalities
• scientific article; zbMATH DE number 2090007 (Why is no real title available?)
• Dynamic Atomic Congestion Games with Seasonal Flows
• Value of information in Bayesian routing games
• Dynamic fair resource division
• Price of Anarchy in Networks with Heterogeneous Latency Functions
• When is selfish routing bad? The price of anarchy in light and heavy traffic
• Why Locally-Fair Maximal Flows in Client-Server Networks Perform Well
• Bottleneck links, variable demand, and the tragedy of the commons
• Integer Programming and Combinatorial Optimization
• Fair Integral Network Flows
• The price of anarchy in routing games as a function of the demand
• On the performance of approximate equilibria in congestion games
• Congestion games with failures
• Why locally-fair maximal flows in client-server networks perform well
• On the inefficiency of atomic splittable routing games over parallel links
• Fair interventions in weighted congestion games
• Towards a fair path flow distribution in a transportation network
• The price of atomic selfish ring routing
• Bottleneck flows in unit capacity networks
• A note on a parameter relating traffic equilibria and system optimal routing

This page was built for publication: Fast, Fair, and Efficient Flows in Networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3392070)