scientific article; zbMATH DE number 6292593
From MaRDI portal
Publication:5414563
DOI10.4086/cjtcs.2008.001zbMath1286.68227OpenAlexW4243225086MaRDI QIDQ5414563
Neil Olver, Adrian Vetta, Babak Farzad
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
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Communication networks in operations research (90B18) Network design and communication in computer systems (68M10)
Related Items (13)
Competitive online multicommodity routing ⋮ Best-response dynamics in combinatorial auctions with item bidding ⋮ The quality of equilibria for set packing and throughput scheduling games ⋮ The Inefficiency of Nash and Subgame Perfect Equilibria for Network Routing ⋮ Congestion games with capacitated resources ⋮ On best response dynamics in weighted congestion games with polynomial delays ⋮ Scheduling games with machine-dependent priority lists ⋮ The complexity of routing with collision avoidance ⋮ Congestion games with priority-based scheduling ⋮ Competitive routing over time ⋮ Decentralized utilitarian mechanisms for scheduling games ⋮ The sequential price of anarchy for affine congestion games with few players ⋮ Dynamic Atomic Congestion Games with Seasonal Flows
This page was built for publication:
