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

networkNash equilibriacapacity allocationrouting gamenoncooperative users

Mathematics Subject Classification ID

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

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

(32)

• 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
• 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
• A Stackelberg strategy for routing flow over time
• Optimal service‐capacity allocation in a loss system
• 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
• Channel coordination under fairness concerns and nonlinear demand
• A survey on networking games in telecommunications
• Equilibrium computation in resource allocation games
• The problem of capacity addition in multi-user elastic demand communication networks
• The price of optimum in Stackelberg games on arbitrary single commodity networks and latency functions
• Atomic resource sharing in noncooperative networks
• On the severity of Braess's paradox: designing networks for selfish users is hard
• Capacity allocation in generalized Jackson networks
• Non-cooperative routing in loss networks
• Capacitated network design games
• Game-theoretic static load balancing for distributed systems
• Routing into two parallel links: Game-theoretic distributed algorithms
• Network capacity control under a nonparametric demand choice model
• Existence and uniqueness of the Nash equilibrium in the non-cooperative QoS routing

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)