Capacity allocation under noncooperative routing

DOI10.1109/9.557575MaRDI QIDQ3129377zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

capacity allocationNash equilibrianetworknoncooperative usersrouting game

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Communication networks in operations research (90B18) Noncooperative games (91A10) Applications of game theory (91A80)

Recommendations

• The problem of capacity addition in multi-user elastic demand communication networks
• Non-cooperative routing in loss networks
• Selfish Routing in Capacitated Networks
• Routing into two parallel links: Game-theoretic distributed algorithms
• The price of selfish routing

Cited in

(34)

• The price of optimum in Stackelberg games on arbitrary single commodity networks and latency functions
• Capacity allocation in generalized Jackson networks
• Equilibrium routing strategies in data transmission networks
• Uniqueness of equilibria in atomic splittable polymatroid congestion games
• Network capacity control under a nonparametric demand choice model
• Equilibrium computation in resource allocation games
• Primary versus secondary infrastructure capacity allocation mechanisms
• A game-theoretic analysis of bandwidth allocation under a user-grouping constraint
• Decentralized bandwidth control subject to two-layer constraints
• Spare capacity provisioning for quasi-static traffic
• 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
• On the severity of Braess's paradox: designing networks for selfish users is hard
• A Stackelberg strategy for routing flow over time
• A survey on networking games in telecommunications
• Worst-case analysis of non-cooperative load balancing
• Allocation-pricing game for multipath routing in virtual networks
• Braess's Paradox in large random graphs
• Capacity management in decentralized networks
• Cooperative networks games with elastic demands
• Existence and uniqueness of the Nash equilibrium in the non-cooperative QoS routing
• A Survey of Uniqueness Results for Selfish Routing
• Routing and dynamic resource assignment joint game: a non-cooperative model for QoS routing
• Non-cooperative routing in loss networks
• NASH EQUILIBRIA IN LOAD BALANCING IN DISTRIBUTED COMPUTER SYSTEMS
• Optimal service‐capacity allocation in a loss system
• Performance of non-cooperative routing over parallel non-observable queues
• The price of anarchy is independent of the network topology
• Atomic resource sharing in noncooperative networks
• Routing into two parallel links: Game-theoretic distributed algorithms
• Channel coordination under fairness concerns and nonlinear demand
• Game-theoretic static load balancing for distributed systems
• A game-theoretic framework for distributed load balancing: static and dynamic game models
• Capacitated network design games

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)