Algorithms, games, and the internet
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Journal of the ACM (JACM)
Tight bounds for worst-case equilibria
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Algorithms for Rational Agents
SOFSEM '00 Proceedings of the 27th Conference on Current Trends in Theory and Practice of Informatics
Proceedings of the 4th ACM conference on Electronic commerce
Pricing network edges for heterogeneous selfish users
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Designing Networks for Selfish Users is Hard
FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
The complexity of pure Nash equilibria
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Edge Pricing of Multicommodity Networks for Heterogeneous Selfish Users
FOCS '04 Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science
Tolls for Heterogeneous Selfish Users in Multicommodity Networks and Generalized Congestion Games
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
The price of anarchy of finite congestion games
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
How much can taxes help selfish routing?
Journal of Computer and System Sciences - Special issue on network algorithms 2005
Settling the Complexity of Two-Player Nash Equilibrium
FOCS '06 Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science
(Almost) optimal coordination mechanisms for unrelated machine scheduling
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Non-preemptive Coordination Mechanisms for Identical Machine Scheduling Games
SIROCCO '08 Proceedings of the 15th international colloquium on Structural Information and Communication Complexity
Efficient coordination mechanisms for unrelated machine scheduling
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
New Approximation Bounds for Lpt Scheduling
Algorithmica
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
Exact price of anarchy for polynomial congestion games
STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
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
Coordination mechanisms for selfish scheduling
WINE'05 Proceedings of the First international conference on Internet and Network Economics
Truthful algorithms for scheduling selfish tasks on parallel machines
WINE'05 Proceedings of the First international conference on Internet and Network Economics
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
The efficiency of optimal taxes
CAAN'04 Proceedings of the First international conference on Combinatorial and Algorithmic Aspects of Networking
Architecting noncooperative networks
IEEE Journal on Selected Areas in Communications
Scheduling selfish tasks: about the performance of truthful algorithms
COCOON'07 Proceedings of the 13th annual international conference on Computing and Combinatorics
Stability and Convergence in Selfish Scheduling with Altruistic Agents
WINE '09 Proceedings of the 5th International Workshop on Internet and Network Economics
Tradeoffs and Average-Case Equilibria in Selfish Routing
ACM Transactions on Computation Theory (TOCT)
Designing Network Protocols for Good Equilibria
SIAM Journal on Computing
Inner product spaces for MinSum coordination mechanisms
Proceedings of the forty-third annual ACM symposium on Theory of computing
Improving the price of anarchy for selfish routing via coordination mechanisms
ESA'11 Proceedings of the 19th European conference on Algorithms
The price of optimum in a matching game
SAGT'11 Proceedings of the 4th international conference on Algorithmic game theory
A Stackelberg strategy for routing flow over time
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
The price of anarchy for minsum related machine scheduling
WAOA'11 Proceedings of the 9th international conference on Approximation and Online Algorithms
Enforcing efficient equilibria in network design games via subsidies
Proceedings of the twenty-fourth annual ACM symposium on Parallelism in algorithms and architectures
Contention issues in congestion games
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part II
Future Generation Computer Systems
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
Coordination mechanisms from (almost) all scheduling policies
Proceedings of the 5th conference on Innovations in theoretical computer science
| Hi-index | 5.23 |
We introduce the notion of coordination mechanisms to improve the performance in systems with independent selfish and non-colluding agents. The quality of a coordination mechanism is measured by its price of anarchy-the worst-case performance of a Nash equilibrium over the (centrally controlled) social optimum. We give upper and lower bounds for the price of anarchy for selfish task allocation and congestion games.