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
Journal of the ACM (JACM)
Selfish traffic allocation for server farms
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
The price of anarchy is independent of the network topology
STOC '02 Proceedings of the thiry-fourth 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 maximum latency of selfish routing
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
The complexity of pure Nash equilibria
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Computing Nash equilibria for scheduling on restricted parallel links
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Selfish load balancing and atomic congestion games
Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures
The Price of Stability for Network Design with Fair Cost Allocation
FOCS '04 Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science
The Price of Routing Unsplittable Flow
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
The Price of Routing Unsplittable Flow
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
ACM SIGACT News
The effect of collusion in congestion games
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Welfare maximization in congestion games
EC '06 Proceedings of the 7th ACM conference on Electronic commerce
Network design with weighted players
Proceedings of the eighteenth annual ACM symposium on Parallelism in algorithms and architectures
The price of anarchy for polynomial social cost
Theoretical Computer Science
Congestion games with load-dependent failures: identical resources
Proceedings of the 8th ACM conference on Electronic commerce
Taxes for linear atomic congestion games
ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
Convergence to approximate Nash equilibria in congestion games
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
The effectiveness of Stackelberg strategies and tolls for network congestion games
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Better bounds for online load balancing on unrelated machines
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Regret minimization and the price of total anarchy
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Graphical congestion games with linear latencies
Proceedings of the twentieth annual symposium on Parallelism in algorithms and architectures
Atomic congestion games among coalitions
ACM Transactions on Algorithms (TALG)
Fast convergence to nearly optimal solutions in potential games
Proceedings of the 9th ACM conference on Electronic commerce
Scheduling to maximize participation
Theoretical Computer Science
Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems - Volume 3
The impact of local policies on the quality of packet routing in paths, trees, and rings
Journal of Scheduling
A new model for selfish routing
Theoretical Computer Science
Computing Approximate Nash Equilibria in Network Congestion Games
SIROCCO '08 Proceedings of the 15th international colloquium on Structural Information and Communication Complexity
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
Congestion Games with Linearly Independent Paths: Convergence Time and Price of Anarchy
SAGT '08 Proceedings of the 1st International Symposium on Algorithmic Game Theory
Atomic Congestion Games: Fast, Myopic and Concurrent
SAGT '08 Proceedings of the 1st International Symposium on Algorithmic Game Theory
Improved equilibria via public service advertising
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Efficient coordination mechanisms for unrelated machine scheduling
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
WINE '08 Proceedings of the 4th International Workshop on Internet and Network Economics
Improving the Efficiency of Load Balancing Games through Taxes
WINE '08 Proceedings of the 4th International Workshop on Internet and Network Economics
Malicious Bayesian Congestion Games
Approximation and Online Algorithms
Stackelberg Strategies and Collusion in Network Games with Splittable Flow
Approximation and Online Algorithms
Intrinsic robustness of the price of anarchy
Proceedings of the forty-first annual ACM symposium on Theory of computing
Quality of routing congestion games in wireless sensor networks
Proceedings of the 4th Annual International Conference on Wireless Internet
The price of democracy in coalition formation
Proceedings of The 8th International Conference on Autonomous Agents and Multiagent Systems - Volume 1
Management of Variable Data Streams in Networks
Algorithmics of Large and Complex Networks
Theoretical Computer Science
Atomic routing games on maximum congestion
Theoretical Computer Science
Strong and Pareto Price of Anarchy in Congestion Games
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
Concurrent imitation dynamics in congestion games
Proceedings of the 28th ACM symposium on Principles of distributed computing
Mathematics of Operations Research
Graph Theory, Computational Intelligence and Thought
How hard is it to find extreme Nash equilibria in network congestion games?
Theoretical Computer Science
The Impact of Oligopolistic Competition in Networks
Operations Research
Games with Congestion-Averse Utilities
SAGT '09 Proceedings of the 2nd International Symposium on Algorithmic Game Theory
Performances of One-Round Walks in Linear Congestion Games
SAGT '09 Proceedings of the 2nd International Symposium on Algorithmic Game Theory
Good Programming in Transactional Memory
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
WINE '09 Proceedings of the 5th International Workshop on Internet and Network Economics
On Best Response Dynamics in Weighted Congestion Games with Polynomial Delays
WINE '09 Proceedings of the 5th International Workshop on Internet and Network Economics
Covering Games: Approximation through Non-cooperation
WINE '09 Proceedings of the 5th International Workshop on Internet and Network Economics
The Impact of Social Ignorance on Weighted Congestion Games
WINE '09 Proceedings of the 5th International Workshop on Internet and Network Economics
On the Inefficiency Ratio of Stable Equilibria in Congestion Games
WINE '09 Proceedings of the 5th International Workshop on Internet and Network Economics
Mediated Equilibria in Load-Balancing Games
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
The hardness of selective network design for bottleneck routing games
TAMC'07 Proceedings of the 4th international conference on Theory and applications of models of computation
Scheduling to maximize participation
TGC'06 Proceedings of the 2nd international conference on Trustworthy global computing
Nonadaptive selfish routing with online demands
CAAN'07 Proceedings of the 4th conference on Combinatorial and algorithmic aspects of networking
Evolutionary equilibrium in Bayesian routing games: specialization and niche formation
ESA'07 Proceedings of the 15th annual European conference on Algorithms
Stackelberg strategies for atomic congestion games
ESA'07 Proceedings of the 15th annual European conference on Algorithms
Mechanism design by creditability
COCOA'07 Proceedings of the 1st international conference on Combinatorial optimization and applications
Cost-balancing tolls for atomic network congestion games
WINE'07 Proceedings of the 3rd international conference on Internet and network economics
On the performance of congestion games for optimum satisfiability problems
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
Price of anarchy for cognitive MAC games
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
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)
On the existence of pure nash equilibria inweighted congestion games
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
Weighted congestion games: price of anarchy, universal worst-case examples, and tightness
ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part II
Computational game theory: an introduction
Algorithms and theory of computation handbook
The impact of altruism on the efficiency of atomic congestion games
TGC'10 Proceedings of the 5th international conference on Trustworthly global computing
Network uncertainty in selfish routing
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
Mixing time and stationary expected social welfare of logit dynamics
SAGT'10 Proceedings of the Third international conference on Algorithmic game theory
Bottleneck congestion games with logarithmic price of anarchy
SAGT'10 Proceedings of the Third international conference on Algorithmic game theory
On the inefficiency of equilibria in linear bottleneck congestion games
SAGT'10 Proceedings of the Third international conference on Algorithmic game theory
Reducing the maximum latency of selfish ring routing via pairwise cooperations
COCOA'10 Proceedings of the 4th international conference on Combinatorial optimization and applications - Volume Part II
Selfish Traffic Allocation for Server Farms
SIAM Journal on Computing
Routing (un-) splittable flow in games with player-specific affine latency functions
ACM Transactions on Algorithms (TALG)
Optimal cost sharing protocols for scheduling games
Proceedings of the 12th ACM conference on Electronic commerce
Inner product spaces for MinSum coordination mechanisms
Proceedings of the forty-third annual ACM symposium on Theory of computing
Good programming in transactional memory
Theoretical Computer Science
Congestion games with failures
Discrete Applied Mathematics
Social context congestion games
SIROCCO'11 Proceedings of the 18th international conference on Structural information and communication complexity
Efficiency of restricted tolls in non-atomic network routing games
SAGT'11 Proceedings of the 4th international conference on Algorithmic game theory
Exact Price of Anarchy for Polynomial Congestion Games
SIAM Journal on Computing
The equilibrium existence problem in finite network congestion games
WINE'06 Proceedings of the Second international conference on Internet and Network Economics
Price of anarchy for polynomial wardrop games
WINE'06 Proceedings of the Second international conference on Internet and Network Economics
Exact price of anarchy for polynomial congestion games
STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
Convergence and approximation in potential 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
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
The hardness of network design for unsplittable flow with selfish users
WAOA'05 Proceedings of the Third international conference on Approximation and Online Algorithms
Symmetry in network congestion games: pure equilibria and anarchy cost
WAOA'05 Proceedings of the Third international conference on Approximation and Online Algorithms
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
Local smoothness and the price of anarchy in atomic splittable congestion games
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
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
Network games with atomic players
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
Atomic congestion games among coalitions
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
On the price of stability for designing undirected networks with fair cost allocations
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
On the price of stability for undirected network design
WAOA'09 Proceedings of the 7th international conference on Approximation and Online Algorithms
WINE'11 Proceedings of the 7th international conference on Internet and Network Economics
The robust price of anarchy of altruistic games
WINE'11 Proceedings of the 7th international conference on Internet and Network Economics
Intrinsic robustness of the price of anarchy
Communications of the ACM
Convergence and approximation in potential games
Theoretical Computer Science
The price of anarchy in games of incomplete information
Proceedings of the 13th ACM Conference on Electronic Commerce
The speed of convergence in congestion games under best-response dynamics
ACM Transactions on Algorithms (TALG)
The equivalence of uniform and Shapley value-based cost allocations in a specific game
Operations Research Letters
Pairwise cooperations in selfish ring routing for minimax linear latency
Theoretical Computer Science
Stronger Bounds on Braess's Paradox and the Maximum Latency of Selfish Routing
SIAM Journal on Discrete Mathematics
The effectiveness of stackelberg strategies and tolls for network congestion games
ACM Transactions on Algorithms (TALG)
On the Existence of Pure Nash Equilibria in Weighted Congestion Games
Mathematics of Operations Research
Contention issues in congestion games
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part II
On bidimensional congestion games
SIROCCO'12 Proceedings of the 19th international conference on Structural Information and Communication Complexity
On the impact of fair best response dynamics
MFCS'12 Proceedings of the 37th international conference on Mathematical Foundations of Computer Science
On a noncooperative model for wavelength assignment in multifiber optical networks
IEEE/ACM Transactions on Networking (TON)
Probabilistic techniques in algorithmic game theory
SAGA'07 Proceedings of the 4th international conference on Stochastic Algorithms: foundations and applications
Strong price of anarchy for machine load balancing
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
Selfishness level of strategic games
SAGT'12 Proceedings of the 5th international conference on Algorithmic Game Theory
The price of anarchy for selfish ring routing is two
WINE'12 Proceedings of the 8th international conference on Internet and Network Economics
Risk sensitivity of price of anarchy under uncertainty
Proceedings of the fourteenth ACM conference on Electronic commerce
Non-monetary fair scheduling: a cooperative game theory approach
Proceedings of the twenty-fifth annual ACM symposium on Parallelism in algorithms and architectures
On a generalized Cournot oligopolistic competition game
Journal of Global Optimization
Price of stability in polynomial congestion games
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part II
Social context congestion games
Theoretical Computer Science
| Hi-index | 0.03 |
We consider the price of anarchy of pure Nash equilibria in congestion games with linear latency functions. For asymmetric games, the price of anarchy of maximum social cost is Θ(√N), where N is the number of players. For all other cases of symmetric or asymmetric games and for both maximum and average social cost, the price of anarchy is 5/2. We extend the results to latency functions that are polynomials of bounded degree. We also extend some of the results to mixed Nash equilibria.