Improving local search heuristics for some scheduling problems. Part II
Discrete Applied Mathematics - Special issue on models and algorithms for planning and scheduling problems
Algorithmic mechanism design (extended abstract)
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Sharing the cost of muliticast transmissions (preliminary version)
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Applications of approximation algorithms to cooperative games
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
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
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
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
Algorithms for selfish agents mechanism design for distributed computation
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
Architecting noncooperative networks
IEEE Journal on Selected Areas in Communications
Computing equilibria for congestion games with (im)perfect information
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Computing Nash equilibria for scheduling on restricted parallel links
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
How to route and tax selfish unsplittable traffic
Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures
Bounds for the convergence rate of randomized local search in a multiplayer load-balancing game
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
Selfish routing with incomplete information
Proceedings of the seventeenth annual ACM symposium on Parallelism in algorithms and architectures
Theoretical Computer Science - Automata, languages and programming: Algorithms and complexity (ICALP-A 2004)
Structure and complexity of extreme Nash equilibria
Theoretical Computer Science - Game theory meets theoretical computer science
Computing equilibria for a service provider game with (Im)perfect information
ACM Transactions on Algorithms (TALG)
Algorithms for pure Nash equilibria in weighted congestion games
Journal of Experimental Algorithmics (JEA)
Utilitarian resource assignment
Journal of Discrete Algorithms
The price of anarchy for polynomial social cost
Theoretical Computer Science
Convergence time to Nash equilibrium in load balancing
ACM Transactions on Algorithms (TALG)
Routing selfish unsplittable traffic
ACM Transactions on Algorithms (TALG)
Atomic congestion games among coalitions
ACM Transactions on Algorithms (TALG)
The Price of Anarchy on Uniformly Related Machines Revisited
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
WINE '08 Proceedings of the 4th International Workshop on Internet and Network Economics
Distributed algorithms for QoS load balancing
Proceedings of the twenty-first annual symposium on Parallelism in algorithms and architectures
How hard is it to find extreme Nash equilibria in network congestion games?
Theoretical Computer Science
How to find Nash equilibria with extreme total latency in network congestion games?
GameNets'09 Proceedings of the First ICST international conference on Game Theory for Networks
Maximizing the Minimum Load: The Cost of Selfishness
WINE '09 Proceedings of the 5th International Workshop on Internet and Network Economics
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
Scheduling to maximize participation
TGC'06 Proceedings of the 2nd international conference on Trustworthy global computing
Tradeoffs and average-case equilibria in selfish routing
ESA'07 Proceedings of the 15th annual European conference on Algorithms
Load balancing via random local search in closed and open systems
Proceedings of the ACM SIGMETRICS international conference on Measurement and modeling of computer systems
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
Network uncertainty in selfish routing
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
Journal of Combinatorial Optimization
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 simple graph-theoretic model for selfish restricted scheduling
WINE'05 Proceedings of the First international conference on Internet and Network Economics
Game-Theoretic analysis of internet switching with selfish users
WINE'05 Proceedings of the First international conference on Internet and Network Economics
Atomic selfish routing in networks: a survey
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
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
Distributed selfish load balancing on networks
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Atomic congestion games among coalitions
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
The price of anarchy on uniformly related machines revisited
Information and Computation
Distributed selfish load balancing with weights and speeds
PODC '12 Proceedings of the 2012 ACM symposium on Principles of distributed computing
Game-theoretic analysis of Internet switching with selfish users
Theoretical Computer Science
Load balancing via random local search in closed and open systems
Queueing Systems: Theory and Applications
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
Learning equilibria of games via payoff queries
Proceedings of the fourteenth ACM conference on Electronic commerce
Approximate strong equilibria in job scheduling games with two uniformly related machines
Discrete Applied Mathematics
Altruism in Atomic Congestion Games
ACM Transactions on Economics and Computation
Theoretical Computer Science
The cost of selfishness for maximizing the minimum load on uniformly related machines
Journal of Combinatorial Optimization
Hi-index | 0.00 |
We study the problem of n users selfishly routing traffic through a network consisting of m parallel related links. Users route their traffic by choosing private probability distributions over the links with the aim of minimizing their private latency. In such an environment Nash equilibria represent stable states of the system: no user can improve its private latency by unilaterally changing its strategy. Nashification is the problem of converting any given non-equilibrium routing into a Nash equilibrium without increasing the social cost. Our first result is an O(nm2) time algorithm for Nashification. This algorithm can be used in combination with any approximation algorithm for the routing problem to compute a Nash equilibrium of the same quality. In particular, this approach yields a PTAS for the computation of a best Nash equilibrium. Furthermore, we prove a lower bound of Ω(2√n) and an upper bound of O(2n) for the number of greedy selfish steps for identical link capacities in the worst case. In the second part of the paper we introduce a new structural parameter which allows us to slightly improve the upper bound on the coordination ratio for pure Nash equilibria in [3]. The new bound holds for the individual coordination ratio and is asymptotically tight. Additionally, we prove that the known upper bound of 1+√4m-3/2 on the coordination ratio for pure Nash equilibria also holds for the individual coordination ratio in case of mixed Nash equilibria, and we determine the range of m for which this bound is tight.