Selfish Routing on Dynamic Flows

TL;DR

This paper surveys the deterministic queuing model for selfish routing on dynamic flows, exploring its applications, adjustments, and impacts on computational aspects and solution properties.

Contribution

It provides a comprehensive overview of the deterministic queuing model and analyzes how various modifications influence its computational and theoretical characteristics.

Findings

Adjustments affect computability of selfish routings

Modifications influence the existence of solutions

Alterations impact optimality of dynamic flows

Abstract

Selfish routing on dynamic flows over time is used to model scenarios that vary with time in which individual agents act in their best interest. In this paper we provide a survey of a particular dynamic model, the deterministic queuing model, and discuss how the model can be adjusted and applied to different real-life scenarios. We then examine how these adjustments affect the computability, optimality, and existence of selfish routings.