Capacity allocation under noncooperative routing
DOI10.1109/9.557575zbMATH Open0872.90035OpenAlexW2147368141MaRDI QIDQ3129377FDOQ3129377
Authors: 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
Recommendations
Applications of game theory (91A80) Noncooperative games (91A10) Transportation, logistics and supply chain management (90B06) Communication networks in operations research (90B18)
Cited In (32)
- NASH EQUILIBRIA IN LOAD BALANCING IN DISTRIBUTED COMPUTER SYSTEMS
- Decentralized bandwidth control subject to two-layer constraints
- A game-theoretic analysis of bandwidth allocation under a user-grouping constraint
- Cooperative networks games with elastic demands
- Capacity management in decentralized networks
- Allocation-pricing game for multipath routing in virtual networks
- Performance of non-cooperative routing over parallel non-observable queues
- Optimal service‐capacity allocation in a loss system
- A Stackelberg strategy for routing flow over time
- A Survey of Uniqueness Results for Selfish Routing
- Uniqueness of equilibria in atomic splittable polymatroid congestion games
- Spare capacity provisioning for quasi-static traffic
- Worst-case analysis of non-cooperative load balancing
- Equilibrium routing strategies in data transmission networks
- A flow and routing control policy for communication networks with multiple competitive users
- A survey on networking games in telecommunications
- The problem of capacity addition in multi-user elastic demand communication networks
- Equilibrium computation in resource allocation games
- Channel coordination under fairness concerns and nonlinear demand
- Atomic resource sharing in noncooperative networks
- The price of optimum in Stackelberg games on arbitrary single commodity networks and latency functions
- On the severity of Braess's paradox: designing networks for selfish users is hard
- Non-cooperative routing in loss networks
- Capacity allocation in generalized Jackson networks
- Capacitated network design games
- Game-theoretic static load balancing for distributed systems
- Routing into two parallel links: Game-theoretic distributed algorithms
- Existence and uniqueness of the Nash equilibrium in the non-cooperative QoS routing
- Network capacity control under a nonparametric demand choice model
- The price of anarchy is independent of the network topology
- Routing and dynamic resource assignment joint game: a non-cooperative model for QoS routing
- Braess's Paradox in large random graphs
This page was built for publication: Capacity allocation under noncooperative routing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3129377)
