On complexity as bounded rationality (extended abstract)
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Randomized algorithms
Expected Length of the Longest Probe Sequence in Hash Code Searching
Journal of the ACM (JACM)
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
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
Journal of the ACM (JACM)
Lower bounds & competitive algorithms for online scheduling of unit-size tasks to related machines
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
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
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
Playing large games using simple strategies
Proceedings of the 4th ACM conference on Electronic commerce
Near-optimal network design with selfish agents
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
The price of anarchy is independent of the network topology
Journal of Computer and System Sciences - STOC 2002
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
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
Coordination mechanisms for congestion games
ACM SIGACT News
The Price of Routing Unsplittable Flow
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
The price of anarchy of finite congestion games
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Fast convergence of selfish rerouting
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
The price of selfish behavior in bilateral network formation
Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
A network pricing game for selfish traffic
Proceedings of the twenty-fourth 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
On nash equilibria for a network creation game
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Distributed selfish load balancing
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
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
Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing
Proceedings of the eighteenth annual ACM symposium on Parallelism in algorithms and architectures
On the severity of Braess's paradox: designing networks for selfish users is hard
Journal of Computer and System Sciences - Special issue on FOCS 2001
Tradeoffs in worst-case equilibria
Theoretical Computer Science - Approximation and online algorithms
Utilitarian resource assignment
Journal of Discrete Algorithms
The price of anarchy for polynomial social cost
Theoretical Computer Science
On the structure and complexity of worst-case equilibria
Theoretical Computer Science
Strong equilibrium in cost sharing connection games
Proceedings of the 8th ACM conference on Electronic commerce
Convergence time to Nash equilibrium in load balancing
ACM Transactions on Algorithms (TALG)
Taxes for linear atomic congestion games
ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
The price of anarchy in network creation games
Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Routing selfish unsplittable traffic
ACM Transactions on Algorithms (TALG)
(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
Impact of Asynchrony on the Behavior of Rational Selfish Agents
Fundamenta Informaticae
Selfishness, collusion and power of local search for the ADMs minimization problem
Computer Networks: The International Journal of Computer and Telecommunications Networking
Regret minimization and the price of total anarchy
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
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
Non-preemptive Coordination Mechanisms for Identical Machine Scheduling Games
SIROCCO '08 Proceedings of the 15th international colloquium on Structural Information and Communication Complexity
Computers & Mathematics with Applications
The Influence of Link Restrictions on (Random) Selfish Routing
SAGT '08 Proceedings of the 1st International Symposium on Algorithmic Game Theory
Approximate Strong Equilibrium in Job Scheduling Games
SAGT '08 Proceedings of the 1st International Symposium on Algorithmic Game Theory
Subjective vs. Objective Reality -- The Risk of Running Late
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
Theoretical Computer Science
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
Conflicting Congestion Effects in Resource Allocation Games
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
WINE '08 Proceedings of the 4th International Workshop on Internet and Network Economics
Coordination mechanisms for selfish scheduling
Theoretical Computer Science
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
Proceedings of the 10th ACM conference on Electronic commerce
Theoretical Computer Science
Load balancing without regret in the bulletin board model
Proceedings of the 28th ACM symposium on Principles of distributed computing
On the complexity of constrained Nash equilibria in graphical games
Theoretical Computer Science
Efficiency of Scalar-Parameterized Mechanisms
Operations Research
Journal of Artificial Intelligence Research
How hard is it to find extreme Nash equilibria in network congestion games?
Theoretical Computer Science
The price of stability in selfish scheduling games
Web Intelligence and Agent Systems
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
Non-clairvoyant Scheduling Games
SAGT '09 Proceedings of the 2nd International Symposium on Algorithmic Game Theory
Theoretical Computer Science
Evolutionary equilibrium in Bayesian routing games: Specialization and niche formation
Theoretical Computer Science
Approximate strong equilibrium in job scheduling games
Journal of Artificial Intelligence Research
Price of anarchy in parallel processing
Information Processing Letters
Convergence time to Nash equilibria
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Nashification and the coordination ratio for a selfish routing game
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
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
Tradeoffs and average-case equilibria in selfish routing
ESA'07 Proceedings of the 15th annual European conference on Algorithms
On the performance of congestion games for optimum satisfiability problems
WINE'07 Proceedings of the 3rd international conference on Internet and network economics
Selfishness, collusion and power of local search for the ADMs minimization problem
WINE'07 Proceedings of the 3rd international conference on Internet and network economics
Priority based load balancing in a self-interested P2P network
DBISP2P'05/06 Proceedings of the 2005/2006 international conference on Databases, information systems, and peer-to-peer computing
Computational game theory: an introduction
Algorithms and theory of computation handbook
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
The price of anarchy in cooperative network creation games
ACM SIGecom Exchanges
Inner product spaces for MinSum coordination mechanisms
Proceedings of the forty-third annual ACM symposium on Theory of computing
Dynamic inefficiency: anarchy without stability
SAGT'11 Proceedings of the 4th international conference on Algorithmic game theory
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
The contribution of game theory to complex systems
PCI'05 Proceedings of the 10th Panhellenic conference on Advances in Informatics
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
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
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
Price of anarchy of network routing games with incomplete information
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
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
Atomic congestion games among coalitions
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
Congestion games, load balancing, and price of anarchy
CAAN'04 Proceedings of the First international conference on Combinatorial and Algorithmic Aspects of Networking
The price of anarchy in network creation games
ACM Transactions on Algorithms (TALG)
Experimental results for stackelberg scheduling strategies
WEA'05 Proceedings of the 4th international conference on Experimental and Efficient Algorithms
Uncoordinated load balancing and congestion games in p2p systems
IPTPS'04 Proceedings of the Third international conference on Peer-to-Peer Systems
Efficiency analysis of load balancing games with and without activation costs
Journal of Scheduling
Computer Science Review
Game-theoretic analysis of Internet switching with selfish users
Theoretical Computer Science
Conflicting Congestion Effects in Resource Allocation Games
Operations Research
Impact of Asynchrony on the Behavior of Rational Selfish Agents
Fundamenta Informaticae
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
Strong price of anarchy for machine load balancing
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
Inefficiency of Nash equilibria with parallel processing policy
Information Processing Letters
ACM Transactions on Economics and Computation
| Hi-index | 0.01 |
The coordination ratio is a game theoretic measure that aims to reflect the price of selfish routing in a network. We show the worst-case coordination ratio on m parallel links (of possibly different speeds) isΘ(log m/log log log m)Our bound is asymptotically tight and it entirely resolves an question posed recently by Koutsoupias and Papadimitriou [3].