Routing Games over Time with FIFO Policy

DOI10.1007/978-3-319-71924-5_19zbMath1405.91076arXiv1709.09484OpenAlexW2962924813MaRDI QIDQ4614077

Anisse Ismaili

Publication date: 30 January 2019

Published in: Web and Internet Economics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1709.09484

zbMATH Keywords

complexityprice of anarchyrouting games over time

Mathematics Subject Classification ID

Applications of graph theory (05C90) Noncooperative games (91A10) Games involving graphs (91A43) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (7)

Atomic Dynamic Flow Games: Adaptive vs. Nonadaptive Agents ⋮ On the Price of Anarchy for Flows over Time ⋮ Approximation algorithms for the generalized incremental knapsack problem ⋮ A finite time combinatorial algorithm for instantaneous dynamic equilibrium flows ⋮ Dynamic flows with adaptive route choice ⋮ A finite time combinatorial algorithm for instantaneous dynamic equilibrium flows ⋮ FIFO and randomized competitive packet routing games

This page was built for publication: Routing Games over Time with FIFO Policy