Achieving network optima using Stackelberg routing strategies
IEEE/ACM Transactions on Networking (TON)
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
A game theoretic framework for bandwidth allocation and pricing in broadband networks
IEEE/ACM Transactions on Networking (TON)
Stackelberg scheduling strategies
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
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 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 Results for Stackelberg Scheduling Strategies
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Incentives for Sharing in Peer-to-Peer Networks
WELCOM '01 Proceedings of the Second International Workshop on Electronic Commerce
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
The designer's perspective to noncooperative networks
INFOCOM '95 Proceedings of the Fourteenth Annual Joint Conference of the IEEE Computer and Communication Societies (Vol. 2)-Volume - Volume 2
Designing Networks for Selfish Users is Hard
FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
Game Theory and Mathematical Economics: A Theoratical Computer Scientist's Introduction
FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
A stronger bound on Braess's Paradox
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
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
Hi-index | 0.00 |
In large scale networks users often behave selfishly trying to minimize their routing cost. Modelling this as a noncooperative game, may yield a Nash equilibrium with unboundedly poor network performance. To measure this inefficacy, the Coordination Ratio or Price of Anarchy (PoA) was introduced. It equals the ratio of the cost induced by the worst Nash equilibrium, to the corresponding one induced by the overall optimum assignment of the jobs to the network. On improving the PoA of a given network, a series of papers model this selfish behavior as a Stackelberg or Leader-Followers game. We consider random tuples of machines, with either linear or M/M/1 latency functions, and PoA at least a tuning parameterc. We validate a variant (NLS) of the Largest Latency First (LLF) Leader's strategy on tuples with PoA ≥ c. NLS experimentally improves on LLF for systems with inherently high PoA, where the Leader is constrained to control low portion α of jobs. This suggests even better performance for systems with arbitrary PoA. Also, we bounded experimentally the least Leader's portion α0 needed to induce optimum cost. Unexpectedly, as parameter c increases the corresponding α0 decreases, for M/M/1 latency functions. All these are implemented in an extensive Matlab toolbox.