ACM SIGCOMM Computer Communication Review
Achieving network optima using Stackelberg routing strategies
IEEE/ACM Transactions on Networking (TON)
Virtual path control for ATM networks with call level quality of service guarantees
IEEE/ACM Transactions on Networking (TON)
Routing Virtual Circuits with Temporal QoS Requirements in Virtual Path-Based ATM Networks
IEEE Transactions on Computers
Dynamic Capacity Resizing of Virtual Backbone Networks
ICN '01 Proceedings of the First International Conference on Networking-Part 1
Atomic Resource Sharing in Noncooperative Networks
INFOCOM '97 Proceedings of the INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution
On the expected payment of mechanisms for task allocation
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
Beyond VCG: Frugality of Truthful Mechanisms
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
Distributed Multiple Access Control for the Wireless Mesh Personal Area Networks
IEICE - Transactions on Information and Systems
The role of the manager in a noncooperative network
INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 3
Virtual path control for ATM networks with call level quality of service guarantees
INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 1
DIDA: a Distributed, Dynamic and Adaptive VP bandwidth management scheme for ATM networks
Computer Communications
Optimal and near-optimal mechanism design with interdependent values
Proceedings of the fourteenth ACM conference on Electronic commerce
| Hi-index | 0.00 |
Considers a multi-user network that is shared by noncooperative users. Each user sets up virtual paths that optimize its own, selfish, performance measure. This measure accounts for both the guaranteed call level quality of service, as well as for the cost incurred for reserving the resource. The interaction between the user strategies is formalized as a game. The authors show that this game has a unique Nash equilibrium, and that it possesses a certain fairness property. They investigate the dynamics of this game, and prove convergence to the Nash equilibrium of both a Gauss-Seidel scheme and a Jacobi scheme. They extend their study to various general network topologies.