Capacity allocation under noncooperative routing
From MaRDI portal
Publication:3129377
DOI10.1109/9.557575zbMath0872.90035OpenAlexW2147368141MaRDI QIDQ3129377
Yannis A. Korilis, Aurel A. Lazar, Ariel Orda
Publication date: 27 April 1997
Published in: IEEE Transactions on Automatic Control (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/929279405ee6f315d156953ecf5c0ac3cb559fa4
Noncooperative games (91A10) Communication networks in operations research (90B18) Applications of game theory (91A80) Transportation, logistics and supply chain management (90B06)
Related Items (23)
Worst-case analysis of non-cooperative load balancing ⋮ NASH EQUILIBRIA IN LOAD BALANCING IN DISTRIBUTED COMPUTER SYSTEMS ⋮ Uniqueness of equilibria in atomic splittable polymatroid congestion games ⋮ A game-theoretic analysis of bandwidth allocation under a user-grouping constraint ⋮ Equilibrium computation in resource allocation games ⋮ PERFORMANCE OF NON-COOPERATIVE ROUTING OVER PARALLEL NON-OBSERVABLE QUEUES ⋮ Capacitated network design games ⋮ Cooperative networks games with elastic demands ⋮ Game-theoretic static load balancing for distributed systems ⋮ Decentralized bandwidth control subject to two-layer constraints ⋮ Equilibrium routing strategies in data transmission networks ⋮ A flow and routing control policy for communication networks with multiple competitive users ⋮ The problem of capacity addition in multi-user elastic demand communication networks ⋮ Routing and dynamic resource assignment joint game: a non-cooperative model for QoS routing ⋮ Existence and uniqueness of the Nash equilibrium in the non-cooperative QoS routing ⋮ On the severity of Braess's paradox: designing networks for selfish users is hard ⋮ Braess's Paradox in large random graphs ⋮ The price of anarchy is independent of the network topology ⋮ A Survey of Uniqueness Results for Selfish Routing ⋮ A Stackelberg strategy for routing flow over time ⋮ The price of optimum in Stackelberg games on arbitrary single commodity networks and latency functions ⋮ A survey on networking games in telecommunications ⋮ Optimal service‐capacity allocation in a loss system
This page was built for publication: Capacity allocation under noncooperative routing
