A new approach to the maximum-flow problem
Journal of the ACM (JACM)
Approximation algorithms for scheduling unrelated parallel machines
Mathematical Programming: Series A and B
Network flows: theory, algorithms, and applications
Network flows: theory, algorithms, and applications
Beyond the flow decomposition barrier
Journal of the ACM (JACM)
Exact and Approximate Algorithms for Scheduling Nonidentical Processors
Journal of the ACM (JACM)
Algorithms, games, and the internet
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Tight bounds for worst-case equilibria
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Approximation Algorithms for Single-Source Unsplittable Flow
SIAM Journal on Computing
The Structure and Complexity of Nash Equilibria for a Selfish Routing Game
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Improved Approximation Algorithms for Unsplittable Flow Problems
FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
On the Single-Source Unsplittable Flow Problem
FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
Single-source unsplittable flow
FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
Nashification and the coordination ratio for a selfish routing game
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
The price of anarchy of finite congestion games
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Selfish routing with incomplete information
Proceedings of the seventeenth annual ACM symposium on Parallelism in algorithms and architectures
Algorithms for pure Nash equilibria in weighted congestion games
Journal of Experimental Algorithmics (JEA)
On the structure and complexity of worst-case equilibria
Theoretical Computer Science
A faster combinatorial approximation algorithm for scheduling unrelated parallel machines
Theoretical Computer Science
Taxes for linear atomic congestion games
ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
(Almost) optimal coordination mechanisms for unrelated machine scheduling
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Mixed Nash equilibria in selfish routing problems with dynamic constraints
Theoretical Computer Science
Graph classes and the complexity of the graph orientation minimizing the maximum weighted outdegree
CATS '08 Proceedings of the fourteenth symposium on Computing: the Australasian theory - Volume 77
A new model for selfish routing
Theoretical Computer Science
Nash equilibria in discrete routing games with convex latency functions
Journal of Computer and System Sciences
The Influence of Link Restrictions on (Random) Selfish Routing
SAGT '08 Proceedings of the 1st International Symposium on Algorithmic Game Theory
On the Road to $\mathcal{PLS}$-Completeness: 8 Agents in a Singleton Congestion Game
WINE '08 Proceedings of the 4th International Workshop on Internet and Network Economics
Worst-Case Nash Equilibria in Restricted Routing
WINE '08 Proceedings of the 4th International Workshop on Internet and Network Economics
Pure Nash equilibria in player-specific and weighted congestion games
Theoretical Computer Science
Coordination mechanisms for selfish scheduling
Theoretical Computer Science
Quality of routing congestion games in wireless sensor networks
Proceedings of the 4th Annual International Conference on Wireless Internet
The structure and complexity of Nash equilibria for a selfish routing game
Theoretical Computer Science
Atomic routing games on maximum congestion
Theoretical Computer Science
The price of stability in selfish scheduling games
Web Intelligence and Agent Systems
Non-clairvoyant Scheduling Games
SAGT '09 Proceedings of the 2nd International Symposium on Algorithmic Game Theory
Stability and Convergence in Selfish Scheduling with Altruistic Agents
WINE '09 Proceedings of the 5th International Workshop on Internet and Network Economics
Evolutionary equilibrium in Bayesian routing games: Specialization and niche formation
Theoretical Computer Science
Price of anarchy in parallel processing
Information Processing Letters
A unified approach to congestion games and two-sided markets
WINE'07 Proceedings of the 3rd international conference on Internet and network economics
Total latency in singleton congestion games
WINE'07 Proceedings of the 3rd international conference on Internet and network economics
Tradeoffs and Average-Case Equilibria in Selfish Routing
ACM Transactions on Computation Theory (TOCT)
Taxes for linear atomic congestion games
ACM Transactions on Algorithms (TALG)
Local search: simple, successful, but sometimes sluggish
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
On the packing of selfish items
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
Bottleneck congestion games with logarithmic price of anarchy
SAGT'10 Proceedings of the Third international conference on Algorithmic game theory
Graph classes and the complexity of the graph orientation minimizing the maximum weighted outdegree
Discrete Applied Mathematics
Pure nash equilibria in player-specific and weighted congestion games
WINE'06 Proceedings of the Second international conference on Internet and Network Economics
Scheduling unrelated parallel machines computational results
WEA'06 Proceedings of the 5th international conference on Experimental Algorithms
Exact price of anarchy for polynomial congestion games
STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
Atomic routing games on maximum congestion
AAIM'06 Proceedings of the Second international conference on Algorithmic Aspects in Information and Management
Nash equilibria, the price of anarchy and the fully mixed nash equilibrium conjecture
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
A faster combinatorial approximation algorithm for scheduling unrelated parallel machines
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
On the price of anarchy and stability of correlated equilibria of linear congestion games,,
ESA'05 Proceedings of the 13th annual European conference on Algorithms
Symmetry in network congestion games: pure equilibria and anarchy cost
WAOA'05 Proceedings of the Third international conference on Approximation and Online Algorithms
Coordination mechanisms for selfish scheduling
WINE'05 Proceedings of the First international conference on Internet and Network Economics
On the structure and complexity of worst-case equilibria
WINE'05 Proceedings of the First international conference on Internet and Network Economics
A simple graph-theoretic model for selfish restricted scheduling
WINE'05 Proceedings of the First international conference on Internet and Network Economics
SOFSEM'06 Proceedings of the 32nd conference on Current Trends in Theory and Practice of Computer Science
Multi-agent based selfish routing for multi-channel wireless mesh networks
PRIMA'06 Proceedings of the 9th Pacific Rim international conference on Agent Computing and Multi-Agent Systems
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
Tight bounds for selfish and greedy load balancing
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
Routing (un-) splittable flow in games with player-specific linear latency functions
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
Extending the notion of rationality of selfish agents: second order Nash equilibria
MFCS'07 Proceedings of the 32nd international conference on Mathematical Foundations of Computer Science
Congestion games with capacitated resources
SAGT'12 Proceedings of the 5th international conference on Algorithmic Game Theory
Coordination mechanism for selfish scheduling under a grade of service provision
Information Processing Letters
Inefficiency of Nash equilibria with parallel processing policy
Information Processing Letters
Hi-index | 0.01 |
We consider the problem of routing n users on m parallel links, under the restriction that each user may only be routed on a link from a certain set of allowed links for the user. Thus, the problem is equivalent to the correspondingly restricted problem of assigning n jobs to m parallel machines. In a pure Nash equilibrium, no user may improve its own individual cost (delay) by unilaterally switching to another link from its set of allowed links. As our main result, we introduce a polynomial time algorithm to compute from any given assignment a pure Nash equilibrium with non-increased makespan. The algorithm gradually changes a given assignment by pushing unsplittable user traffics through a network that is defined by the users and the links. Here, we use ideas from blocking flows. Furthermore, we use similar techniques as in the generic Preflow-Push algorithm to approximate a schedule with minimum makespan, gaining an improved approximation factor of 2 - 1/w1 for identical links, where w1 is the largest user traffic. We extend this result to related links, gaining an approximation factor of 2. Our approximation algorithms run in polynomial time. We close with tight upper bounds on the coordination ratio for pure Nash equilibria.