Selfish Unsplittable Flows
- 1 January 2004
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
Abstract
No abstract availableKeywords
This publication has 18 references indexed in Scilit:
- The complexity of pure Nash equilibriaPublished by Association for Computing Machinery (ACM) ,2004
- Convergence Time to Nash EquilibriaLecture Notes in Computer Science, 2003
- Nashification and the Coordination Ratio for a Selfish Routing GameLecture Notes in Computer Science, 2003
- Extreme Nash EquilibriaLecture Notes in Computer Science, 2003
- The Structure and Complexity of Nash Equilibria for a Selfish Routing GameLecture Notes in Computer Science, 2002
- Selfish traffic allocation for server farmsPublished by Association for Computing Machinery (ACM) ,2002
- Worst-Case EquilibriaLecture Notes in Computer Science, 1999
- A Polynomial Approximation Scheme for Scheduling on Uniform Processors: Using the Dual Approximation ApproachSIAM Journal on Computing, 1988
- Probability Inequalities for Sums of Bounded Random VariablesJournal of the American Statistical Association, 1963
- Duality in quadratic programmingQuarterly of Applied Mathematics, 1960