FIFO and randomized competitive packet routing games
type: Item
instance of: scholarly article
title: FIFO and randomized competitive packet routing games
DOI: 10.1007/978-3-030-92702-8_11
author: Bjoern Tauer
author: Laura Vargas Koch
publication date: 2022-10-19T00:00:00Z
Mathematics Subject Classification ID: 68W25
Mathematics Subject Classification ID: 68W27
zbMATH DE Number: 7603891
zbMATH Keywords: packet routing games
zbMATH Keywords: coordination policy
zbMATH Keywords: randomization
zbMATH Keywords: first-in-first-out
zbMATH Keywords: price of anarchy
zbMATH Keywords: price of stability
MaRDI profile type: Publication
full work available at URL: 978-3-030-92702-8 11
OpenAlex ID: W4205922589
cites work: The Price of Stability for Network Design with Fair Cost Allocation
cites work: Q3549721
cites work: Existence and Uniqueness of Equilibria for Flows over Time
cites work: Dynamic Equilibria in Fluid Queueing Networks
cites work: Long term behavior of dynamic equilibria in fluid queuing networks
cites work: On the Price of Anarchy for Flows over Time
cites work: Stackelberg strategies for atomic congestion games
cites work: Competitive routing over time
cites work: Routing Games over Time with FIFO Policy
cites work: Robust Price of Anarchy Bounds via LP and Fenchel Duality
cites work: Continuous and discrete flows over time
cites work: Q3409969
cites work: Nash equilibria and the price of anarchy for flows over time
cites work: Packet routing and job-shop scheduling in \(O\) (congestion + dilation) steps
cites work: Fast algorithms for finding \(O\)(Congestion+Dilation) packet routing schedules
cites work: Randomized Routing and Sorting on Fixed-Connection Networks
cites work: A Simpler Proof for $O(\textrm{Congestion} + \textrm{Dilation})$ Packet Routing
cites work: Intrinsic robustness of the price of anarchy
cites work: Dynamic Atomic Congestion Games with Seasonal Flows
cites work: Equilibria in routing games with edge priorities
description: scientific article; zbMATH DE number 7603891