Computational Complexity, Fairness, and the Price of Anarchy of the Maximum Latency Problem
Year of publication: |
2004-03-05
|
---|---|
Authors: | Correa, Jose R. ; Schulz, Andreas S. ; Stier Moses, Nicolas E. |
Institutions: | Sloan School of Management, Massachusetts Institute of Technology (MIT) |
Subject: | System Optimum | User Equilibrium | Selfish Routing | Price of Anarchy | Approximation Algorithms | Multicriteria Optimization | Multicommodity Flows |
-
Selfish Routing in Capacitated Networks
Correa, Jose R., (2003)
-
Efficiency of Atomic Splittable Selfish Routing with Polynomial Cost Functions
Yang, Hai, (2008)
-
Price of anarchy for non-atomic congestion games with stochastic demands
Wang, Chenlan, (2014)
- More ...
-
Selfish Routing in Capacitated Networks
Correa, Jose R., (2003)
-
Approximate Local Search in Combinatorial Optimization
Orlin, James B., (2003)
-
Scheduling to Minimize Average Completion Time Revisited: Deterministic On-line Algorithms
Megow, Nicole, (2004)
- More ...