This paper was converted on www.awesomepapers.org from LaTeX by an anonymous user.
Want to know more? Visit the Converter page.

11institutetext: Technische Universität Berlin, Germany
11email: hoang.m.pham@campus.tu-berlin.de   11email: sering@math.tu-berlin.de

Dynamic Equilibria in Time-Varying Networksthanks: Funded by the Deutsche Forschungsgemeinschaft (DFG, German Research Foundation) under Germany’s Excellence Strategy – The Berlin Mathematics Research Center MATH+ (EXC-2046/1, project ID: 390685689).

Hoang Minh Pham    Leon Sering
Abstract

Predicting selfish behavior in public environments by considering Nash equilibria is a central concept of game theory. For the dynamic traffic assignment problem modeled by a flow over time game, in which every particle tries to reach its destination as fast as possible, the dynamic equilibria are called Nash flows over time. So far, this model has only been considered for networks in which each arc is equipped with a constant capacity, limiting the outflow rate, and with a transit time, determining the time it takes for a particle to traverse the arc. However, real-world traffic networks can be affected by temporal changes, for example, caused by construction works or special speed zones during some time period. To model these traffic scenarios appropriately, we extend the flow over time model by time-dependent capacities and time-dependent transit times. Our first main result is the characterization of the structure of Nash flows over time. Similar to the static-network model, the strategies of the particles in dynamic equilibria can be characterized by specific static flows, called thin flows with resetting. The second main result is the existence of Nash flows over time, which we show in a constructive manner by extending a flow over time step by step by these thin flows.

Keywords:
Nash flows over time dynamic equilibria deterministic queuing time-varying networks dynamic traffic assignment.

1 Introduction

In the last decade the technological advances in the mobility and communication sector have grown rapidly enabling access to real-time traffic data and autonomous driving vehicles in the foreseeable future. One of the major advantages of self-driving and communicating vehicles is the ability to directly use information about the traffic network including the route-choice of other road users. This holistic view of the network can be used to decrease travel times and distribute the traffic volume more evenly over the network. As users will still expect to travel along a fastest route it is important to incorporate game theoretical aspects when analyzing the dynamic traffic assignment. The results can then be used by network designers to identify bottlenecks beforehand, forecast air pollution in dense urban areas and give feedback on network structures. In order to obtain a better understanding of the complicated interplay between traffic users it is important to develop strong mathematical models which represent as many real-world traffic features as possible. Even though the more realistic models consider a time-component, the network properties are considered to stay constant in most cases. Surely, this is a serious drawback as real road networks often have properties that vary over time. For example, the speed limit in school zones is often reduced during school hours, roads might be completely or partially blocked due to construction work and the direction of reversible lanes can be switched, causing a change in the capacity in both directions. A more exotic, but nonetheless important setting are evacuation scenarios. Consider an inhabited region of low altitude with a high risk of flooding. As soon as there is a flood warning everyone needs to be evacuated to some high-altitude-shelter. But, due to the nature of rising water levels, roads with low altitude will be impassable much sooner than roads of higher altitude. In order to plan an optimal evacuation or simulate a chaotic equilibrium scenario it is essential to use a model with time-varying properties. This research work is dedicated to providing a better understanding of the impact of dynamic road properties on the traffic dynamics in the Nash flow over time model. We will transfer all essential properties of Nash flows over time in static networks to networks with time-varying properties.

1.1 Related Work

The fundamental concept for the model considered in this paper are flows over time or dynamic flows, which were introduced back in 1956 by Ford and Fulkerson [8, 9] in the context of optimization problems. The key idea is to add a time-component to classical network flows, which means that the flow particles need time to travel through the network. In 1959 Gale [10] showed the existence of so called earliest arrival flows, which solve several optimization problems at once, as they maximize the amount of flow reaching the sink at all points in time simultaneously. Further work on these optimal flows is due to Wilkinson [26], Fleischer and Tardos [7], Minieka [18] and many others. For formal definitions and a good overview of optimization problems in flow over time settings we refer to the survey of Skutella [23].

In order to use flows over time for traffic modeling it is important to consider game theoretic aspects. Some pioneer work goes back to Vickrey [24] and Yagar [27]. In the context of classical (static) network flows, equilibria were introduced by Wardrop [25] in 1952. In 2009 Koch and Skutella [15] (see also [16] and Koch’s PhD thesis [14]) started a fruitful research line by introducing dynamic equilibria, also called Nash flows over time, which will be the central concept in this paper. In a Nash flow over time every particle chooses a quickest path from the origin to the destination, anticipating the route choice of all other flow particles. Cominetti et al. showed the existence of Nash flows over time [3, 4] and studied the long term behavior [5]. Macko et al. [17] studied the Braess paradox in this model and Bhaskar et al. [1] and Correa et al. [6] bounded the price of anarchy under certain conditions. In 2018 Sering and Skutella [21] transferred Nash flows over time to a model with multiple sources and multiple sinks and in the following year Sering and Vargas Koch [22] considered Nash flows over time in a model with spillback.

A different equilibrium concept in the same model was considered by Graf et al. [11] by introducing instantaneous dynamic equilibria. In these flows over time the particles do not anticipate the further evolution of the flow, but instead reevaluate their route choice at every node and continue their travel on a current quickest path. In addition to that, there is an active research line on packet routing games. Here, the traffic agents are modeled by atomic packets (vehicles) of a specific size. This is often combined with discrete time steps. Some of the recent work on this topic is due to Cao et al. [2], Harks et al. [12], Peis et al. [19] and Scarsini et al. [20].

1.2 Overview and Contribution

In the base model, which was considered by Koch and Skutella [16] and by the follow up research [1, 3, 4, 5, 6, 17, 21], the network is constant and each arc has a constant capacity and constant transit time. In real-world traffic, however, temporary changes of the infrastructure are omnipresent. In order to represent this, we extend the base model to networks with time-varying capacities (including the network inflow rate) and time-varying transit times.

We start in Section 2 by defining the flow dynamics of the deterministic queuing model with time-varying arc properties and proving some first auxiliary results. In particular, we describe how to turn time-dependent speed limits into time-dependent transit times. In Section 3 we introduce some essential properties, such as the earliest arrival times, which enable us to define Nash flows over time. As in the base model, it is still possible to characterize such a dynamic equilibrium by the underlying static flow. Taking the derivatives of these parametrized static flows provides thin flows with resetting, which are defined in Section 4. We show that the central results of the base model transfer to time-varying networks, and in particular, that the derivatives of every Nash flow over time form a thin flow with resetting. In Section 5 we show the reverse of this statement: Nash flows over time can be constructed by a sequence of thin flows with resetting, which, in the end, proves the existence of dynamic equilibria. We close this section with a detailed example. Finally, in Section 6 we present a conclusion and give a brief outlook on further research directions.

2 Flow Dynamics

We consider a directed graph G=(V,E)G=(V,E) with a source ss and a sink tt such that each node is reachable by ss. In contrast to the Koch-Skutella model, which we will call base model from now on, this time each arc ee is equipped with a time-dependent capacity νe:[0,)(0,)\nu_{e}\colon[0,\infty)\to(0,\infty) and a time-dependent speed limit λe:[0,)(0,)\lambda_{e}\colon[0,\infty)\to(0,\infty), which is inversely proportional to the transit time. We consider a time-dependent network inflow rate r:[0,)[0,)r\colon[0,\infty)\to[0,\infty) denoting the flow rate at which particles enter the network at ss. We assume that the amount of flow an arc can support is unbounded and that the network inflow is unbounded as well, i.e., for all eEe\in E we require that

0θνe(ξ)dξ,0θλe(ξ)dξ and 0θr(ξ)dξ for θ.\int_{0}^{\theta}\nu_{e}(\xi)\mathop{}\!\mathrm{d}\xi\to\infty,\quad\int_{0}^{\theta}\lambda_{e}(\xi)\mathop{}\!\mathrm{d}\xi\to\infty\quad\text{ and }\quad\int_{0}^{\theta}r(\xi)\mathop{}\!\mathrm{d}\xi\to\infty\quad\text{ for }\theta\to\infty.

Later on, in order to be able to construct Nash flows over time, we will additionally assume that all these functions are right-constant, i.e., for every θ[0,)\theta\in[0,\infty) there exists an ε>0\varepsilon>0 such that the function is constant on [θ,θ+ε)[\theta,\theta+\varepsilon).

2.0.1 Speed limits.

Let us focus on the transit times first. We have to be careful how to model the transit time changes, since we do not want to lose the following two properties of the base model:

  1. (i)

    We want to have the first-in-first-out (FIFO) property for arcs, which leads to FIFO property of the network for Nash flows over time [16, Theorem 1].

  2. (ii)

    Particles should never have the incentive to wait on a node.

In other words, we cannot simply allow piecewise-constant transit times, since this could lead to the following case: If the transit time of an arc is high at the beginning and gets reduced to a lower value at some later point in time, then particles might overtake other particles on that arc. Thus, particles might arrive earlier at the sink if they wait right in front of the arc until its transit time drops. Hence, we let the speed limit change over time instead. In order to keep the number of parameters of the network as small as possible, we assume that the lengths of all arcs equal 11 and, instead of a transit time, we equip every arc eEe\in E with a time-dependent speed limit λe:[0,)(0,)\lambda_{e}\colon[0,\infty)\to(0,\infty). Thus, a particle might traverse the first part of an arc at a different speed than the remaining distance if the maximal speed changes midway; see Figure 1.

Refer to caption
Refer to caption
Refer to caption
Figure 1: Consider a road segment with time-dependent speed limit that is low in the time interval [0,1)[0,1) and large afterwards. All vehicles, independent of their position, first traverse the link slowly and immediately speed up to the new speed limit at time 11.

2.0.2 Transit times.

Note that we assume the point queue of an arc to always right in front of the exit. Hence, a particle entering arc ee at time θ\theta immediately traverses the arc of length 11 with a time-dependent speed of λe\lambda_{e}. The transit time τ:[0,)[0,){\tau\colon[0,\infty)\to[0,\infty)} is therefore given by

τe(θ)min{τ0|θθ+τλe(ξ)dξ=1}.\tau_{e}(\theta)\coloneqq\min\Set{\tau\geq 0}{\int_{\theta}^{\theta+\tau}\lambda_{e}(\xi)\mathop{}\!\mathrm{d}\xi=1}.

Since we required 0θλe(ξ)dξ\int_{0}^{\theta}\lambda_{e}(\xi)\mathop{}\!\mathrm{d}\xi to be unbounded for θ\theta\to\infty, we always have a finite transit time. For an illustrative example see Figure 3.

Refer to caption
Figure 2: From speed limits (left side) to transit times (right side). The transit time τe(θ)\tau_{e}(\theta) denotes the time a particle needs to traverse the arc when entering at time θ\theta. We normalize the speed limits by assuming that all arcs have length 11, and hence, the transit time τe(θ)\tau_{e}(\theta) equals the length of an interval starting at θ\theta such that the area under the speed limit graph within this interval is 11.
Refer to caption
Figure 3: An illustration of how the flow rate changes depending on the speed limits. On the left: As the speed limit λ\lambda is high, the flow volume entering the arc per time unit is represented by the area of the long rectangle. On the right: The speed limit is halved, and therefore, the same amount of flow needs twice as much time to leave the arc (or enter the queue if there is one). Hence, if there is no queue, the outflow rate at time τ+τe(θ)\tau+\tau_{e}(\theta) is only half the size of the inflow rate at time θ\theta.

The following lemma shows some basic properties of the transit times.

Lemma 1 ().

For all eEe\in E and almost all θ[0,)\theta\in[0,\infty) we have:

  1. (i)

    The function θθ+τe(θ)\theta\mapsto\theta+\tau_{e}(\theta) is strictly increasing.

  2. (ii)

    The function τe\tau_{e} is continuous and almost everywhere differentiable.

  3. (iii)

    For almost all θ[0,)\theta\in[0,\infty) we have 1+τe(θ)=λe(θ)λe(θ+τe(θ))1+\tau^{\prime}_{e}(\theta)=\frac{\lambda_{e}(\theta)}{\lambda_{e}(\theta+\tau_{e}(\theta))}.

These statement follow by simple computation and some basic Lebesgue integral theorems. The proof can be found in the appendix on page 7.

2.0.3 Speed ratios.

The ratio in Lemma 1 (iii) will be important to measure the outflow of an arc depending on the inflow. We call γe:[0,)[0,)\gamma_{e}\colon[0,\infty)\to[0,\infty) the speed ratio of ee and it is defined by γe(θ)λe(θ)λe(θ+τe(θ))=1+τe(θ)\gamma_{e}(\theta)\coloneqq\frac{\lambda_{e}(\theta)}{\lambda_{e}(\theta+\tau_{e}(\theta))}=1+\tau^{\prime}_{e}(\theta). Figuratively speaking, this ratio describes how much the flow rate changes under different speed limits. If, for example, γe(θ)=2\gamma_{e}(\theta)=2, as depicted in Figure 3, this means that the speed limit was twice as high when the particle entered the arc as it is at the moment the particle enters the queue. In this case the flow rate is halved on its way, since the same amount of flow that entered within one time unit, needs two time units to leave it. With the same intuition the flow rate is increased whenever γe(θ)<1\gamma_{e}(\theta)<1. Note that in figures of other publications on flows over time the flow rate is often pictured by the width of the flow. But for time-varying networks this is not accurate anymore as the transit speed can vary. Hence, in this paper the flow rates are given by the width of the flow multiplied by the current speed limit.

A flow over time is specified by a family of locally integrable and bounded functions f=(fe+,fe)eEf=(f^{+}_{e},f^{-}_{e})_{e\in E} denoting the in- and outflow rates. The cumulative in- and outflows are given by

Fe+(θ)0θfe+(ξ)dξ and Fe(θ)0θfe(ξ)dξ.F_{e}^{+}(\theta)\coloneqq\int_{0}^{\theta}f_{e}^{+}(\xi)\mathop{}\!\mathrm{d}\xi\qquad\text{ and }\qquad F_{e}^{-}(\theta)\coloneqq\int_{0}^{\theta}f_{e}^{-}(\xi)\mathop{}\!\mathrm{d}\xi.

A flow over time conserves flow on all arcs ee:

Fe(θ+τe(θ))Fe+(θ)for all θ[0,],F_{e}^{-}(\theta+\tau_{e}(\theta))\leq F_{e}^{+}(\theta)\qquad\text{for all }\theta\in[0,\infty], (1)

and conserves flow at every node vV\{t}v\in V\backslash\set{t} for almost all θ[0,)\theta\in[0,\infty):

eδv+fe+(θ)eδvfe(θ)={0 if vV{t},r(θ) if v=s.\sum_{e\in\delta^{+}_{v}}f_{e}^{+}(\theta)-\sum_{e\in\delta^{-}_{v}}f_{e}^{-}(\theta)=\begin{cases}0&\text{ if }v\in V\setminus\set{t},\\ r(\theta)&\text{ if }v=s.\end{cases} (2)

A particle entering an arc ee at time θ\theta reaches the head of the arc at time θ+τe(θ)\theta+\tau_{e}(\theta) where it lines up at the point queue. Thereby, the queue size ze:[0,)[0,)z_{e}\colon[0,\infty)\to[0,\infty) at time θ+τe(θ)\theta+\tau_{e}(\theta) is defined by ze(θ+τe(θ))Fe+(θ)Fe(θ+τe(θ))z_{e}(\theta+\tau_{e}(\theta))\coloneqq F_{e}^{+}(\theta)-F_{e}^{-}(\theta+\tau_{e}(\theta)).

We call a flow over time in a time-varying network feasible if we have for almost all θ[0,)\theta\in[0,\infty) that

fe(θ+τe(θ))={νe(θ+τe(θ)) if ze(θ+τe(θ))>0,min{fe+(θ)γe(θ),νe(θ+τe(θ))} else, f_{e}^{-}(\theta+\tau_{e}(\theta))=\begin{cases}\nu_{e}(\theta+\tau_{e}(\theta))&\text{ if }z_{e}(\theta+\tau_{e}(\theta))>0,\\ \min\Set{\frac{f_{e}^{+}(\theta)}{\gamma_{e}(\theta)},\nu_{e}(\theta+\tau_{e}(\theta))}&\text{ else, }\end{cases} (3)

and fe(θ)=0f_{e}^{-}(\theta)=0 for almost all θ<τe(0)\theta<\tau_{e}(0).

Note that the outflow rate depends on the speed ratio γe(θ)\gamma_{e}(\theta) if the queue is empty (see Figure 3). Otherwise, the particles enter the queue, and therefore, the outflow rate equals the capacity independent of the speed ratio. Furthermore, we observe that every arc with a positive queue always has a positive outflow, since the capacities are required to be strictly positive. And finally, (3) implies (1), which can easily be seen by considering the derivatives of the cumulative flows whenever we have an empty queue, i.e., Fe(θ+τe(θ))=Fe+(θ)F_{e}^{-}(\theta+\tau_{e}(\theta))=F_{e}^{+}(\theta). By (3) we have that fe(θ+τe(θ))(1+τe(θ))fe+(θ){f_{e}^{-}(\theta+\tau_{e}(\theta))\cdot(1+\tau^{\prime}_{e}(\theta))\leq f_{e}^{+}(\theta)}. Hence, (2) and (3) are sufficient for a family of functions f=(fe+,fe)eEf=(f_{e}^{+},f_{e}^{-})_{e\in E} to be a feasible flow over time.

Refer to caption
Figure 4: Waiting times for time-dependent capacities. The waiting time of a particle θ0\theta_{0} (right side) is given by the length of the interval starting at θ0+τe(θ0)\theta_{0}+\tau_{e}(\theta_{0}) such that the area underneath the capacity graph equals the queue size at time θ0+τe(θ0)\theta_{0}+\tau_{e}(\theta_{0}) (left side). The right boundary of the interval equals the exit time Te(θ0)T_{e}(\theta_{0}). The waiting time does not only depend on the capacity but also on the inflow rate and the transit times. For example, if the capacity and the speed limit are constant but the inflow rate is 0, the waiting time will decrease with a slope of 11 (right side within [θ1,θ2][\theta_{1},\theta_{2}]).

The waiting time qe:[0,)[0,)q_{e}\colon[0,\infty)\to[0,\infty) of a particle that enters the arc at time θ\theta is defined by

qe(θ)min{q0|θ+τe(θ)θ+τe(θ)+qνe(ξ)dξ=ze(θ+τe(θ))}.q_{e}(\theta)\coloneqq\min\Set{q\geq 0}{\int_{\theta+\tau_{e}(\theta)}^{\theta+\tau_{e}(\theta)+q}\nu_{e}(\xi)\mathop{}\!\mathrm{d}\xi=z_{e}(\theta+\tau_{e}(\theta))}.

As we required 0θνe(ξ)dξ\int_{0}^{\theta}\nu_{e}(\xi)\mathop{}\!\mathrm{d}\xi to be unbounded for θ\theta\to\infty the set on the right side is never empty. Hence, qe(θ)q_{e}(\theta) is well-defined and has a finite value. In addition, qeq_{e} is continuous since νe\nu_{e} is always strictly positive. The exit time Te:[0,)[0,)T_{e}\colon[0,\infty)\to[0,\infty) denotes the time at which the particles that have entered the arc at time θ\theta finally leave the queue. Hence, we define Te(θ)θ+τe(θ)+qe(θ)T_{e}(\theta)\coloneqq\theta+\tau_{e}(\theta)+q_{e}(\theta). In Figure 4 we display an illustrative example for the definition of waiting and exit times.

With these definitions we can show the following lemma.

Lemma 2 ().

For a feasible flow over time ff it holds for all eEe\in E, vVv\in V and θ[0,){\theta\in[0,\infty)} that:

  1. (i)

    qe(θ)>0ze(θ+τe(θ))>0q_{e}(\theta)>0\;\;\Leftrightarrow\;\;z_{e}(\theta+\tau_{e}(\theta))>0.

  2. (ii)

    ze(θ+τe(θ)+ξ)>0z_{e}(\theta+\tau_{e}(\theta)+\xi)>0 for all ξ[0,qe(θ))\xi\in[0,q_{e}(\theta)).

  3. (iii)

    Fe+(θ)=Fe(Te(θ))F^{+}_{e}(\theta)=F^{-}_{e}(T_{e}(\theta)).

  4. (iv)

    For θ1<θ2\theta_{1}<\theta_{2} with Fe+(θ2)Fe+(θ1)=0F_{e}^{+}(\theta_{2})-F_{e}^{+}(\theta_{1})=0 and ze(θ2+τe(θ2))>0z_{e}(\theta_{2}+\tau_{e}(\theta_{2}))>0 we have Te(θ1)=Te(θ2)T_{e}(\theta_{1})=T_{e}(\theta_{2}).

  5. (v)

    The functions TeT_{e} are monotonically increasing.

  6. (vi)

    The functions qeq_{e} and TeT_{e} are continuous and almost everywhere differentiable.

  7. (vii)

    For almost all θ[0,)\theta\in[0,\infty) we have

    Te(θ)={fe+(θ)νe(Te(θ)) if qe(θ)>0,max{γe(θ),fe+(θ)νe(Te(θ))} else.T^{\prime}_{e}(\theta)=\begin{cases}\frac{f_{e}^{+}(\theta)}{\nu_{e}(T_{e}(\theta))}&\text{ if }q_{e}(\theta)>0,\\ \max\Set{\gamma_{e}(\theta),\frac{f_{e}^{+}(\theta)}{\nu_{e}(T_{e}(\theta))}}&\text{ else.}\end{cases}

Most of the statements follow immediately from the definitions and some involve minor calculations. For (vi) we use Lebesgue’s differentiation theorem. As the proof does not give any interesting further insights we moved it to the appendix on page 7.

3 Nash Flows Over Time

In order to define a dynamic equilibrium we consider the particles as players in a dynamic game. For this the set of particles is identified by the non-negative reals denoted by 0\mathbb{R}_{\geq 0}. The flow volume is hereby given by the Lebesgue-measure, which means that [a,b]0[a,b]\subseteq\mathbb{R}_{\geq 0} with a<ba<b contains a flow volume of bab-a. The flow particles enter the network according to the ordering of the reals beginning with particle 0. It is worth noting that a particle ϕ0\phi\in\mathbb{R}_{\geq 0} can be split up further so that for example one half takes a different route than the other half. As characterized by Koch and Skutella, a dynamic equilibrium is a feasible flow over time, where almost all particles only use current shortest paths from ss to tt. Note that we assume a game with full information. Consequently, all particles know all speed limit and capacity functions in advance and have the ability to perfectly predict the future evolution of the flow over time. Hence, each particle perfectly knows all travel times and can choose its route accordingly. We start by defining the earliest arrival times for a particle ϕ0\phi\in\mathbb{R}_{\geq 0}.

The earliest arrival time functions v:0[0,)\ell_{v}\colon\mathbb{R}_{\geq 0}\to[0,\infty) map each particle ϕ\phi to the earliest time v(ϕ)\ell_{v}(\phi) it can possibly reach node vv. Hence, it is the solution to

v(ϕ)={min{θ0|0θr(ξ)dξ=ϕ} for v=s,mine=uvδvTe(u(ϕ)) else.\ell_{v}(\phi)=\begin{cases}\quad\!\min\;\;\Set{\theta\geq 0}{\int_{0}^{\theta}r(\xi)\mathop{}\!\mathrm{d}\xi=\phi}&\text{ for }v=s,\\ \min\limits_{e=uv\in\delta_{v}^{-}}T_{e}(\ell_{u}(\phi))&\text{ else.}\end{cases} (4)

Note that for all vVv\in V the earliest arrival time function v\ell_{v} is non-decreasing, continuous and almost everywhere differentiable. This holds directly for s\ell_{s} and for vsv\neq s it follows inductively, since these properties are preserved by the concatenation TeuT_{e}\circ\ell_{u} and by the minimum of finitely many functions.

For a particle ϕ\phi we call an arc e=uve=uv active if v(ϕ)=Te(u(ϕ))\ell_{v}(\phi)=T_{e}(\ell_{u}(\phi)). The set of all these arcs are denoted by EϕE^{\prime}_{\phi} and these are exactly the arcs that form the current shortest paths from ss to some node vv. For this reason we call the subgraph Gϕ=(V,Eϕ)G^{\prime}_{\phi}=(V,E^{\prime}_{\phi}) the current shortest paths network for particle ϕ\phi. Note that GϕG^{\prime}_{\phi} is acyclic and that every node is reachable by ss within this graph. The arcs where particle ϕ\phi experiences a waiting time when traveling along shortest paths only are called resetting arcs denoted by Eϕ{e=uvE|qe(u(ϕ))>0}E^{*}_{\phi}\coloneqq\Set{e=uv\in E}{q_{e}(\ell_{u}(\phi))>0}.

Nash flows over time in time-varying networks are defined in the exact same way as Cominetti et al. defined them in the base model [3, Definition 1].

Definition 1 (Nash flow over time).

We call a feasible flow over time ff a Nash flow over time if the following Nash flow condition holds:

fe+(θ)>0θu(Φe) for all e=uvE and almost all θ[0,),f^{+}_{e}(\theta)>0\;\;\Rightarrow\;\;\theta\in\ell_{u}(\Phi_{e})\;\;\text{ for all }e=uv\in E\text{ and almost all }\theta\in[0,\infty), (N)

where Φe{ϕ0|eEϕ}\Phi_{e}\coloneqq\set{\phi\in\mathbb{R}_{\geq 0}}{e\in E^{\prime}_{\phi}} is the set of particles for which arc ee is active.

As Cominetti et al. showed in [4, Theorem 1] these Nash flows over time can be characterized as follows.

Lemma 3.

A feasible flow over time ff is a Nash flow over time if, and only if, for all e=uvEe=uv\in E and all ϕ0\phi\in\mathbb{R}_{\geq 0} we have Fe+(u(ϕ))=Fe(v(ϕ)){F_{e}^{+}(\ell_{u}(\phi))=F_{e}^{-}(\ell_{v}(\phi))}.

Since the exit and the earliest arrival times have the same properties in time-varying networks as in the base model, this lemma follows with the exact same proof that was given by Cominetti et al. for the base model [4, Theorem 1]. The same is true for the following lemma; see [4, Proposition 2].

Lemma 4.

Given a Nash flow over time the following holds for all particles ϕ\phi:

  1. (i)

    EϕEϕE^{*}_{\phi}\subseteq E^{\prime}_{\phi}.

  2. (ii)

    Eϕ={e=uv|v(ϕ)u(ϕ)+τe(θ)}E^{\prime}_{\phi}=\set{e=uv}{\ell_{v}(\phi)\geq\ell_{u}(\phi)+\tau_{e}(\theta)}.

  3. (iii)

    Eϕ={e=uv|v(ϕ)>u(ϕ)+τe(θ)}E^{*}_{\phi}=\set{e=uv}{\ell_{v}(\phi)>\ell_{u}(\phi)+\tau_{e}(\theta)}.

Motivated by Lemma 3 we define the underlying static flow for ϕ0\phi\in\mathbb{R}_{\geq 0} by

xe(ϕ)Fe+(u(ϕ))=Fe(v(ϕ)) for all e=uvE.x_{e}(\phi)\coloneqq F_{e}^{+}(\ell_{u}(\phi))=F_{e}^{-}(\ell_{v}(\phi))\quad\text{ for all }e=uv\in E.

By the definition of s\ell_{s} and the integration of (2) we have 0s(ϕ)r(ξ)dξ=ϕ\int_{0}^{\ell_{s}(\phi)}r(\xi)\mathop{}\!\mathrm{d}\xi=\phi, and hence, xe(ϕ)x_{e}(\phi) is a static ss-tt-flow (classical network flow) of value ϕ\phi, whereas the derivatives (xe(ϕ))eE(x^{\prime}_{e}(\phi))_{e\in E} form a static ss-tt-flow of value 11.

4 Thin Flows

Thin flows with resetting, introduced by Koch and Skutella [16], characterize the derivatives (xe)eE(x^{\prime}_{e})_{e\in E} and (v)vV(\ell^{\prime}_{v})_{v\in V} of Nash flows over time in the base model. In the following we will transfer this concept to time-varying networks.

Consider an acyclic network G=(V,E)G^{\prime}=(V,E^{\prime}) with a source ss and a sink tt, such that every node is reachable by ss. Each arc is equipped with a capacity νe>0\nu_{e}>0 and a speed ratio γe>0\gamma_{e}>0. Furthermore, we have a network inflow rate of r>0r>0 and an arc set EEE^{*}\subseteq E^{\prime}. We obtain the following definition.

Definition 2 (Thin flow with resetting in a time-varying network).

A static ss-tt flow (xe)eE(x^{\prime}_{e})_{e\in E} of value 11 together with a node labeling (v)vV(\ell^{\prime}_{v})_{v\in V} is a thin flow with resetting on EE^{*} if:

s\displaystyle\ell^{\prime}_{s} =1r\displaystyle=\frac{1}{r} (TF1)
v\displaystyle\ell^{\prime}_{v} =mine=uvEρe(u,xe)\displaystyle=\min_{e=uv\in E^{\prime}}\rho_{e}(\ell^{\prime}_{u},x^{\prime}_{e})\quad for all vV{s},\displaystyle\text{ for all }v\in V\setminus\set{s}, (TF2)
v\displaystyle\ell^{\prime}_{v} =ρe(u,xe)\displaystyle=\rho_{e}(\ell^{\prime}_{u},x^{\prime}_{e}) for all e=uvE with xe>0,\displaystyle\text{ for all }e=uv\in E^{\prime}\text{ with }x^{\prime}_{e}>0, (TF3)
 where ρe(u,xe){xeνe if e=uvE,max{γeu,xeνe} if e=uvE\E.\text{ where }\qquad\rho_{e}(\ell^{\prime}_{u},x^{\prime}_{e})\coloneqq\begin{cases}\frac{x^{\prime}_{e}}{\nu_{e}}&\text{ if }e=uv\in E^{*},\\ \max\Set{\gamma_{e}\cdot\ell^{\prime}_{u},\frac{x^{\prime}_{e}}{\nu_{e}}}&\text{ if }e=uv\in E^{\prime}\backslash E^{*}.\end{cases}

The derivatives of a Nash flow over time in time-varying networks do indeed form a thin flow with resetting as the following theorem shows.

Theorem 4.1.

For almost all ϕ0\phi\!\in\!\mathbb{R}_{\geq 0} the derivatives (xe(ϕ))eEϕ(x^{\prime}_{e}(\phi))_{e\in E^{\prime}_{\phi}} and (v(ϕ))vV(\ell^{\prime}_{v}(\phi))_{v\in V} of a Nash flow over time f=(fe+,fe)eEf=(f^{+}_{e},f_{e}^{-})_{e\in E} form a thin flow with resetting on EϕE^{*}_{\phi} in the current shortest paths network Gϕ=(V,Eϕ)G^{\prime}_{\phi}=(V,E^{\prime}_{\phi}) with network inflow rate r(s(ϕ))r(\ell_{s}(\phi)) as well as capacities νe(v(ϕ))\nu_{e}(\ell_{v}(\phi)) and speed ratios γe(u(ϕ))\gamma_{e}(\ell_{u}(\phi)) for each arc e=uvEe=uv\in E.

Proof.

Let ϕ0\phi\in\mathbb{R}_{\geq 0} be a particle such that for all arcs e=uvEe=uv\in E the derivatives of xex_{e}, u\ell_{u}, TeuT_{e}\circ\ell_{u} and τe\tau_{e} exist and xe(ϕ)=fe+(u(ϕ))u(ϕ)=fe(v(ϕ))v(ϕ)x_{e}^{\prime}(\phi)=f_{e}^{+}(\ell_{u}(\phi))\cdot\ell^{\prime}_{u}(\phi)=f_{e}^{-}(\ell_{v}(\phi))\cdot\ell^{\prime}_{v}(\phi) as well as 1+τe(u(ϕ))=γe(u(ϕ))1+\tau^{\prime}_{e}(\ell_{u}(\phi))=\gamma_{e}(\ell_{u}(\phi)). This is given for almost all ϕ\phi.

By (4) we have 0s(ϕ)r(ξ)dξ=ϕ\int_{0}^{\ell_{s}(\phi)}r(\xi)\mathop{}\!\mathrm{d}\xi=\phi and taking the derivative by applying the chain rule, yields r(s(ϕ))s(ϕ)=1r(\ell_{s}(\phi))\cdot\ell^{\prime}_{s}(\phi)=1, which shows (TF1).

Taking the derivative of (4) at time u(ϕ)\ell_{u}(\phi) by using the differentiation rule for a minimum (Lemma 7 in the appendix) yields v(ϕ)=mine=uvETe(u(ϕ))u(ϕ)\ell^{\prime}_{v}(\phi)=\min_{e=uv\in E^{\prime}}T^{\prime}_{e}(\ell_{u}(\phi))\cdot\ell^{\prime}_{u}(\phi). By using Lemma 2 (vii) we obtain

Te(u(ϕ))u(ϕ)\displaystyle T^{\prime}_{e}(\ell_{u}(\phi))\cdot\ell^{\prime}_{u}(\phi) ={fe+(u(ϕ))νe(Te(u(ϕ)))u(ϕ)if qe(u(ϕ))>0,max{γe(u(ϕ)),fe+(u(ϕ))νe(Te(u(ϕ)))}u(ϕ)else,\displaystyle=\begin{cases}\frac{f_{e}^{+}(\ell_{u}(\phi))}{\nu_{e}(T_{e}(\ell_{u}(\phi)))}\cdot\ell^{\prime}_{u}(\phi)&\text{if }q_{e}(\ell_{u}(\phi))>0,\\ \max\Set{\gamma_{e}(\ell_{u}(\phi)),\frac{f_{e}^{+}(\ell_{u}(\phi))}{\nu_{e}(T_{e}(\ell_{u}(\phi)))}}\cdot\ell^{\prime}_{u}(\phi)&\text{else,}\end{cases}
=ρe(u(ϕ),xe(ϕ)),\displaystyle=\rho_{e}(\ell^{\prime}_{u}(\phi),x^{\prime}_{e}(\phi)),

which shows (TF2).

Finally, in the case of fe(v(ϕ))v(ϕ)=xe(ϕ)>0f_{e}^{-}(\ell_{v}(\phi))\cdot\ell^{\prime}_{v}(\phi)=x^{\prime}_{e}(\phi)>0 we have by (3) that

v(ϕ)=xe(ϕ)fe(v(ϕ))\displaystyle\ell^{\prime}_{v}(\phi)=\frac{x^{\prime}_{e}(\phi)}{f_{e}^{-}(\ell_{v}(\phi))} ={xe(ϕ)min{fe+(u(ϕ))γe(u(ϕ)),νe(v(ϕ))} if qe(u(ϕ))=0,xe(ϕ)νe(v(ϕ)) else,\displaystyle=\begin{dcases}\frac{x^{\prime}_{e}(\phi)}{\min\Set{\frac{f^{+}_{e}(\ell_{u}(\phi))}{\gamma_{e}(\ell_{u}(\phi))},\nu_{e}(\ell_{v}(\phi))}}\,&\text{ if }q_{e}(\ell_{u}(\phi))=0,\\ \frac{x^{\prime}_{e}(\phi)}{\nu_{e}(\ell_{v}(\phi))}&\text{ else},\end{dcases}
={max{γe(u(ϕ))u(ϕ),xe(ϕ)νe(v(ϕ))} if eEϕ\Eϕ,xe(ϕ)νe(v(ϕ)) if eEϕ,\displaystyle=\begin{cases}\max\Set{\gamma_{e}(\ell_{u}(\phi))\cdot\ell^{\prime}_{u}(\phi),\frac{x^{\prime}_{e}(\phi)}{\nu_{e}(\ell_{v}(\phi))}}&\text{ if }e\in E^{\prime}_{\phi}\backslash E^{*}_{\phi},\!\!\\ \frac{x^{\prime}_{e}(\phi)}{\nu_{e}(\ell_{v}(\phi))}&\text{ if }e\in E^{*}_{\phi},\end{cases}
=ρe(u(ϕ),xe(ϕ)).\displaystyle=\rho_{e}(\ell^{\prime}_{u}(\phi),x^{\prime}_{e}(\phi)).

This shows (TF3) and finishes the proof. ∎

In order to construct Nash flows over time in time-varying networks, we first have to show that there always exists a thin flow with resetting.

Theorem 4.2 ().

Consider an acyclic graph G=(V,E)G^{\prime}=(V,E^{\prime}) with source ss, sink tt, capacities νe>0\nu_{e}>0, speed ratios γe>0\gamma_{e}>0 and a subset of arcs EEE^{*}\subseteq E^{\prime}, as well as a network inflow r>0r>0. Furthermore, suppose that every node is reachable from ss. Then there exists a thin flow ((xe)eE,(v)vV)\left((x^{\prime}_{e})_{e\in E},(\ell^{\prime}_{v})_{v\in V}\right) with resetting on EE^{*}.

This proof works exactly as the proof for the existence of thin flows in the base model presented by Cominetti et al. [4, Theorem 3]. In addition, a detailed proof utilizing Kakutani’s fixed point theorem is given in the appendix.

5 Constructing Nash Flows Over Time

In the remaining part of this paper we assume that for all eEe\in E the functions νe\nu_{e} and λe\lambda_{e} as well as the network inflow rate function rr are right-constant. In order to show the existence of Nash flows over time in time-varying networks we use the same α\alpha-extension approach as used by Koch and Skutella in [16] for the base model. The key idea is to start with the empty flow over time and expand it step by step by using a thin flow with resetting.

Given a restricted Nash flow over time ff on [0,ϕ][0,\phi], i.e., a Nash flow over time where only the particles in [0,ϕ][0,\phi] are considered, we obtain well-defined earliest arrival times (v(ϕ))vV(\ell_{v}(\phi))_{v\in V} for particle ϕ\phi. Hence, by Lemma 4 we can determine the current shortest paths network Gϕ=(V,Eϕ)G^{\prime}_{\phi}=(V,E^{\prime}_{\phi}) with the resetting arcs EϕE^{*}_{\phi}, the capacities νe(v(ϕ))\nu_{e}(\ell_{v}(\phi)) and speed ratios γe(u(ϕ))\gamma_{e}(\ell_{u}(\phi)) for all arcs e=uvE{e=uv\in E^{\prime}} as well as the network inflow rate r(s(ϕ))r(\ell_{s}(\phi)). By Theorem 4.2 there exists a thin flow ((xe)eE,(v)vV)\left((x^{\prime}_{e})_{e\in E^{\prime}},(\ell^{\prime}_{v})_{v\in V}\right) on GϕG^{\prime}_{\phi} with resetting on EϕE^{*}_{\phi}. For eEϕe\not\in E^{\prime}_{\phi} we set xe0x^{\prime}_{e}\coloneqq 0. We extend the \ell- and xx-functions for some α>0\alpha>0 by

v(ϕ+ξ)v(ϕ)+ξvandxe(ϕ)xe(ϕ)+ξxefor all ξ[0,α)\ell_{v}(\phi+\xi)\coloneqq\ell_{v}(\phi)+\xi\cdot\ell^{\prime}_{v}\quad\text{and}\quad x_{e}(\phi)\coloneqq x_{e}(\phi)+\xi\cdot x^{\prime}_{e}\qquad\text{for all }\xi\in[0,\alpha)

and the in- and outflow rate functions by

fe+(θ)xeu for θ[u(ϕ),u(ϕ+α));fe(θ)xev for θ[v(ϕ),v(ϕ+α)).\displaystyle f_{e}^{+}(\theta)\coloneqq\frac{x^{\prime}_{e}}{\ell^{\prime}_{u}}\text{ for }\theta\in[\ell_{u}(\phi),\ell_{u}(\phi\!+\!\alpha));\qquad\!\!f_{e}^{-}(\theta)\coloneqq\frac{x^{\prime}_{e}}{\ell^{\prime}_{v}}\text{ for }\theta\in[\ell_{v}(\phi),\ell_{v}(\phi\!+\!\alpha)).

We call this extended flow over time α\alpha-extension. Note that u=0\ell^{\prime}_{u}=0 means that [u(ϕ),u(ϕ+α))[\ell_{u}(\phi),\ell_{u}(\phi+\alpha)) is empty, and the same holds for v\ell^{\prime}_{v}.

An α\alpha-extension is a restricted Nash flow over time, which we will prove later on, as long as the α\alpha stays within reasonable bounds. Similar to the base model we have to ensure that resetting arcs stay resetting and non-active arcs stay non-active for all particles in [ϕ,ϕ+α)[\phi,\phi+\alpha). Since the transit times may now vary over time, we have the following conditions for all ξ[0,α)\xi\in[0,\alpha):

v(ϕ)+ξvu(ϕ)ξu\displaystyle\ell_{v}(\phi)+\xi\cdot\ell^{\prime}_{v}-\ell_{u}(\phi)-\xi\cdot\ell^{\prime}_{u} >τe(u(ϕ)+ξu)) for every eEϕ,\displaystyle>\tau_{e}(\ell_{u}(\phi)+\xi\cdot\ell^{\prime}_{u}))\quad\text{ for every }e\in E^{*}_{\phi}, (5)
v(ϕ)+ξvu(ϕ)ξu\displaystyle\ell_{v}(\phi)+\xi\cdot\ell^{\prime}_{v}-\ell_{u}(\phi)-\xi\cdot\ell^{\prime}_{u} <τe(u(ϕ)+ξu)) for every eEEϕ.\displaystyle<\tau_{e}(\ell_{u}(\phi)+\xi\cdot\ell^{\prime}_{u}))\quad\text{ for every }e\in E\setminus E^{\prime}_{\phi}. (6)

Furthermore, we need to ensure that the capacities of all active arcs and the network inflow rate do not change within the phase:

νe(v(ϕ))\displaystyle\nu_{e}(\ell_{v}(\phi)) =νe(v(ϕ)+ξv) for every eEϕ and all ξ[0,α).\displaystyle=\nu_{e}(\ell_{v}(\phi)+\xi\cdot\ell^{\prime}_{v})\quad\text{ for every }e\in E^{\prime}_{\phi}\text{ and all }\xi\in[0,\alpha). (7)
r(s(ϕ))\displaystyle r(\ell_{s}(\phi)) =r(s(ϕ)+ξs) for all ξ[0,α).\displaystyle=r(\ell_{s}(\phi)+\xi\cdot\ell^{\prime}_{s})\quad\;\;\text{ for all }\xi\in[0,\alpha). (8)
Finally, the speed ratios need to stay constant for all active arcs, i.e.,
γe(u(ϕ))\displaystyle\gamma_{e}(\ell_{u}(\phi)) =γe(u(ϕ)+ξu) for every eEϕ and all ξ[0,α).\displaystyle=\gamma_{e}(\ell_{u}(\phi)+\xi\cdot\ell^{\prime}_{u})\quad\text{ for every }e\in E^{\prime}_{\phi}\text{ and all }\xi\in[0,\alpha). (9)

We call an α>0\alpha>0 feasible if it satisfies (5) to (9).

Lemma 5.

Given a restricted Nash flow over time ff on [0,ϕ][0,\phi] then for right-constant capacities and speed limits there always exists a feasible α>0\alpha>0.

Proof.

By Lemma 4 we have that v(ϕ)u(ϕ)>τe(ϕ)\ell_{v}(\phi)-\ell_{u}(\phi)>\tau_{e}(\phi) for all eEϕe\in E^{*}_{\phi} and v(ϕ)u(ϕ)<τe(ϕ)\ell_{v}(\phi)-\ell_{u}(\phi)<\tau_{e}(\phi) for all eEEϕe\in E\setminus E^{\prime}_{\phi}. Since τe\tau_{e} is continuous there is an α1>0\alpha_{1}>0 such that (5) and (6) are satisfied for all ξ[0,α1)\xi\in[0,\alpha_{1}). Since νe\nu_{e}, rr and λe\lambda_{e} are right-constant so is γe\gamma_{e}, and hence, there is an α2>0\alpha_{2}>0 such that (7), (8) and (9) are fulfilled for all ξ[0,α2)\xi\in[0,\alpha_{2}). Clearly, αmin{α1,α2}>0\alpha\coloneqq\min\Set{\alpha_{1},\alpha_{2}}>0 is feasible. ∎

For the maximal feasible α\alpha we call the interval [ϕ,ϕ+α)[\phi,\phi+\alpha) a thin flow phase.

Lemma 6 ().

An α\alpha-extension is a feasible flow over time and the extended \ell-labels coincide with the earliest arrival times, i.e., they satisfy Equation 4 for all φ[ϕ,ϕ+α)\varphi\in[\phi,\phi+\alpha).

The final step is to show that an α\alpha-extension is a restricted Nash flow over time on [0,ϕ+α)[0,\phi+\alpha) and that we can continue this process up to \infty.

Theorem 5.1 ().

Given a restricted Nash flow over time f=(fe+,fe)eEf=(f_{e}^{+},f_{e}^{-})_{e\in E} on [0,ϕ)[0,\phi) in a time-varying network and a feasible α>0\alpha>0 then the α\alpha-extension is a restricted Nash flow over time on [0,ϕ+α)[0,\phi+\alpha).

Proof.

Lemma 3 yields Fe+(u(φ))=Fe(v(φ))F_{e}^{+}(\ell_{u}(\varphi))=F_{e}^{-}(\ell_{v}(\varphi)) for all φ[0,ϕ)\varphi\in[0,\phi), so for ξ[0,α)\xi\in[0,\alpha) it holds that

Fe+(u(ϕ+ξ))=Fe+(u(ϕ))+xeuξu=Fe(v(ϕ))+xevξv=Fe(v(ϕ+ξ)).F_{e}^{+}(\ell_{u}(\phi+\xi))=F_{e}^{+}(\ell_{u}(\phi))+\frac{x^{\prime}_{e}}{\ell^{\prime}_{u}}\cdot\xi\cdot\ell^{\prime}_{u}=F_{e}^{-}(\ell_{v}(\phi))+\frac{x^{\prime}_{e}}{\ell^{\prime}_{v}}\cdot\xi\cdot\ell^{\prime}_{v}=F_{e}^{-}(\ell_{v}(\phi+\xi)).

It follows again by Lemma 3 together with Lemma 6 that the α\alpha-extension is a restricted Nash flow over time on [0,ϕ+α)[0,\phi+\alpha). ∎

Finally, we obtain our main result:

Theorem 5.2 ().

There exists a Nash flow over time in every time-varying network with right-constant speed limits, capacities and network inflow rates.

Proof.

The process starts with the empty flow over time, i.e., a restricted Nash flow over time for [0,0)[0,0). We apply Theorem 5.1 with a maximal feasible α\alpha. If one of the α\alpha is unbounded we are done. Otherwise, we obtain a sequence (fi)i(f_{i})_{i\in\mathbb{N}}, where fif_{i} is a restricted Nash flow over time for [0,ϕi)[0,\phi_{i}), with a strictly increasing sequence (ϕi)i(\phi_{i})_{i\in\mathbb{N}}. In the case that this sequence has a finite limit, say ϕ<\phi_{\infty}<\infty, we define a restricted Nash flow over time ff^{\infty} for [0,ϕ)[0,\phi_{\infty}) by using the point-wise limit of the xx- and \ell-labels, which exists due to monotonicity and boundedness of these functions. Note that there are only finitely many different thin flows, and therefore, the derivatives xx^{\prime} and \ell^{\prime} are bounded. Then the process can be restarted from this limit point. This so called transfinite induction argument works as follows: Let 𝒫G\mathcal{P}_{G} be the set of all particles ϕ0\phi\in\mathbb{R}_{\geq 0} for which there exists a restricted Nash flow over time on [0,ϕ)[0,\phi) constructed as described above. The set 𝒫G\mathcal{P}_{G} cannot have a maximal element because the corresponding Nash flow over time could be extended by using Theorem 5.1. But 𝒫G\mathcal{P}_{G} cannot have an upper bound either since the limit of any convergent sequence would be contained in this set. Therefore, there exists an unbounded increasing sequence (ϕi)i=1𝒫G(\phi_{i})_{i=1}^{\infty}\in\mathcal{P}_{G}. As a restricted Nash flow over time on [0,ϕi+1][0,\phi_{i+1}] contains a restricted Nash flow over time on [0,ϕi][0,\phi_{i}] we can assume that there exists a sequence of nested restricted Nash flow over time. Hence, we can construct a Nash flow over time ff on [0,)[0,\infty) by taking the point-wise limit of the xx- and \ell-labels, completing the proof. ∎

Refer to caption
Refer to caption

  Refer to captionRefer to caption Refer to captionRefer to caption Refer to captionRefer to caption
  Refer to captionRefer to caption
Refer to captionRefer to caption

Figure 5: A Nash flow over time with seven thin flow phases in a time-varying network.

5.0.1 Example.

An example of a Nash flow over time in a time-varying network together with the corresponding thin flows is shown in Figure 5 on the next page. On the top: The network properties before time 88 (left side) and after time 88 (right side). In the middle: There are seven thin flow phases. Note that the third and forth phase (both depicted in the same network) are almost identical and only the speed ratio of arc vtvt changes, which does not influence the thin flow at all. At the bottom: Some key snapshots in time of the resulting Nash flow over time. The current speed limit λvt\lambda_{vt} is visualized by the length of the green arrow and, for θ8\theta\geq 8, the reduced capacity νsu(θ)\nu_{su}(\theta) is displayed by a red bottle-neck.

As displayed at the top the capacity of arc susu drops from 22 to 11 at time 88 and, at the same time, the speed limit of arc vtvt decreases from 12\frac{1}{2} to 16\frac{1}{6}. The first event for particle 44 is due to a change of the speed ratio leading to an increase of t\ell^{\prime}_{t}. For particle 66, the top path becomes active and is taken by all following flow as particles on arc vtvt are still slowed down. For particle 88, the speed ratio at arc vtvt changes back to 11 but, as this arc is inactive, this does not change anything. Particle 1212 is the first to experience the reduced capacity on arc susu. The corresponding queue of this arc increases until the bottom path becomes active. This happens in two steps: first only the path up to node vv becomes active for ϕ=16\phi=16, and finally, the complete path is active from ϕ=20\phi=20 onwards.

6 Conclusion and Open Problems

In this paper, we extended the base model that was introduced by Koch and Skutella, to networks which capacities and speed limits that changes over time. We showed that all central results, namely the existence of dynamic equilibria and their underlying structures in form of thin flow with resetting, can be transfered to this new model. With these new insights it is possible to model more general traffic scenarios in which the network properties are time-dependent. In particular, the flooding evacuation scenario, which was mentioned in the introduction, could not be modeled (not even approximately) in the base model.

There are still a lot of open question concerning time-varying networks. For example, it would be interesting to consider other flows over time in this setting, such as earliest arrival flows or instantaneous dynamic equilibria (see [11]) and show their existence. Can the proof for the bound of the price of anarchy [6] be transfered to this model, or is it possible to construct an example where the price of anarchy is unbounded?

References

  • [1] Bhaskar, U., Fleischer, L., Anshelevich, E.: A stackelberg strategy for routing flow over time. Games and Economic Behavior 92, 232–247 (2015)
  • [2] Cao, Z., Chen, B., Chen, X., Wang, C.: A network game of dynamic traffic. In: Proc. of the 2017 ACM Conf. on Economics and Comp. pp. 695–696 (2017)
  • [3] Cominetti, R., Correa, J., Larré, O.: Existence and uniqueness of equilibria for flows over time. In: Intern. Colloquium on Automata, Languages, and Programming. pp. 552–563. Springer (2011)
  • [4] Cominetti, R., Correa, J., Larré, O.: Dynamic equilibria in fluid queueing networks. Operations Research 63(1), 21–34 (2015)
  • [5] Cominetti, R., Correa, J., Olver, N.: Long term behavior of dynamic equilibria in fluid queuing networks. In: Integer Programming and Combinatorial Optimization. pp. 161–172. Springer (2017)
  • [6] Correa, J., Cristi, A., Oosterwijk, T.: On the price of anarchy for flows over time. In: Proc. of the 2019 ACM Conf. on Economics and Comp. pp. 559–577 (2019)
  • [7] Fleischer, L., Tardos, É.: Efficient continuous-time dynamic network flow algorithms. Operations Research Letters 23(3-5), 71–80 (1998)
  • [8] Ford, L.R., Fulkerson, D.R.: Constructing maximal dynamic flows from static flows. Operations research 6, 419–433 (1958)
  • [9] Ford, L.R., Fulkerson, D.R.: Flows in Networks. Princeton University Press (1962)
  • [10] Gale, D.: Transient flows in networks. The Michigan Mathematical Journal 6(1), 59–63 (1959)
  • [11] Graf, L., Harks, T., Sering, L.: Dynamic flows with adaptive route choice. Mathematical Programming (2020)
  • [12] Harks, T., Peis, B., Schmand, D., Tauer, B., Vargas Koch, L.: Competitive packet routing with priority lists. ACM Transactions on Econo. and Comp. 6(1),  4 (2018)
  • [13] Kakutani, S.: A generalization of brouwer’s fixed point theorem. Duke Mathematical Journal 8, 457–459 (1941)
  • [14] Koch, R.: Routing Games over Time. Ph.D. thesis, Technische Universität Berlin (2012). https://doi.org/10.14279/depositonce-3347
  • [15] Koch, R., Skutella, M.: Nash equilibria and the price of anarchy for flows over time. In: Intern. Symp. on Algorithmic Game Theory. pp. 323–334. Springer (2009)
  • [16] Koch, R., Skutella, M.: Nash equilibria and the price of anarchy for flows over time. Theory of Computing Systems 49(1), 71–97 (2011)
  • [17] Macko, M., Larson, K., Steskal, L.: Braess’s paradox for flows over time. Theory of Computing Systems 53(1), 86–106 (2013)
  • [18] Minieka, E.: Maximal, lexicographic, and dynamic network flows. Operations Research 21(2), 517–527 (1973)
  • [19] Peis, B., Tauer, B., Timmermans, V., Vargas Koch, L.: Oligopolistic competitive packet routing. In: 18th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (2018)
  • [20] Scarsini, M., Schröder, M., Tomala, T.: Dynamic atomic congestion games with seasonal flows. Operations Research 66(2), 327–339 (2018)
  • [21] Sering, L., Skutella, M.: Multi-source multi-sink Nash flows over time. In: 18th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems. vol. 65, pp. 12:1–12:20 (2018)
  • [22] Sering, L., Vargas Koch, L.: Nash flows over time with spillback. In: Proc. of the Thirtieth Annual ACM-SIAM Symp. on Discrete Algo. pp. 935–945. SIAM (2019)
  • [23] Skutella, M.: An introduction to network flows over time. In: Research trends in combinatorial optimization, pp. 451–482. Springer (2009)
  • [24] Vickrey, W.S.: Congestion theory and transport investment. The American Economic Review 59(2), 251–260 (1969)
  • [25] Wardrop, J.G.: Some theoretical aspects of road traffic research. Proc. of the institution of civil engineers 1(5), 767–768 (1952)
  • [26] Wilkinson, W.L.: An algorithm for universal maximal dynamic flows in a network. Operations Research 19(7), 1602–1612 (1971)
  • [27] Yagar, S.: Dynamic traffic assignment by individual path minimization and queuing. Transp. Res. 5(3), 179–196 (1971)

7 Appendix: Technical Proofs

See 1

Proof.

a

  1. (i)

    Consider two points in time θ1<θ2\theta_{1}<\theta_{2}, then τθ1θ2+τe(θ1)\tau\coloneqq\theta_{1}-\theta_{2}+\tau_{e}(\theta_{1}) is strictly smaller than τe(θ2)\tau_{e}(\theta_{2}) since

    θ2θ2+τλe(ξ)dξ=θ2θ1+τe(θ1)λe(ξ)dξ<θ1θ1+τe(θ1)λe(ξ)dξ=1,\int_{\theta_{2}}^{\theta_{2}+\tau}\lambda_{e}(\xi)\mathop{}\!\mathrm{d}\xi=\int_{\theta_{2}}^{\theta_{1}+\tau_{e}(\theta_{1})}\lambda_{e}(\xi)\mathop{}\!\mathrm{d}\xi<\int_{\theta_{1}}^{\theta_{1}+\tau_{e}(\theta_{1})}\lambda_{e}(\xi)\mathop{}\!\mathrm{d}\xi=1,

    where the strict inequality holds, since λe\lambda_{e} is always strictly positive. The last equality follows by the definition of τe(θ1)\tau_{e}(\theta_{1}). Hence, with the definition of τe(θ2)\tau_{e}(\theta_{2}) we have θ1+τe(θ1)<θ2+τe(θ2)\theta_{1}+\tau_{e}(\theta_{1})<\theta_{2}+\tau_{e}(\theta_{2}).

  2. (ii)

    Since θθ+τe(θ)\theta\mapsto\theta+\tau_{e}(\theta) is monotone, Lebesgue’s theorem for the differentiability of monotone functions implies that it is almost everywhere differentiable. The same is then true for τe\tau_{e}. The continuity follows directly from the definition since λe\lambda_{e} is always strictly positive.

  3. (iii)

    By the definition of τe(θ)\tau_{e}(\theta) we have

    0θ+τe(θ)λe(ξ)dξ0θλe(ξ)dξ=1.\int_{0}^{\theta+\tau_{e}(\theta)}\lambda_{e}(\xi)\mathop{}\!\mathrm{d}\xi-\int_{0}^{\theta}\lambda_{e}(\xi)\mathop{}\!\mathrm{d}\xi=1.

    Taking the derivatives of both sides and using Lebesgue’s differentiation theorem together with the chain rule, we obtain

    λe(θ+τe(θ))(1+τe(θ))λe(θ)=0.\lambda_{e}(\theta+\tau_{e}(\theta))\cdot(1+\tau^{\prime}_{e}(\theta))-\lambda_{e}(\theta)=0.

    Since λe\lambda_{e} is always strictly positive, we get

    1+τe(θ)=λe(θ)λe(θ+τe(θ)).1+\tau^{\prime}_{e}(\theta)=\frac{\lambda_{e}(\theta)}{\lambda_{e}(\theta+\tau_{e}(\theta))}.

See 2

Proof.

a

  1. (i)

    This follows directly from the definition of the waiting time qeq_{e}.

  2. (ii)

    By equation (3) we have that fe(ξ)νe(ξ)f_{e}^{-}(\xi)\leq\nu_{e}(\xi) almost everywhere. Hence, we have by definition that qe(θ)q_{e}(\theta) is the minimal value such that

    θ+τe(θ)θ+τe(θ)+qe(θ)νe(ξ)dξ=ze(θ+τe(θ)).\int_{\theta+\tau_{e}(\theta)}^{\theta+\tau_{e}(\theta)+q_{e}(\theta)}\nu_{e}(\xi)\mathop{}\!\mathrm{d}\xi=z_{e}(\theta+\tau_{e}(\theta)).

    Thus, we obtain for ξ[0,qe(θ))\xi\in[0,q_{e}(\theta)) that

    Fe(θ+τe(θ)+ξ)Fe(θ+τe(θ))\displaystyle F_{e}^{-}(\theta+\tau_{e}(\theta)+\xi)-F_{e}^{-}(\theta+\tau_{e}(\theta)) =θ+τe(θ)θ+τe(θ)+ξfe(ξ)dξ\displaystyle=\int_{\theta+\tau_{e}(\theta)}^{\theta+\tau_{e}(\theta)+\xi}f_{e}^{-}(\xi)\mathop{}\!\mathrm{d}\xi
    θ+τe(θ)θ+τe(θ)+ξνe(ξ)dξ\displaystyle\leq\int_{\theta+\tau_{e}(\theta)}^{\theta+\tau_{e}(\theta)+\xi}\nu_{e}(\xi)\mathop{}\!\mathrm{d}\xi
    <ze(θ+τe(θ))\displaystyle<z_{e}(\theta+\tau_{e}(\theta))
    =Fe+(θ)Fe(θ+τe(θ)).\displaystyle=F_{e}^{+}(\theta)-F_{e}^{-}(\theta+\tau_{e}(\theta)).

    Or in short: Fe+(θ)Fe(θ+τe(θ)+ξ)>0F_{e}^{+}(\theta)-F^{-}_{e}(\theta+\tau_{e}(\theta)+\xi)>0 for ξ[0,qe(θ))\xi\in[0,q_{e}(\theta)). Since Fe+F_{e}^{+} is non-decreasing we obtain for all ξ[0,qe(θ))\xi\in[0,q_{e}(\theta)) that

    ze(θ+τe(θ)+ξ)=Fe+(θ+ξ)Fe(θ+τe(θ)+ξ)Fe+(θ)Fe(θ+τe(θ)+ξ)>0.z_{e}(\theta+\tau_{e}(\theta)+\xi)\!=\!F_{e}^{+}(\theta+\xi)-F^{-}_{e}(\theta+\tau_{e}(\theta)+\xi)\!\geq\!F_{e}^{+}(\theta)-F^{-}_{e}(\theta+\tau_{e}(\theta)+\xi)\!>\!0.
  3. (iii)

    By (3) and (ii) we obtain for almost all ξ[θ+τe(θ),θ+τe(θ)+qe(θ)){\xi\in[\theta+\tau_{e}(\theta),\theta+\tau_{e}(\theta)+q_{e}(\theta))} that fe(ξ)=νe(ξ)f_{e}^{-}(\xi)=\nu_{e}(\xi). By the definition of qeq_{e} we have

    Fe(θ+τe(θ)+qe(θ))Fe(θ+τe(θ))\displaystyle F_{e}^{-}(\theta+\tau_{e}(\theta)+q_{e}(\theta))-F_{e}^{-}(\theta+\tau_{e}(\theta)) =θ+τe(θ)θ+τe(θ)+qe(θ)fe(ξ)dξ\displaystyle=\int_{\theta+\tau_{e}(\theta)}^{\theta+\tau_{e}(\theta)+q_{e}(\theta)}f_{e}^{-}(\xi)\mathop{}\!\mathrm{d}\xi
    =θ+τe(θ)θ+τe(θ)+qe(θ)νe(ξ)dξ\displaystyle=\int_{\theta+\tau_{e}(\theta)}^{\theta+\tau_{e}(\theta)+q_{e}(\theta)}\nu_{e}(\xi)\mathop{}\!\mathrm{d}\xi
    =ze(θ+τe(θ))\displaystyle=z_{e}(\theta+\tau_{e}(\theta))
    =Fe+(θ)Fe(θ+τe(θ)).\displaystyle=F_{e}^{+}(\theta)-F_{e}^{-}(\theta+\tau_{e}(\theta)).

    Hence, Fe(Te(θ))=Fe+(θ)F_{e}^{-}(T_{e}(\theta))=F_{e}^{+}(\theta).

  4. (iv)

    Since Fe+(θ1)=Fe+(θ2)F_{e}^{+}(\theta_{1})=F_{e}^{+}(\theta_{2}) we obtain with the monotonicity of FeF_{e}^{-} together with Lemma 1 (i) that

    ze(ξ+τe(ξ))\displaystyle z_{e}(\xi+\tau_{e}(\xi)) =Fe+(ξ)Fe(ξ+τe(ξ))\displaystyle=F_{e}^{+}(\xi)-F_{e}^{-}(\xi+\tau_{e}(\xi))
    Fe+(θ2)Fe(θ2+τe(θ2))=ze(θ2+τe(θ2))>0,\displaystyle\geq F_{e}^{+}(\theta_{2})-F_{e}^{-}(\theta_{2}+\tau_{e}(\theta_{2}))=z_{e}(\theta_{2}+\tau_{e}(\theta_{2}))>0,

    hence, (3) provides fe(ξ)=νe(ξ)f_{e}^{-}(\xi)=\nu_{e}(\xi) for almost all ξ[θ1+τe(θ1),θ2+τe(θ2)]{\xi\in[\theta_{1}+\tau_{e}(\theta_{1}),\theta_{2}+\tau_{e}(\theta_{2})]}.

    Thus, the definition of qeq_{e} implies that qe(θ1)q_{e}(\theta_{1}) equals

    min{q0|θ1+τe(θ1)θ2+τe(θ2)fe(ξ)dξ+θ2+τe(θ2)θ1+τe(θ1)+qνe(ξ)dξ=Fe+(θ1)Fe(θ1+τe(θ1))}\displaystyle\min\Set{q\geq 0}{\begin{array}[]{l}\displaystyle\int_{\theta_{1}+\tau_{e}(\theta_{1})}^{\theta_{2}+\tau_{e}(\theta_{2})}f_{e}^{-}(\xi)\mathop{}\!\mathrm{d}\xi+\int_{\theta_{2}+\tau_{e}(\theta_{2})}^{\theta_{1}+\tau_{e}(\theta_{1})+q}\nu_{e}(\xi)\mathop{}\!\mathrm{d}\xi\\[15.00002pt] \hfill\qquad\qquad=F_{e}^{+}(\theta_{1})-F_{e}^{-}(\theta_{1}+\tau_{e}(\theta_{1}))\end{array}}
    =\displaystyle= min{p0|θ2+τe(θ2)θ2+τe(θ2)+pνe(ξ)dξ=Fe+(θ2)Fe(θ2+τe(θ2))}\displaystyle\min\Set{p\geq 0}{\int_{\theta_{2}+\tau_{e}(\theta_{2})}^{\theta_{2}+\tau_{e}(\theta_{2})+p}\!\!\!\!\nu_{e}(\xi)\mathop{}\!\mathrm{d}\xi=F_{e}^{+}(\theta_{2})\!-\!F_{e}^{-}(\theta_{2}\!+\!\tau_{e}(\theta_{2}))}
    +θ2+τe(θ2)θ1τe(θ1)\displaystyle\hskip 184.9429pt+\theta_{2}+\tau_{e}(\theta_{2})\!-\!\theta_{1}\!-\!\tau_{e}(\theta_{1})
    =\displaystyle= qe(θ2)+θ2+τe(θ2)θ1τe(θ1).\displaystyle\;q_{e}(\theta_{2})+\theta_{2}+\tau_{e}(\theta_{2})-\theta_{1}-\tau_{e}(\theta_{1}).

    Here, we substitute qq by p+θ2+τe(θ2)θ1τe(θ1){p+\theta_{2}+\tau_{e}(\theta_{2})-\theta_{1}-\tau_{e}(\theta_{1})} in order to obtain the first equation. Note that the condition p0p\geq 0 is always satisfied since the right hand side Fe+(θ2)Fe(θ2+τe(θ2))F_{e}^{+}(\theta_{2})-F_{e}^{-}(\theta_{2}+\tau_{e}(\theta_{2})) equals ze(θ2+τe(θ2))z_{e}(\theta_{2}+\tau_{e}(\theta_{2})) and is therefore strictly positive by assumption. Hence, we obtain

    Te(θ1)=θ1+τe(θ1)+qe(θ1)=θ2+τe(θ2)+qe(θ2)=Te(θ2).T_{e}(\theta_{1})=\theta_{1}+\tau_{e}(\theta_{1})+q_{e}(\theta_{1})=\theta_{2}+\tau_{e}(\theta_{2})+q_{e}(\theta_{2})=T_{e}(\theta_{2}).
  5. (v)

    Considering two points in time θ1<θ2\theta_{1}<\theta_{2}, we show that Te(θ1)Te(θ2)T_{e}(\theta_{1})\leq T_{e}(\theta_{2}). Since Fe+F_{e}^{+} is non-decreasing, (iii) implies that

    Fe(Te(θ2))=Fe+(θ2)Fe+(θ1)=Fe(Te(θ1)).F_{e}^{-}(T_{e}(\theta_{2}))=F_{e}^{+}(\theta_{2})\geq F_{e}^{+}(\theta_{1})=F_{e}^{-}(T_{e}(\theta_{1})). (10)

    If this holds with strict inequality, we obtain by monotonicity of FeF_{e}^{-} that Te(θ1)<Te(θ2)T_{e}(\theta_{1})<T_{e}(\theta_{2}). If equation (10) holds with equality we have two cases. If ze(θ2+τe(θ2))>0{z_{e}(\theta_{2}+\tau_{e}(\theta_{2}))>0}, (iv) states that Te(θ1)=Te(θ2)T_{e}(\theta_{1})=T_{e}(\theta_{2}). If ze(θ2+τe(θ2))=0z_{e}(\theta_{2}+\tau_{e}(\theta_{2}))=0, (ii) applied to θ1\theta_{1} implies that ξθ2+τe(θ2)θ1τe(θ1)[0,qe(θ1))\xi\coloneqq\theta_{2}+\tau_{e}(\theta_{2})-\theta_{1}-\tau_{e}(\theta_{1})\not\in[0,q_{e}(\theta_{1})). Since ξ0\xi\geq 0 by Lemma 1 (i) we have ξqe(θ1)\xi\geq q_{e}(\theta_{1}), and thus,

    Te(θ2)=(i)θ2+τe(θ2)θ1+τe(θ1)+qe(θ1)=Te(θ1).T_{e}(\theta_{2})\stackrel{{\scriptstyle\text{\ref{it:q_equiv_z:timedep}}}}{{=}}\theta_{2}+\tau_{e}(\theta_{2})\geq\theta_{1}+\tau_{e}(\theta_{1})+q_{e}(\theta_{1})=T_{e}(\theta_{1}).
  6. (vi)

    The continuity of qeq_{e} follows since νe\nu_{e} is always strictly positive and zez_{e} is continuous, as it is the difference of two continuous functions. Finally, TeT_{e} is continuous since it is the sum of three continuous functions.

    By (v) the function TeT_{e} is non-decreasing for all eEe\in E, and hence, Lebesgue’s theorem for the differentiability of monotone functions states that TeT_{e} is almost everywhere differentiable. Since θθ+τe(θ){\theta\mapsto\theta+\tau_{e}(\theta)} is monotone this also holds for τe\tau_{e} since it is the difference of two almost everywhere differentiable functions. As a sum of almost everywhere differentiable functions, qe(θ)=Te(θ)τe(θ)θq_{e}(\theta)=T_{e}(\theta)-\tau_{e}(\theta)-\theta has this property as well.

  7. (vii)

    The definition of qe(θ)q_{e}(\theta) states that

    0Te(θ)νe(ξ)dξ0θ+τe(θ)νe(ξ)dξ=ze(θ+τe(θ))=Fe+(θ)Fe(θ+τe(θ)).\int_{0}^{T_{e}(\theta)}\nu_{e}(\xi)\mathop{}\!\mathrm{d}\xi-\int_{0}^{\theta+\tau_{e}(\theta)}\nu_{e}(\xi)\mathop{}\!\mathrm{d}\xi=z_{e}(\theta+\tau_{e}(\theta))=F_{e}^{+}(\theta)-F_{e}^{-}(\theta+\tau_{e}(\theta)).

    Taking the derivative on both sides we obtain by using the chain rule that

    νe(Te(θ))Te(θ)νe(θ+τe(θ))(1+τe(θ))=fe+(θ)fe(θ+τe(θ))(1+τe(θ)).\nu_{e}(T_{e}(\theta))\cdot T^{\prime}_{e}(\theta)-\nu_{e}(\theta+\tau_{e}(\theta))\cdot(1+\tau^{\prime}_{e}(\theta))=f_{e}^{+}(\theta)-f_{e}^{-}(\theta+\tau_{e}(\theta))\cdot(1+\tau^{\prime}_{e}(\theta)).

    If qe(θ)>0q_{e}(\theta)>0 we have by equation (3) that fe(θ+τe(θ))=νe(θ+τe(θ))f_{e}^{-}(\theta+\tau_{e}(\theta))=\nu_{e}(\theta+\tau_{e}(\theta)), and therefore, dividing by νe(Te(θ))\nu_{e}(T_{e}(\theta)) (which is strictly positive by assumption) yields

    Te(θ)=fe+(θ)νe(Te(θ)).T^{\prime}_{e}(\theta)=\frac{f_{e}^{+}(\theta)}{\nu_{e}(T_{e}(\theta))}.

    For qe(θ)=0q_{e}(\theta)=0 we have fe(θ+τe(θ))=min{fe+(θ)γe(θ),νe(θ+τe(θ))}f_{e}^{-}(\theta+\tau_{e}(\theta))=\min\Set{\frac{f_{e}^{+}(\theta)}{\gamma_{e}(\theta)},\nu_{e}(\theta+\tau_{e}(\theta))} and Te(θ)=θ+τe(θ)T_{e}(\theta)=\theta+\tau_{e}(\theta). Hence, dividing by νe(θ+τe(θ))=νe(Te(θ))\nu_{e}(\theta+\tau_{e}(\theta))=\nu_{e}(T_{e}(\theta)) and using Lemma 1.(iii) provides

    Te(θ)\displaystyle T^{\prime}_{e}(\theta) =γe(θ)+fe+(θ)νe(Te(θ))min{fe+(θ)γe(θ),νe(Te(θ))}γe(θ)νe(Te(θ))\displaystyle=\gamma_{e}(\theta)+\frac{f_{e}^{+}(\theta)}{\nu_{e}(T_{e}(\theta))}-\min\Set{\frac{f_{e}^{+}(\theta)}{\gamma_{e}(\theta)},\nu_{e}(T_{e}(\theta))}\cdot\frac{\gamma_{e}(\theta)}{\nu_{e}(T_{e}(\theta))}
    =max{γe(θ),fe+(θ)νe(Te(θ))},\displaystyle=\max\Set{\gamma_{e}(\theta),\frac{f_{e}^{+}(\theta)}{\nu_{e}(T_{e}(\theta))}},

    which finishes the proof.

See 4.2

Proof.

Let XX be the compact, convex and non-empty set of all static ss-tt-flows of value 11 and let Γ:X2X\Gamma\colon X\to 2^{X} be defined by

x{yX|ye=0 for all e=uvE with v<ρe(u,xe)},x^{\prime}\mapsto\Set{y^{\prime}\in X}{y^{\prime}_{e}=0\text{ for all }e=uv\in E^{\prime}\text{ with }\ell^{\prime}_{v}<\rho_{e}(\ell^{\prime}_{u},x^{\prime}_{e})},

where (v)vV(\ell^{\prime}_{v})_{v\in V} are the node labels associated with xx^{\prime} uniquely defined by

v={1r if v=s,mine=uvEρe(u,xe) if vV\{s}.\ell^{\prime}_{v}=\begin{cases}\quad\frac{1}{r}&\text{ if }v=s,\\ \min\limits_{e=uv\in E^{\prime}}\rho_{e}(\ell^{\prime}_{u},x^{\prime}_{e})&\text{ if }v\in V\backslash\set{s}.\end{cases} (11)

The existence of a fixed point of Γ\Gamma is provided by Kakutani’s fixed point theorem [13]

Theorem 7.1 (Kakutani’s Fixed Point Theorem).

Let XX be a compact, convex and non-empty subset of n\mathbb{R}^{n} and Γ:X2X\Gamma\colon X\to 2^{X}, such that for every xXx\in X the image Γ(x)\Gamma(x) is non-empty and convex. Suppose the set {(x,y)|yΓ(x)}\Set{(x,y)}{y\in\Gamma(x)} is closed. Then there exists a fixed point xXx^{*}\in X of Γ\Gamma, i.e., xΓ(x)x^{*}\in\Gamma(x^{*}).

All conditions are satisfied:

  • The set Γ(x)\Gamma(x^{\prime}) is non-empty, because there has to be at least one path PP from ss to tt with v=ρe(u,xe)\ell^{\prime}_{v}=\rho_{e}(\ell^{\prime}_{u},x^{\prime}_{e}) for each arc ee on PP. If we set ye=1y_{e}=1 for all arcs ee on PP and set every other value to 0 we obtain an element in Γ(x)\Gamma(x^{\prime}).

  • To see that Γ(x)\Gamma(x^{\prime}) is convex, note that the arcs that can be used for sending flow, i.e., the ones satisfying v=ρe(u,xe)\ell^{\prime}_{v}=\rho_{e}(\ell^{\prime}_{u},x^{\prime}_{e}), are fixed within the set Γ(x)\Gamma(x^{\prime}). Furthermore, every convex combination yy of two elements y1,y2Γ(x)y^{1},y^{2}\in\Gamma(x^{\prime}) only uses arcs that are also used by y1y^{1} or y2y^{2}.

  • In order to show that the function graph {(x,y)|yΓ(x)}\Set{(x^{\prime},y^{\prime})}{y^{\prime}\in\Gamma(x)} is closed let (xn,yn)n(x^{n},y^{n})_{n\in\mathbb{N}} be a sequence within this set, i.e., ynΓ(xn)y^{n}\in\Gamma(x^{n}). Since both sequences, (xn)n(x^{n})_{n\in\mathbb{N}} and (yn)n(y^{n})_{n\in\mathbb{N}}, are contained in the compact set XX they both have a limit xx^{*} and yy^{*} within XX. Let (n)n(\ell^{n})_{n\in\mathbb{N}} be the sequence of associated node labels of (xn)(x^{n}) and \ell^{*} the node label of xx^{*}. Note that the mapping xx^{\prime}\mapsto\ell^{\prime} is continuous, and therefore, it holds that =limnn\ell^{*}=\lim_{n\to\infty}\ell^{n}. We prove that yΓ(x)y^{*}\in\Gamma(x^{*}). Suppose there is an arc e=uvEe=uv\in E^{\prime} with ye>0y^{*}_{e}>0 and v<ρe(u,xe)\ell^{*}_{v}<\rho_{e}(\ell^{*}_{u},x^{*}_{e}). But since ρe\rho_{e} is continuous there has to be an n0n_{0}\in\mathbb{N} such that yen>0y^{n}_{e}>0 and vn<ρe(un,xen)\ell^{n}_{v}<\rho_{e}(\ell^{n}_{u},x^{n}_{e}) for all nn0n\geq n_{0}, which is a contradiction. Hence, {(x,y)|yΓ(x)}\Set{(x^{\prime},y^{\prime})}{y^{\prime}\in\Gamma(x)} is closed.

Since all conditions for Kakutani’s fixed point theorem are satisfied, there has to be a fixed point xx^{*} of Γ\Gamma. Let \ell^{*} be the corresponding node labeling. We show that the pair (x,)(x^{*},\ell^{*}) satisfies the thin flow conditions. Equations TF1 and TF2 follow immediately by (11). For every arc e=uvEe=uv\in E^{\prime} with xe>0x^{*}_{e}>0 it holds that v=ρe(u,xe)\ell^{*}_{v}=\rho_{e}(\ell^{*}_{u},x^{*}_{e}) since xΓ(x)x^{*}\in\Gamma(x^{*}), which shows Equation TF3. Thus, (x,)(x^{*},\ell^{*}) forms a thin flow with resetting, which completes the proof. ∎

See 6

Proof.

Flow conservation on nodes (2) holds since for all θ[v(ϕ),v(ϕ+α)){\theta\in[\ell_{v}(\phi),\ell_{v}(\phi+\alpha))} we have

eδ+(v)fe+(θ)eδ(v)fe(θ)=eδ+(v)xeveδ(v)xev={0if vV{s,t}r(s(ϕ))=(8)θif v=s.\sum_{e\in\delta^{+}(v)}\!\!\!f_{e}^{+}(\theta)-\!\!\!\sum_{e\in\delta^{-}(v)}\!\!\!f_{e}^{-}(\theta)=\!\!\!\sum_{e\in\delta^{+}(v)}\frac{x^{\prime}_{e}}{\ell^{\prime}_{v}}-\!\!\!\sum_{e\in\delta^{-}(v)}\frac{x^{\prime}_{e}}{\ell^{\prime}_{v}}=\begin{cases}0&\text{if }v\in V\setminus\set{s,t}\\ r(\ell_{s}(\phi))\stackrel{{\scriptstyle\text{\eqref{eq:alpha_inrate:timedep}}}}{{=}}\theta&\text{if }v=s.\end{cases}

Next, we show that the feasibility condition (3) is satisfied. For this we first consider arcs ee with xe>0x^{\prime}_{e}>0, which implies eEϕe\in E^{\prime}_{\phi}. By (TF3) we have that vγe(u(ϕ))u\ell^{\prime}_{v}\geq\gamma_{e}(\ell_{u}(\phi))\cdot\ell^{\prime}_{u}. Since γ\gamma is constant during the thin flow phase, so is τ\tau^{\prime}, and therefore, we have for all ξ[0,α)\xi\in[0,\alpha) that

v(ϕ+ξ)\displaystyle\ell_{v}(\phi+\xi) =v(ϕ)+ξv\displaystyle=\ell_{v}(\phi)+\xi\cdot\ell^{\prime}_{v}
v(ϕ)+ξγe(u(ϕ))u\displaystyle\geq\ell_{v}(\phi)+\xi\cdot\gamma_{e}(\ell_{u}(\phi))\cdot\ell^{\prime}_{u}
u(ϕ)+τe(u(ϕ))+ξ(1+τe(u(ϕ))u\displaystyle\geq\ell_{u}(\phi)+\tau_{e}(\ell_{u}(\phi))+\xi\cdot(1+\tau^{\prime}_{e}(\ell_{u}(\phi))\cdot\ell^{\prime}_{u}
=u(ϕ+ξ)+τe(u(ϕ+ξ)).\displaystyle=\ell_{u}(\phi+\xi)+\tau_{e}(\ell_{u}(\phi+\xi)).

In other words, ee stays active during the thin flow phase.

We consider the outflow rate at time θ+τe(θ)\theta+\tau_{e}(\theta) for θ[u(ϕ),u(ϕ+α))\theta\in[\ell_{u}(\phi),\ell_{u}(\phi+\alpha)). In the case of θ+τe(θ)<v(ϕ)\theta+\tau_{e}(\theta)<\ell_{v}(\phi) the feasibility condition follows from prior phases. Otherwise, θ+τe(θ)[v(ϕ),v(ϕ+α))\theta+\tau_{e}(\theta)\in[\ell_{v}(\phi),\ell_{v}(\phi+\alpha)), and therefore,

fe(θ+τe(θ))\displaystyle f_{e}^{-}(\theta+\tau_{e}(\theta)) =xev=(TF3)xeρe(u,xe)\displaystyle=\frac{x^{\prime}_{e}}{\ell^{\prime}_{v}}\stackrel{{\scriptstyle\text{\eqref{eq:l'_v_tight:timedep}}}}{{=}}\frac{x^{\prime}_{e}}{\rho_{e}(\ell^{\prime}_{u},x^{\prime}_{e})}
={min{xeγe(u(ϕ))u,νe(v(ϕ))} if eEϕEϕ,νe(v(ϕ)) else,\displaystyle=\begin{cases}\min\Set{\frac{x^{\prime}_{e}}{\gamma_{e}(\ell_{u}(\phi))\cdot\ell^{\prime}_{u}},\nu_{e}(\ell_{v}(\phi))}&\text{ if }e\in E^{\prime}_{\phi}\setminus E^{*}_{\phi},\\ \nu_{e}(\ell_{v}(\phi))&\text{ else,}\end{cases}
={min{fe+(θ)γe(θ),νe(θ+τe(θ))} if qe(θ)=0,νe(θ+τe(θ)) else.\displaystyle=\begin{cases}\min\Set{\frac{f_{e}^{+}(\theta)}{\gamma_{e}(\theta)},\nu_{e}(\theta+\tau_{e}(\theta))}&\text{ if }q_{e}(\theta)=0,\\ \nu_{e}(\theta+\tau_{e}(\theta))&\text{ else.}\end{cases}

In the case that xe=0x^{\prime}_{e}=0 we either have v=0\ell^{\prime}_{v}=0, but then there is nothing to show since the interval [v(ϕ),v(ϕ+α))[\ell_{v}(\phi),\ell_{v}(\phi+\alpha)) would be empty, or v>0\ell^{\prime}_{v}>0, which means by (TF2) that either ee is not active, or it is active but non-resetting. In both cases we have qe(u(θ))=0q_{e}(\ell_{u}(\theta))=0 and since fe+(u(θ))=0f^{+}_{e}(\ell_{u}(\theta))=0 for all θ[u(ϕ,u(ϕ+α))\theta\in[\ell_{u}(\phi,\ell_{u}(\phi+\alpha)) the queue stays empty during this phase. (3) follows since fe(θ+τe(θ))=xev=0=fe+(θ){f_{e}^{-}(\theta+\tau_{e}(\theta))=\frac{x^{\prime}_{e}}{\ell^{\prime}_{v}}=0=f^{+}_{e}(\theta)} holds for all θ[u(ϕ,u(ϕ+α))\theta\in[\ell_{u}(\phi,\ell_{u}(\phi+\alpha)). Altogether, we showed that the α\alpha-extension is indeed a feasible flow over time.

It remains to show that Equation 4 holds, which implies that the extended \ell-functions denote the earliest arrival times. First of all we have

0s(ϕ+ξ)r(ξ)dξ=ϕ+s(ϕ)s(ϕ+ξ)r(ξ)dξ=ϕ+r(s(ϕ))sξ=ϕ+ξ.\int_{0}^{\ell_{s}(\phi+\xi)}r(\xi)\mathop{}\!\mathrm{d}\xi=\phi+\int_{\ell_{s}(\phi)}^{\ell_{s}(\phi+\xi)}r(\xi)\mathop{}\!\mathrm{d}\xi=\phi+r(\ell_{s}(\phi))\cdot\ell^{\prime}_{s}\cdot\xi=\phi+\xi.

Since rr is always strictly positive, s(ϕ)\ell_{s}(\phi) is the minimal value with this property, which shows (4) for v=sv=s. For vsv\neq s we distinguish between three cases for every given arc e=uvEe=uv\in E.

Case 1:

eE\Eϕe\in E\backslash E^{\prime}_{\phi}.
Since α\alpha satisfies (6) it is satisfied for all ξ[0,α)\xi\in[0,\alpha), and hence,

v(ϕ+ξ)=v(ϕ)+ξv\displaystyle\ell_{v}(\phi+\xi)=\ell_{v}(\phi)+\xi\cdot\ell^{\prime}_{v} (6)u(ϕ)+ξu+τe(u(ϕ)+ξu)\displaystyle\!\stackrel{{\scriptstyle\eqref{eq:alpha_others:timedep}}}{{\leq}}\!\ell_{u}(\phi)+\xi\cdot\ell^{\prime}_{u}+\tau_{e}(\ell_{u}(\phi)+\xi\cdot\ell^{\prime}_{u})
u(ϕ+ξ)+τe(u(ϕ+ξ))Te(u(ϕ+ξ)).\displaystyle\leq\ell_{u}(\phi+\xi)+\tau_{e}(\ell_{u}(\phi+\xi))\leq T_{e}(\ell_{u}(\phi+\xi)).
Case 2:

eEϕ\Eϕe\in E^{\prime}_{\phi}\backslash E^{*}_{\phi} and γe(u(ϕ))uxeνe(v(ϕ))\gamma_{e}(\ell_{u}(\phi))\cdot\ell^{\prime}_{u}\geq\frac{x^{\prime}_{e}}{\nu_{e}(\ell_{v}(\phi))}.
Since ee is active we have v(ϕ)=Te(u(ϕ))=u(ϕ)+τe(u(ϕ))\ell_{v}(\phi)=T_{e}(\ell_{u}(\phi))=\ell_{u}(\phi)+\tau_{e}(\ell_{u}(\phi)) and (TF2) implies vγe(u(ϕ))u\ell^{\prime}_{v}\leq\gamma_{e}(\ell_{u}(\phi))\cdot\ell^{\prime}_{u}. No queue builds up as fe+(u(ϕ+ξ))=xeuνe(v(ϕ)){f_{e}^{+}(\ell_{u}(\phi+\xi))=\frac{x^{\prime}_{e}}{\ell^{\prime}_{u}}\leq\nu_{e}(\ell_{v}(\phi))}, which means ze(u(ϕ+ξ)+τe(u(ϕ)))=0z_{e}(\ell_{u}(\phi+\xi)+\tau_{e}(\ell_{u}(\phi)))=0 for all ξ(0,α]\xi\in(0,\alpha]. Combining these yields

v(ϕ+ξ)\displaystyle\ell_{v}(\phi+\xi) (TF2)v(ϕ)+ξγe(u(ϕ))u\displaystyle\stackrel{{\scriptstyle\eqref{eq:l'_v_min:timedep}}}{{\leq}}\ell_{v}(\phi)+\xi\cdot\gamma_{e}(\ell_{u}(\phi))\cdot\ell^{\prime}_{u}
=u(ϕ)+τe(u(ϕ))+ξ(1+τe(u(ϕ))u\displaystyle\;\;\,=\;\;\ell_{u}(\phi)+\tau_{e}(\ell_{u}(\phi))+\xi\cdot(1+\tau^{\prime}_{e}(\ell_{u}(\phi))\cdot\ell^{\prime}_{u}
=u(ϕ+ξ)+τe(u(ϕ+ξ))\displaystyle\;\;\,=\;\;\ell_{u}(\phi+\xi)+\tau_{e}(\ell_{u}(\phi+\xi))
=Te(u(ϕ+ξ)).\displaystyle\;\;\,=\;\;T_{e}(\ell_{u}(\phi+\xi)).
Case 3:

eEϕe\in E^{*}_{\phi} or (eEϕ and γe(u(ϕ))u<xeνe(v(ϕ)))\left(e\in E^{\prime}_{\phi}\text{ and }\gamma_{e}(\ell_{u}(\phi))\cdot\ell^{\prime}_{u}<\frac{x^{\prime}_{e}}{\nu_{e}(\ell_{v}(\phi))}\right).
Arc ee is active ,i.e., v(ϕ)=Te(u(ϕ))\ell_{v}(\phi)=T_{e}(\ell_{u}(\phi)). We have ρe(u,xe)=xeνe(v(ϕ))\rho_{e}(\ell^{\prime}_{u},x^{\prime}_{e})=\frac{x^{\prime}_{e}}{\nu_{e}(\ell_{v}(\phi))}, and hence, (TF2) implies vxeνe(v(ϕ))\ell^{\prime}_{v}\leq\frac{x^{\prime}_{e}}{\nu_{e}(\ell_{v}(\phi))}. Lemma 2 (vii) yields

Te(u(ϕ))=fe+(u(ϕ))νe(v(ϕ))=xeuνe(v(ϕ))T^{\prime}_{e}(\ell_{u}(\phi))=\frac{f_{e}^{+}(\ell_{u}(\phi))}{\nu_{e}(\ell_{v}(\phi))}=\frac{x^{\prime}_{e}}{\ell^{\prime}_{u}\cdot\nu_{e}(\ell_{v}(\phi))}

since either qe(u(ϕ))>0q_{e}(\ell_{u}(\phi))>0 (if eEe\in E^{*}) or, in the case of eEϕe\notin E^{*}_{\phi}, we have

fe+(u(ϕ))νe(v(ϕ))=xeuνe(v(ϕ))>γe(u(ϕ)).\frac{f_{e}^{+}(\ell_{u}(\phi))}{\nu_{e}(\ell_{v}(\phi))}=\frac{x^{\prime}_{e}}{\ell^{\prime}_{u}\cdot\nu_{e}(\ell_{v}(\phi))}>\gamma_{e}(\ell_{u}(\phi)).

Hence, for all ξ(0,α]\xi\in\>(0,\alpha] we obtain

v(ϕ+ξ)=(TF2)v(ϕ)+ξv\displaystyle\ell_{v}(\phi+\xi)\!\stackrel{{\scriptstyle\text{\eqref{eq:l'_v_min:timedep}}}}{{=}}\!\ell_{v}(\phi)+\xi\cdot\ell^{\prime}_{v} v(ϕ)+ξxeνe\displaystyle\leq\ell_{v}(\phi)+\xi\cdot\frac{x^{\prime}_{e}}{\nu_{e}}
=Te(u(ϕ))+ξTe(u(ϕ))v=Te(u(ϕ+ξ)).\displaystyle=T_{e}(\ell_{u}(\phi))+\xi\cdot T^{\prime}_{e}(\ell_{u}(\phi))\cdot\ell^{\prime}_{v}=T_{e}(\ell_{u}(\phi+\xi)).

This shows that there is no arc with an exit time earlier than the earliest arrival time, and therefore, the left hand side of (4) is always smaller or equal to the right hand side.

It remains to show that the equation holds with equality. For every node vV{s}v\in V\setminus\set{s} there is at least one arc eEe\in E^{\prime} with v=ρe(u,xe)\ell^{\prime}_{v}=\rho_{e}(\ell^{\prime}_{u},x^{\prime}_{e}) in the thin flow due to (TF2). No matter if this arc belongs to Case 2 or Case 3 the corresponding equation holds with equality, which shows for all ξ(0,α]\xi\in(0,\alpha] that

v(ϕ+ξ)=mine=uvETe(u(ϕ+ξ)).\ell_{v}(\phi+\xi)=\min_{e=uv\in E}T_{e}(\ell_{u}(\phi+\xi)).

This shows that (4) is also satisfied for vsv\neq s, which completes the proof. ∎

Lemma 7 (Differentiation rule for a minimum).

For every element ee of a finite set EE let Te:0T_{e}\colon\mathbb{R}_{\geq 0}\rightarrow\mathbb{R} be a function that is differentiable almost everywhere and let (θ)mineETe(θ)\ell(\theta)\coloneqq\min_{e\in E}T_{e}(\theta) for all θ0\theta\geq 0. It holds that ll is almost everywhere differentiable with

(θ)=mineEθTe(θ)\ell^{\prime}(\theta)=\min_{e\in E^{\prime}_{\theta}}T^{\prime}_{e}(\theta) (12)

for almost all θ0\theta\geq 0 where Eθ{eE|(θ)=Te(θ)}E^{\prime}_{\theta}\coloneqq\set{e\in E}{\ell(\theta)=T_{e}(\theta)}.

Proof.

Let ϕ0\phi\geq 0 such that all TeT_{e}, for all eEe\in E, are differentiable, which is almost everywhere. Since all functions TeT_{e} are continuous at ϕ\phi we have for sufficiently small ε>0\varepsilon>0 that (ϕ+ξ)=mineEϕTe(ϕ+ξ)\ell(\phi+\xi)=\min_{e\in E^{\prime}_{\phi}}T_{e}(\phi+\xi) for all ξ[ϕ,ϕ+ε]\xi\in[\phi,\phi+\varepsilon]. It follows that

limξ 0(ϕ+ξ)(ϕ)ξ\displaystyle\lim_{\xi\,\searrow\,0}\frac{\ell(\phi+\xi)-\ell(\phi)}{\xi} =limξ 0mineEϕTe(ϕ+ξ)(ϕ)ξ\displaystyle=\lim_{\xi\,\searrow\,0}\min_{e\in E^{\prime}_{\phi}}\frac{T_{e}(\phi+\xi)-\ell(\phi)}{\xi}
=mineEϕlimξ 0Te(ϕ+ξ)Te(ϕ)ξ=mineEϕTe(ϕ).\displaystyle=\min_{e\in E^{\prime}_{\phi}}\lim_{\xi\,\searrow\,0}\frac{T_{e}(\phi+\xi)-T_{e}(\phi)}{\xi}=\min_{e\in E^{\prime}_{\phi}}T^{\prime}_{e}(\phi).

Note that every point ϕ\phi where all TeT_{e} are differentiable, but for which the left derivative of \ell does not coincide with the right derivative of \ell, is a proper crossing of at least two TeT_{e} functions. Therefore, these points are isolated and form a null set. Hence, we have (ϕ)=mineEϕTe(ϕ)\ell^{\prime}(\phi)=\min_{e\in E^{\prime}_{\phi}}T^{\prime}_{e}(\phi) for almost all ϕ0\phi\in\mathbb{R}_{\geq 0}. ∎