FIFO and randomized competitive packet routing games
From MaRDI portal
Publication:2085747
DOI10.1007/978-3-030-92702-8_11OpenAlexW4205922589MaRDI QIDQ2085747
Laura Vargas Koch, Bjoern Tauer
Publication date: 19 October 2022
Full work available at URL: https://doi.org/10.1007/978-3-030-92702-8_11
randomizationfirst-in-first-outprice of anarchyprice of stabilitycoordination policypacket routing games
Cites Work
- Unnamed Item
- Unnamed Item
- Continuous and discrete flows over time
- Nash equilibria and the price of anarchy for flows over time
- Competitive routing over time
- Stackelberg strategies for atomic congestion games
- Packet routing and job-shop scheduling in \(O\) (congestion + dilation) steps
- Fast algorithms for finding \(O\)(Congestion+Dilation) packet routing schedules
- Equilibria in routing games with edge priorities
- Long term behavior of dynamic equilibria in fluid queuing networks
- Existence and Uniqueness of Equilibria for Flows over Time
- Dynamic Equilibria in Fluid Queueing Networks
- The Price of Stability for Network Design with Fair Cost Allocation
- Randomized Routing and Sorting on Fixed-Connection Networks
- Routing Games over Time with FIFO Policy
- A Simpler Proof for $O(\textrm{Congestion} + \textrm{Dilation})$ Packet Routing
- Dynamic Atomic Congestion Games with Seasonal Flows
- On the Price of Anarchy for Flows over Time
- Intrinsic robustness of the price of anarchy
- Robust Price of Anarchy Bounds via LP and Fenchel Duality
This page was built for publication: FIFO and randomized competitive packet routing games
