A priority-based model of routing

DOI10.4086/CJTCS.2008.001MaRDI QIDQ5414563zbMATH OpenOpenAlexFDO

Authors Babak Farzad, Neil Olver, Adrian Vetta

Publication date 6 May 2014

Published in Chicago Journal of Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.4086/cjtcs.2008.001

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Communication networks in operations research (90B18) Network design and communication in computer systems (68M10)

Recommendations

• Congestion games with priority-based scheduling
• The price of anarchy is independent of the network topology
• The price of routing unsplittable flow
• The price of routing unsplittable flow
• Price of Anarchy in Networks with Heterogeneous Latency Functions

Cited in

(20)

• Data-driven models of selfish routing: why price of anarchy does depend on network topology
• Decentralized utilitarian mechanisms for scheduling games
• The inefficiency of Nash and subgame perfect equilibria for network routing
• Minimizing total completion time with machine-dependent priority lists
• Competitive online multicommodity routing
• On best response dynamics in weighted congestion games with polynomial delays
• Equilibria in routing games with edge priorities
• Congestion games with capacitated resources
• Dynamic Atomic Congestion Games with Seasonal Flows
• Best-response dynamics in combinatorial auctions with item bidding
• Coordination mechanisms on unrelated machines with arbitrary priority lists
• Congestion games with priority-based scheduling
• The complexity of routing with collision avoidance
• The quality of equilibria for set packing and throughput scheduling games
• The sequential price of anarchy for affine congestion games with few players
• Competitive routing over time
• Congestion control for a system with parallel stations and homogeneous customers using priority passes
• Congestion games with priority-based scheduling
• A system for priority routing and capacity assignment in packet switched networks
• Competitive packet routing with priority lists

This page was built for publication: A priority-based model of routing

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5414563)