Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: A Finite Time Combinatorial Algorithm for Instantaneous Dynamic
  Equilibrium Flows   Instantaneous dynamic equilibrium (IDE) is a standard game-theoretic concept
in dynamic traffic assignment in which individual flow particles myopically
select en route currently shortest paths towards their destination. We analyze
IDE within the Vickrey bottleneck model, where current travel times along a
path consist of the physical travel times plus the sum of waiting times in all
the queues along a path. Although IDE have been studied for decades, several
fundamental questions regarding equilibrium computation and complexity are not
well understood. In particular, all existence results and computational methods
are based on fixed-point theorems and numerical discretization schemes and no
exact finite time algorithm for equilibrium computation is known to date. As
our main result we show that a natural extension algorithm needs only finitely
many phases to converge leading to the first finite time combinatorial
algorithm computing an IDE. We complement this result by several hardness
results showing that computing IDE with natural properties is NP-hard.

16
The categories of this paper are: stat
11
The categories of this paper are: hep-lat
18
The categories of this paper are: econ
35
The categories of this paper are: mtrl-th
12
The categories of this paper are: nucl-th
0
The categories of this paper are: hep-ph
9
The categories of this paper are: nlin
6
The categories of this paper are: astro-ph
21
The categories of this paper are: adap-org
13
The categories of this paper are: quant-ph
26
The categories of this paper are: bayes-an
7
The categories of this paper are: hep-th
27
The categories of this paper are: comp-gas
25
The categories of this paper are: patt-sol
29
The categories of this paper are: funct-an
34
The categories of this paper are: chem-ph