International Journal of Game Theory
Congestion avoidance and control
SIGCOMM '88 Symposium proceedings on Communications architectures and protocols
When Trees Collide: An Approximation Algorithm for theGeneralized Steiner Problem on Networks
SIAM Journal on Computing
A General Approximation Technique for Constrained Forest Problems
SIAM Journal on Computing
On-line algorithms for Steiner tree problems (extended abstract)
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
On-line generalized Steiner problem
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
Optimization flow control—I: basic algorithm and convergence
IEEE/ACM Transactions on Networking (TON)
Applications of approximation algorithms to cooperative games
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Approximation algorithms
Stable internet routing without global coordination
IEEE/ACM Transactions on Networking (TON)
The stable paths problem and interdomain routing
IEEE/ACM Transactions on Networking (TON)
Lectures on Discrete Geometry
Simultaneous optimization for concave costs: single sink aggregation or single source buy-at-bulk
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Improved Results for Stackelberg Scheduling Strategies
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Pricing network edges for heterogeneous selfish users
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Stackelberg Scheduling Strategies
SIAM Journal on Computing
Boosted sampling: approximation algorithms for stochastic optimization
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
Universal approximations for TSP, Steiner tree, and set cover
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
The price of selfish behavior in bilateral network formation
Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
Sink Equilibria and Convergence
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Simple cost sharing schemes for multicommodity rent-or-buy and stochastic Steiner tree
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
On the topologies formed by selfish peers
Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing
Approximation via cost sharing: Simpler and better approximation algorithms for network design
Journal of the ACM (JACM)
Sharing the cost more efficiently: Improved approximation for multicommodity rent-or-buy
ACM Transactions on Algorithms (TALG)
The effectiveness of Stackelberg strategies and tolls for network congestion games
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
The complexity of game dynamics: BGP oscillations, sink equilibria, and beyond
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
A Group-Strategyproof Cost Sharing Mechanism for the Steiner Forest Game
SIAM Journal on Computing
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Online multicast with egalitarian cost sharing
Proceedings of the twentieth annual symposium on Parallelism in algorithms and architectures
Non-preemptive Coordination Mechanisms for Identical Machine Scheduling Games
SIROCCO '08 Proceedings of the 15th international colloquium on Structural Information and Communication Complexity
Coordination mechanisms for selfish scheduling
Theoretical Computer Science
Network Design with Weighted Players
Theory of Computing Systems - Special Issue: Symposium on Parallelism in Algorithms and Architectures 2006; Guest Editors: Robert Kleinberg and Christian Scheideler
Theoretical Computer Science
Efficiency of Scalar-Parameterized Mechanisms
Operations Research
The Price of Stability for Network Design with Fair Cost Allocation
SIAM Journal on Computing
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
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
Non-Cooperative Multicast and Facility Location Games
IEEE Journal on Selected Areas in Communications
| Hi-index | 0.00 |
Designing and deploying a network protocol determines the rules by which end users interact with each other and with the network. We consider the problem of designing a protocol to optimize the equilibrium behavior of a network with selfish users. We consider network cost-sharing games, where the set of Nash equilibria depends fundamentally on the choice of an edge cost-sharing protocol. Previous research focused on the Shapley protocol, in which the cost of each edge is shared equally among its users. We systematically study the design of optimal cost-sharing protocols for undirected and directed graphs, single-sink and multicommodity networks, and different measures of the inefficiency of equilibria. Our primary technical tool is a precise characterization of the cost-sharing protocols that induce only network games with pure-strategy Nash equilibria. We use this characterization to prove, among other results, that the Shapley protocol is optimal in directed graphs and that simple priority protocols are essentially optimal in undirected graphs.