Telecommunication networks: protocols, modeling and analysis
Telecommunication networks: protocols, modeling and analysis
Analysis and simulation of a fair queueing algorithm
SIGCOMM '89 Symposium proceedings on Communications architectures & protocols
Linear programming and network flows (2nd ed.)
Linear programming and network flows (2nd ed.)
An extension to Norton's equivalent
Queueing Systems: Theory and Applications
Optimal decentralized flow control of Markovian queueing networks with multiple controllers
Performance Evaluation
IEEE/ACM Transactions on Networking (TON)
Competitive routing in multiuser communication networks
IEEE/ACM Transactions on Networking (TON)
Achieving network optima using Stackelberg routing strategies
IEEE/ACM Transactions on Networking (TON)
Congestion resulting from increased capacity in single-server queueing networks
IEEE/ACM Transactions on Networking (TON)
Virtual path bandwidth allocation in multiuser networks
IEEE/ACM Transactions on Networking (TON)
Proceedings of the first international conference on Information and computation economies
The designer's perspective to atomic noncooperative networks
IEEE/ACM Transactions on Networking (TON)
A game-theoretic formulation of multi-agent resource allocation
AGENTS '00 Proceedings of the fourth international conference on Autonomous agents
Competitive analysis of incentive compatible on-line auctions
Proceedings of the 2nd ACM conference on Electronic commerce
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Negotiation and Equilibria in User Competition for Resources: A Dynamic Plot Approach
Computational & Mathematical Organization Theory
Dynamic service sharing with heterogeneous preferences
Queueing Systems: Theory and Applications
IEEE/ACM Transactions on Networking (TON)
Mobile Agent Distribution in a Game-Theoretic Approach
MATA '02 Proceedings of the 4th International Workshop on Mobile Agents for Telecommunication Applications
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
Stability vs optimality tradeoff in game theoretic mechanisms for QoS provision
Proceedings of the 2003 ACM symposium on Applied computing
Competitive analysis of incentive compatible on-line auctions
Theoretical Computer Science
On the expected payment of mechanisms for task allocation
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
Network QoS games: stability vs optimality tradeoff
Journal of Computer and System Sciences
A decision-theoretic approach to reliable message delivery
Distributed Computing
An analytic modelling approach for network routing algorithms that use "ant-like" mobile agents
Computer Networks: The International Journal of Computer and Telecommunications Networking
A survey on networking games in telecommunications
Computers and Operations Research
A paradox in optimal flow control of M/M/n queues
Computers and Operations Research
Non-cooperative games for service differentiation in CDMA systems
Mobile Networks and Applications
Utility based service differentiation in CDMA data networks
Wireless Networks
Multievent Crisis Management Using Noncooperative Multistep Games
IEEE Transactions on Computers
Mixed Nash equilibria in selfish routing problems with dynamic constraints
Theoretical Computer Science
On Satisfiability Games and the Power of Congestion Games
AAIM '07 Proceedings of the 3rd international conference on Algorithmic Aspects in Information and Management
An analytic modelling approach for network routing algorithms that use "ant-like" mobile agents
Computer Networks: The International Journal of Computer and Telecommunications Networking
A survey on networking games in telecommunications
Computers and Operations Research
A paradox in optimal flow control of M/M/n queues
Computers and Operations Research
Convergence time to Nash equilibria
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
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
A game theoretic formulation of the service provisioning problem in cloud systems
Proceedings of the 20th international conference on World wide web
Game-Theoretic analysis of internet switching with selfish users
WINE'05 Proceedings of the First international conference on Internet and Network Economics
Computer Science Review
Game-theoretic analysis of Internet switching with selfish users
Theoretical Computer Science
A Cooperative Differential Game Model for Multiuser Rate-Based Flow Control
Wireless Personal Communications: An International Journal
Hi-index | 0.01 |
The existence of Nash equilibria in noncooperative flow control in a general product-form network shared by K users is investigated. The performance objective of each user is to maximize its average throughput subject to an upper bound on its average time-delay. Previous attempts to study existence of equilibria for this flow control model were not successful, partly because the time-delay constraints couple the strategy spaces of the individual users in a way that does not allow the application of standard equilibrium existence theorems from the game theory literature. To overcome this difficulty, a more general approach to study the existence of Nash equilibria for decentralized control schemes is introduced. This approach is based on directly proving the existence of a fixed point of the best reply correspondence of the underlying game. For the investigated flow control model, the best reply correspondence is shown to be a function, implicitly defined by means of K interdependent linear programs. Employing an appropriate definition for continuity of the set of optimal solutions of parameterized linear programs, it is shown that, under appropriate conditions, the best reply function is continuous. Brouwer's theorem implies, then, that the best reply function has a fixed point.