Pith. sign in

REVIEW 3 major objections 5 minor 62 references

Detection of coordinated fleet vehicles in route choice urban games. Part I. Inverse fleet assignment theory

T0 review · 3 major / 5 minor · reviewed 2026-08-06 · deepseek-v4-flash

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗

Pith's one-line read Selfish coordinated fleets can be detected from total route flows.

desk verdict The core inverse fleet-assignment theorem is correct and genuinely new, but the abstract oversells the 'no otherwise' claim and the detection story rests on an exact-information myopic assumption that the paper itself admits is not fully realistic. read the letter →

arxiv 2506.22966 v1 pith:UJY2QQ6F submitted 2025-06-28 math.OC cs.MAecon.TH

Grzegorz Jamróz , Rafa{l} Kucharski This is my paper
classification math.OCcs.MAecon.TH MSC 90B2090C2591A10
keywords coordinatedfleetsofvehiclescollectiveroutinginverseproblemsdetectionrouteassignmentautonomousStackelbergandNashequilibrium
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

The paper asks whether a city that observes only the total number of vehicles on each route can work out how many of those vehicles belong to a centrally coordinated fleet, assuming it knows the fleet size and the fleet's routing objective. The authors prove an inverse fleet assignment theorem: when the fleet's objective weights its own travel time more heavily than human drivers' travel time ($\lambda_{\mathrm{HDV}} < \lambda_{\mathrm{CRV}}$), and the gradient of the travel-time map is positive definite, the total route flow determines at most one fleet flow. This makes fleet flows identifiable for selfish, malicious, and disruptive fleet behaviours, but not for social or altruistic ones. The result matters because coordinated fleets can degrade traffic for everyone while being invisible in aggregate counts, and the theorem shows detection is theoretically possible before any vehicle-level identification.

What carries the argument

The load-bearing object is the Route Fleet Assignment Operator $G$, which sends each human-driven flow $q_{\mathrm{HDV}}$ to the set of fleet flows of fixed size that minimize the objective $F(h,f) = (\lambda_{\mathrm{HDV}} h + \lambda_{\mathrm{CRV}} f)\cdot t(h+f)$. The proof of invertibility compares two candidate fleet flows $f^*$ and $\tilde f$ at the same total flow $q$; subtracting their first-order optimality conditions yields $-(\lambda_{\mathrm{CRV}} - \lambda_{\mathrm{HDV}})\, g \cdot (\nabla t(q) g) \ge 0$ for $g = \tilde f - f^*$. Since $\nabla t(q)$ is positive definite and $\lambda_{\mathrm{CRV}} - \lambda_{\mathrm{HDV}} > 0$, the inequality forces $g = 0$. Thus the mechanism is a coercive quadratic form supplied by the travel-time gradient, combined with the sign condition on the fleet's behavioural weights.

What would settle it

Take a two-route network with strictly increasing convex BPR delay functions, fix a fleet size and a selfish objective $(\lambda_{\mathrm{HDV}}, \lambda_{\mathrm{CRV}}) = (0,1)$, and scan all decompositions of a fixed total flow $q$ into HDV and CRV parts. If any two distinct CRV flows both satisfy the first-order conditions for minimizing $F$ and give the same total $q$, the theorem's injectivity claim is false; the theorem predicts no such pair exists. A numerical continuation in $q$ would also test the Lipschitz bound, since the ratio of changes in recovered CRV flow to changes in total flow should stay bounded by the constant in inequality (8).

Watch

Extended reading notes

Core claim

The central result is Theorem 18. For continuously differentiable route delay functions with positive definite gradient matrix, if $\lambda_{\mathrm{HDV}} < \lambda_{\mathrm{CRV}}$ then for every total flow $q$ there is at most one fleet flow $q_{\mathrm{CRV}}$ minimizing the one-day fleet objective. Equivalently, the forward fleet assignment operator $H = \mathrm{Id} + G$ is injective on its domain, so the inverse map from total counts to fleet route flows is single-valued; Theorem 22 adds that this inverse is continuous, hence stable under small measurement errors. For link-additive networks the same conclusion holds for fleet link flows even when routes are linearly dependent (Theorem 28), and a version holds for dependent link delay functions (Theorem 31) and for multiple origin–destination pairs (Theorem 38).

Load-bearing premise

The theorem assumes the fleet controller knows that day's human-driven flows exactly before assigning its vehicles and optimizes only that one day's objective; if the fleet plans over multiple days, anticipates human reactions, or acts on imperfect predictions, the identification result no longer applies.

Editorial extensions

If this is right

  • Cities can in principle recover CRV route flows from aggregate loop or count data for selfish, malicious, disruptive, and competitive fleet objectives, without identifying individual vehicles.
  • The recovery is stable: the Lipschitz continuity of the inverse means small counting errors translate to small errors in the estimated fleet flow, under the theorem's assumptions.
  • For networks with linearly dependent routes, the city can still recover fleet link flows uniquely, even when multiple route-flow decompositions give the same link counts.
  • Social and altruistic fleets are inherently undetectable from total flows: the same total assignment can arise from many different fleet splits.
  • The discrete version holds approximately: if the fleet assigns by rounding a continuous local minimizer, the recovered HDV flow is close to the true one, with error controlled by the rounding size and the inverse's Lipschitz constant.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • If fleet controllers anticipate detection, the myopic strategy may become a deliberate choice: Appendix A's observation that myopic routing avoids the chaotic mixed strategies of optimal Stackelberg routing suggests a detection-averse fleet would stay inside the regime where the inverse theorem works, not escape it.
  • The theory could plausibly extend to multiple fleets with distinct objectives, but the paper leaves that open; a natural test is whether the injectivity argument survives when $G$ is replaced by a sum of fleet-specific assignment operators with different $(\lambda_{\mathrm{HDV}}, \lambda_{\mathrm{CRV}})$.
  • The positive-definiteness condition is the same one that guarantees uniqueness of user equilibrium, so empirical networks with separable BPR-like delays will typically satisfy it; the practical bottleneck is not the mathematics but the assumption that the city knows the fleet's objective exactly.
  • A concrete simulation test: in a day-to-day route choice model with adaptive HDVs, estimate fleet flows by the inverse theorem while the fleet uses predicted rather than actual HDV flows; the degradation with prediction error would quantify how far the baseline assumption can be pushed.
Share X Bluesky LinkedIn Reddit HN

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Referee Report

3 major / 5 minor

Summary. The paper introduces and analyzes the inverse fleet assignment problem: given the total route (or link) flows of a mixed human/fleet system, the fleet size, and the fleet's objective weights (λ_HDV, λ_CRV), can one uniquely recover the fleet's route flows? The main result, Theorem 18, states that if λ_HDV < λ_CRV and the travel-time gradient matrix ∇t(q) is positive definite, then the observed total flow can arise from at most one fleet flow. The authors extend this to link-additive systems with linearly dependent routes (Theorem 28), dependent link-delay functions (Theorem 31), and multiple OD pairs (Theorem 38), and they prove a continuity estimate for the inverse operator in Theorem 22. They also give a discrete rounding pipeline (Proposition 40), counterexamples for social and altruistic fleets, and a comparison of myopic routing with Stackelberg and Nash routing in Appendix A.

Significance. If the behavioral premises are granted, the paper provides a self-contained, parameter-free uniqueness theorem for a novel inverse problem: no fitted parameters are introduced, and the proof follows directly from first-order optimality conditions of the fleet's stated objective. The extensions to link flows, dependent routes, and multiple OD pairs broaden the applicability considerably, and the continuity estimate is useful for stability statements. The paper also makes a helpful conceptual contribution by showing that recoverability is tied to the fleet being more selfish than altruistic. However, the central detection claim inherits two load-bearing qualifications: the exact-information myopic behavioral model and the fact that the 'no otherwise' side of the dichotomy is not fully proved. With those qualifications made explicit, the mathematical contribution is valuable and publishable.

major comments (3)
  1. [Abstract; §1.3; Corollary 19] The stated dichotomy—'yes' for myopic strategies that are more selfish than altruistic and 'no' otherwise—is stronger than what is proved. Theorem 18 establishes the positive direction for λ_HDV < λ_CRV. The negative direction is supported only by Examples 2 and 3, which cover the social (λ_HDV = λ_CRV) and altruistic (λ_HDV > 0, λ_CRV = 0) cases; no argument is given for the full parameter region λ_HDV ≥ λ_CRV. In fact, when λ_HDV = λ_CRV, the objective in (4) equals λ q·t(q), independent of f, so non-uniqueness is immediate, but this still does not prove 'no' for every strategy in that region. Moreover, in degenerate networks such as a single-route network, the inverse is trivially unique for every λ, so 'no otherwise' cannot be a universal statement. The abstract and Corollary 19 should be rephrased as a conditional or existence-of-failure statement, or supplemented by a complete characterization.
  2. [§1.2, remark i; Appendix A; Theorem 18] The detection interpretation rests on the assumption that the fleet controller knows the realized HDV flow exactly before assigning fleet vehicles and then minimizes the one-day objective. The authors themselves call this 'hardly fully realistic' in Section 1.2, remark i, and Appendix A suggests that the controller may predict HDV flows from previous days. If the controller acts on predicted or noisy HDV flows, the observed total flow q need not satisfy the fixed-point inclusion (4) used in Theorem 18, and Theorem 22 bounds the recovery error only for exact fixed points. Thus the central claim that a city can determine fleet route flows is conditional on this exact-information myopic behavior. The paper should state this limitation in the abstract and conclusions, or extend the analysis (e.g., Theorem 22 or Proposition 40) to provide an error bound under prediction error.
  3. [Proposition 11(i)] Proposition 11(i) is false as stated. For an altruistic fleet (λ_HDV > 0, λ_CRV = 0) with independent links and at least two links carrying zero HDV flow, any distribution of the fleet among those zero-HDV links yields the same objective value, so Γ(η) is not a singleton. The conclusion 'Consequently, Γ(ηHDV) is a one-element set' therefore needs an additional hypothesis, for example λ_CRV > 0 or strict convexity of the objective in the relevant variables. This error does not affect the proof of Theorem 18, but it is a technical mistake in a stated result and should be corrected.
minor comments (5)
  1. [Theorem 22 proof] The line 'Setting g := −g# = g* = f# − f*' is inconsistent; the intended definition appears to be g# = f* − f# so that −g# = g* = f# − f*. Also, since ∇t(q) need not be symmetric (as in the dependent-link example of Appendix C.3), ρ(∇t) should be defined as the smallest eigenvalue of the symmetric part of ∇t(q), consistently with Definition 17.
  2. [Proposition 40] Step 5 of Proposition 40 assumes that a point qcity minimizing the distance from q to the image of H exists; since the image of the continuous fleet assignment operator need not be closed, the existence of such a projection should be justified or an additional assumption stated.
  3. [Appendix A, Example 47] The notation qHDV is used both for the vector of HDV flows and for the scalar total HDV flow in expressions such as qHDV = (qHDV/2, qHDV/2); this should be disambiguated.
  4. [Appendix C.2] The displayed 4x4 matrix for ∇t(q) in the network '8' example is garbled, with unclear alignment of the entries; please reformat it for readability.
  5. [Various] A proofreading pass is needed for typographical errors, including 'Defintion' (Definition 8), 'funtion' (Definition 8), 'finite-dimentional' (Definition 14), 'sastisfy' (Theorem 22 proof), 'reserach' (§3.4), and 'continous' (Example 42).

Circularity Check

0 steps flagged · score 0.0 of 10

No significant circularity: Theorem 18 is proven from the stated first-order conditions, and prior self-citations are motivational only.

full rationale

The paper's central claim, Theorem 18, is a direct mathematical proof, not a fitted or self-referential derivation. It defines the fleet assignment operator G and the forward map H via the fleet's stated myopic objective (1)/(2), and then proves uniqueness of the fixed-point equation qCRV ∈ G(q−qCRV) using the first-order inequalities (5) and (6). Summing these inequalities for two candidate minimizers yields −(λCRV−λHDV) g·∇t(q)g ≥ 0, which contradicts positive definiteness of ∇t(q) when λCRV > λHDV unless g=0. No fitted parameter, no calibrated input, and no external benchmark is involved; the proof is self-contained in the sense that the conclusion follows from the assumed objective and the stated monotonicity condition. The inverse problem (Problem 1) is not defined in terms of the conclusion; it asks whether the mapping q→qCRV is single-valued, and Theorem 18 provides the answer. Self-citations to [25] appear only as motivation for the form of the objective, for the observation that coordinated routing can degrade traffic, and for qualitative convergence remarks in Appendix A; none of these is load-bearing for Theorems 18, 22, 28, 31, or 38. External citations such as Smith [39], Dafermos [14], and Watling [48] are used only to note a known analogy between positive definiteness and uniqueness of user equilibrium, not as an imported uniqueness theorem for this paper's result. The realism caveat in Section 1.2, remark i ('this assumption, although hardly fully realistic, seems to be a well-justified baseline') and the Appendix A statement that the prediction mechanism 'does not play any role in this paper... as long as it is precise' are openly stated behavioral assumptions. They limit the applicability of the detection interpretation, but they are not hidden circular steps: the theorem is conditional on the myopic exact-knowledge model, and the paper does not claim the theorem holds outside that model. The paper also honestly lists open problems (Section 4, items i–vi), including characterization of the image of the forward operator and the discrete inverse problem, and Appendix C provides explicit networks where the inverse theory does not apply, showing the conditions are not vacuous. Overall, the derivation chain is self-contained and exhibits no circularity; the strongest reasonable finding is a non-finding with score 0.

Assumptions & free parameters 0 free parameters · 6 assumptions · 0 invented entities

The paper's central claim rests on no fitted parameters: λHDV and λCRV are given strategy labels, qCRV is a given input, and delay functions are assumed from a standard class. The main axiomatic load is the behavioral assumption of exact myopic optimization and the mathematical condition of positive definiteness of the travel-time Jacobian. No new entities are introduced.

assumptions (6)
  • domain assumption Route and link delay functions are continuous, strictly increasing, convex, and twice continuously differentiable where needed.
    Used throughout, e.g. Propositions 10 and 11 and Theorems 18 and 22; BPR functions are cited as standard examples.
  • domain assumption The gradient matrix ∇t(q) or ∇τ(a) is positive definite at the observed flows, equivalently routes are linearly independent in link-additive systems.
    Core condition in Theorem 18, Theorem 22, and Theorem 31; Proposition 27 shows it holds for strictly increasing link delays and linearly independent routes.
  • domain assumption The city knows the fleet size qCRV and the fleet objective parameters λHDV and λCRV.
    Stated in Problem 1 and Section 1.2; the inverse problem is underdetermined otherwise.
  • domain assumption The fleet controller myopically optimizes the one-day objective with exact knowledge of HDV flows before assigning fleet vehicles.
    Section 1.2 remark i); this is the defining behavior that makes the first-order conditions in Theorem 18 valid.
  • domain assumption Real-valued continuous flows approximate large systems; the discrete case is addressed separately.
    Section 1.3 and Section 3.3.
  • standard math Standard results of finite-dimensional convex analysis, first-order optimality conditions, and compactness are used.
    Used in proofs of Propositions 10 and 15 and Theorem 18.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Detection of coordinated fleet vehicles in route choice urban games. Part I. Inverse fleet assignment theory." pith.science (2026). https://pith.science/paper/UJY2QQ6F

@misc{pith2026250622966,
  author       = {Pith},
  title        = {Pith review of: Detection of coordinated fleet vehicles in route choice urban games. Part I. Inverse fleet assignment theory},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/UJY2QQ6F}},
  note         = {Machine review of arXiv:2506.22966}
}
read the original abstract

Detection of collectively routing fleets of vehicles in future urban systems may become important for the management of traffic, as such routing may destabilize urban networks leading to deterioration of driving conditions. Accordingly, in this paper we discuss the question whether it is possible to determine the flow of fleet vehicles on all routes given the fleet size and behaviour as well as the combined total flow of fleet and non-fleet vehicles on every route. We prove that the answer to this Inverse Fleet Assignment Problem is 'yes' for myopic fleet strategies which are more 'selfish' than 'altruistic', and 'no' otherwise, under mild assumptions on route/link performance functions. To reach these conclusions we introduce the forward fleet assignment operator and study its properties, proving that it is invertible for 'bad' objectives of fleet controllers. We also discuss the challenges of implementing myopic fleet routing in the real world and compare it to Stackelberg and Nash routing. Finally, we show that optimal Stackelberg fleet routing could involve highly variable mixed strategies in some scenarios, which would likely cause chaos in the traffic network.

Figures

Figures reproduced from arXiv: 2506.22966 by the authors.

Figure 1
Figure 1. Different fleet objective functions can be presented on a square, with [PITH_FULL_IMAGE:figures/full_fig_p004_1.png] view at source ↗
Figure 2
Figure 2. Different combinations of (λ HDV , λCRV ) result in the link objective function being convex or concave or locally convex/concave dependent on the relative values of fleet and HDV flows. Therefore, a global minimizer of fleet objective, unique in convex cases, is no longer guaranteed to be unique across a large part of the behavioral spectrum, e.g. for competitive and malicious objectives. The link delay functions a… view at source ↗
Figure 3
Figure 3. Objective function (2) shape for different fleet strategies corresponding to different cou [PITH_FULL_IMAGE:figures/full_fig_p008_3.png] view at source ↗
Figures from the paper (4 more)
Figure 4
Figure 4. Figure 4: Objective function (2) shape for different fleet strategies corresponding to different couples [PITH_FULL_IMAGE:figures/full_fig_p009_4.png]
Figure 5
Figure 5. Figure 5: A two-route network. In this setting, the first section (perhaps void) of the routes (c) is common, then the routes split (a or b), then join together and have a common final section (d), which may be void. Let q1 be the flow on route 1 and q2 the flow on route 2. Then…
Figure 6
Figure 6. Figure 6: The ’8’ network with four available routes: 1: a-c, 2: a-d, 3: b-c, 4: b-d. [PITH_FULL_IMAGE:figures/full_fig_p027_6.png]
Figure 7
Figure 7. Figure 7: Left: A two route network, where link a cannot be used by heavy vehicles. Middle: a three-route [PITH_FULL_IMAGE:figures/full_fig_p029_7.png]

Discussion (0). Sign in to comment.

Reference graph

Works this paper leans on

62 extracted references · 61 canonical work pages

  1. [1]

    O., Psarou, A., Varga, Z

    Akman, A. O., Psarou, A., Varga, Z. G., Jamróz, G., and Kucharski, R. (2024). Impact of Collective Behaviors of Autonomous Vehicles on Urban Traffic Dynamics: A Multi-Agent Reinforcement Learning Approach. EWRL 17

    work page 2024

  2. [2]

    RouteRL: Multi-agent reinforcement learning framework for urban route choice with autonomous vehicles

    Akman, A. O., Psarou, A., Gorczyca, Ł., Varga, Z. G., Jamróz, G., and Kucharski, R. (2025). RouteRL: Multi-agent reinforcement learning framework for urban route choice with autonomous vehicles. arXiv preprint arXiv:2502.20065

    work page Pith review arXiv 2025

  3. [3]

    Ab Azar, N., Shahmansoorian, A., andDavoudi, M. (2020). From inverse optimal control to inversereinforcement learning: A historical review. Annual Reviews in Control, 50, 119-138

    work page 2020

  4. [4]

    Bierlaire, M. (2002). The total demand scale: a new measure of quality for static and dynamic origin–destination trip tables. Trans- portation Research Part B: Methodological, 36(9), 837-850

    work page 2002

  5. [5]

    Bitar, I., Watling, D., and Romano, R. (2023). Sensitivity analysis of the spatial parameters in modelling the evolutionary interaction between autonomous vehicles and other road users. SN Computer Science, 4(4), 336

    work page 2023

  6. [6]

    D., Lownes, N

    Boyles, S. D., Lownes, N. E., and Unnikrishnan, A. (2020). Transportation network analysis. Vol. I: Static and Dynamic Traffic Assignment

    work page 2020

  7. [7]

    Burton, D., and Toint, P. L. (1992). On an instance of the inverse shortest paths problem. Mathematical programming, 53, 45-61

    work page 1992

  8. [8]

    Cascetta, E. (1984). Estimation of trip matrices from traffic counts and survey data: a generalized least squares estimator. Trans- portation Research Part B: Methodological, 18(4-5), 289-299

    work page 1984

Show all 62 references
  1. [9]

    Transportation Systems Analysis 2nd edn

    Cascetta, E. Transportation Systems Analysis 2nd edn. (Springer, Springer Optimization and Its Applications, 2009)

    2009

  2. [10]

    Columbia Working Paper No

    Correa, José and Stier-Moses, Nicolas E., Stackelberg Routing in Atomic Network Games (February 2007). Columbia Working Paper No. DRO-2007-03, Available at SSRN: https://ssrn.com/abstract=987115 or http://dx.doi.org/10.2139/ssrn.987115

    2007 doi

  3. [11]

    J., and van der Schaar, M

    Chan, A. J., and van der Schaar, M. (2021). Scalable bayesian inverse reinforcement learning. arXiv preprint arXiv:2102.06483

    2021 arXiv

  4. [12]

    C., Mahmood, R., and Zhu, I

    Chan, T. C., Mahmood, R., and Zhu, I. Y. (2025). Inverse optimization: Theory and applications. Operations Research, 73(2), 1046-1074

    2025

  5. [13]

    Charlottin, T., Varotto, S., and Buisson, C. (2024). Detecting car-following and platoons within traffic using the dynamic time warping algorithm. In hEART 2024, 12th Symposium of the European Association for Research in Transportation

    2024

  6. [14]

    Dafermos, S. C. (1971). An extended traffic assignment model with applications to two-way traffic. Transportation Science, 5(4), 366-389

    1971

  7. [15]

    Deshpande, S., Walambe, R., Kotecha, K., Selvachandran, G., and Abraham, A. (2025). Advances and applications in inverse reinforcement learning: a comprehensive review. Neural Computing and Applications, 1-53

    2025

  8. [16]

    Farah, H., Postigo, I., Reddy, N., Dong, Y., Rydergren, C., Raju, N., and Olstam, J. (2022). Modeling automated driving in microscopic traffic simulations for traffic performance evaluations: aspects to consider and state of the practice. IEEE Transactions on Intelligent Trans...

    2022

  9. [17]

    An algorithm for quadratic programming

    Frank, M., and Wolfe, Ph. An algorithm for quadratic programming. Naval research logistics quarterly 3.1-2 (1956): 95-110

    1956

  10. [18]

    Gendreau, M., and Potvin, J. Y. (Eds.). (2010). Handbook of metaheuristics (Vol. 2). New York: Springer

    2010

  11. [19]

    Gora, P., Katrakazas, C., Drabicki, A., Islam, F., and Ostaszewski, P. (2020). Microscopic traffic simulation models for connected and automated vehicles (CRVs)–state-of-the-art. Procedia Computer Science, 170, 474-481

    2020

  12. [20]

    Gordon, C., Webb, D., and Wolpert, S. (1992). Isospectral plane domains and surfaces via Riemannian orbifolds. Inventiones mathe- maticae, 110(1), 1-22

    1992

  13. [21]

    Groetsch, C. W. (1993). Inverse problems in the mathematical sciences. Springer Fachmedien Wiesbaden

    1993

  14. [22]

    Harker, P. T. (1988). Multiple equilibrium behaviors on networks. Transportation science, 22(1), 39-46

    1988

  15. [23]

    Heuberger, C. (2004). Inverse combinatorial optimization: A survey on problems, methods, and results. Journal of combinatorial optimization, 8, 329-361

    2004

  16. [24]

    Iryo, T., Watling, D., and Hazelton, M. (2024). Estimating Markov chain mixing times: convergence rate towards equilibrium of a stochastic process traffic assignment model. Transportation science, 58(6), 1168-1192. 19

    2024

  17. [25]

    Jamróz, G., Akman, A.O., Psarou, A. et al. Social implications of coexistence of CAVs and human drivers in the context of route choice. Sci Rep 15, 6768 (2025). https://doi.org/10.1038/s41598-025-90783-w

    2025 doi

  18. [26]

    Detection of cooperating fleet vehicles in route choice urban games

    Jamróz, G., et al. Detection of cooperating fleet vehicles in route choice urban games. Part II. Detection methods and algorithms. In preparation

  19. [27]

    Jeroslow, R. G. (1985). The polynomial hierarchy and a simple model for competitive analysis. Mathematical programming, 32(2), 146-164

    1985

  20. [28]

    Kac, M. (1966). Can one hear the shape of a drum?. The american mathematical monthly, 73(4P2), 1-23

    1966

  21. [29]

    Kashmiri, F.A., Lo,H.K. (2022). Routing of autonomous vehicles for system optimal flows and average travel time equilibrium over time. Transportation Research Part C: Emerging Technologies,143,103818

    2022

  22. [30]

    E (1964), When Is a Linear Control System Optimal? Journal of Basic Engineering 86(1), pp

    Kalman, R. E (1964), When Is a Linear Control System Optimal? Journal of Basic Engineering 86(1), pp. 51–60

    1964

  23. [31]

    Krylatov, A., Raevskaya, A., and Zakharov, V. (2021). Travel demand estimation in urban road networks as inverse traffic assignment problem. Transport and Telecommunication, 22(3), 287-300

    2021

  24. [32]

    Li, J., Yu, J., Wang, Q., Liu, B., Wang, Z., and Nie, Y. M. (2022). Differentiable bilevel programming for stackelberg congestion games. arXiv preprint arXiv:2209.07618

    2022 arXiv

  25. [33]

    A., Behrisch, M., Bieker-Walz, L., Erdmann, J., Flötteröd, Y

    Lopez, P. A., Behrisch, M., Bieker-Walz, L., Erdmann, J., Flötteröd, Y. P., Hilbrich, R., ... and Wießner, E. (2018, November). Microscopic traffic simulation using sumo. In 2018 21st international conference on intelligent transportation systems (ITSC) (pp. 2575-2582). Ieee

    2018

  26. [34]

    C., Lenz, B., and Winner, H

    Maurer, M., Gerdes, J. C., Lenz, B., and Winner, H. (2016). Autonomous driving: technical, legal and social aspects. Springer Nature

    2016

  27. [35]

    Morris, P. G. (1986). Nuclear magnetic resonance imaging in medicine and biology

    1986

  28. [36]

    Y., and Russell, S

    Ng, A. Y., and Russell, S. (2000, June). Algorithms for inverse reinforcement learning. In Icml (Vol. 1, No. 2, p. 2)

    2000

  29. [37]

    (2001, July)

    Roughgarden, T. (2001, July). Stackelberg scheduling strategies. In Proceedings of the thirty-third annual ACM symposium on Theory of computing (pp. 104-113)

    2001

  30. [38]

    Schwarting, W., Pierson, A., Alonso-Mora, J., Karaman, S., and Rus, D. (2019). Social behavior for autonomous vehicles. Proceedings of the National Academy of Sciences, 116(50), 24972-24978

    2019

  31. [39]

    Smith, M. J. (1979). The existence, uniqueness and stability of traffic equilibria. Transportation Research Part B: Methodological, 13(4), 295-304

    1979

  32. [40]

    Transportation Networks for Research

    Transportation Networks for Research Core Team. Transportation Networks for Research. https://github.com/bstabler/TransportationNetworks. Accessed 15th March 2025

    2025

  33. [41]

    van Essen, M., Thomas, T., Chorus, C., and van Berkum, E. (2019). The effect of travel time information on day-to-day route choice behaviour: evidence from a real-world experiment. Transportmetrica B: Transport Dynamics, 7(1), 1719-1742

    2019

  34. [42]

    von Stackelberg, H. (1934). Marktform und Gleichgewicht. Springer, Wien. English translation: The Theory of the Market Economy, published in 1952 by Oxford University Press

    1934

  35. [43]

    Van Vuren, T., Van Vliet, D., and Smith, M. J. (1990). Combined equilibrium in a network with partial route guidance. In Traffic control methods. Proceedings of the fifth NG foundation conference, santa barbara, California

    1990

  36. [44]

    Van Vuren, T., Watling, D. (1991). A multiple user class assignment model for route guidance. Transportation research record, 22-22

    1991

  37. [45]

    J., and Willumsen, L

    Van Zuylen, H. J., and Willumsen, L. G. (1980). The most likely trip matrix estimated from traffic counts. Transportation Research Part B: Methodological, 14(3), 281-293

    1980

  38. [46]

    and Zamir, S

    Von Stengel, B. and Zamir, S. (2010). Leadership games with convex strategy sets. Games and Economic Behavior, 69(2), 446-457

    2010

  39. [47]

    Von Neumann, J. (1928). Zur Theorie der Gesellschaftsspiele. Mathematische Annalen, 100(1), 295-320

    1928

  40. [48]

    Watling, D. (1996). Asymmetric problems and stochastic process models of traffic assignment. Transportation Research Part B: Methodological, 30(5), 339-357

    1996

  41. [49]

    V., Cobbe B

    Webster F. V., Cobbe B. M. (1966): Traffic signals. Road Research Paper No. 56, Her Majesty’s Stationary Office, London. 20

    1966

  42. [50]

    Weyl, H.(1911).ÜberdieasymptotischeVerteilungderEigenwerte.NachrichtenvonderGesellschaftderWissenschaftenzuGöttingen, Mathematisch-Physikalische Klasse, 1911, 110-117

    1911

  43. [51]

    P., and Shmoys, D

    Williamson, D. P., and Shmoys, D. B. (2011). The design of approximation algorithms. Cambridge university press

    2011

  44. [52]

    Woolfson, M. M. (1997). An introduction to X-ray crystallography. Cambridge University Press

    1997

  45. [53]

    J., Nourinejad, M., Lai, X., and Chow, J

    Xu, S. J., Nourinejad, M., Lai, X., and Chow, J. Y. (2018). Network learning via multiagent inverse transportation problems. Transportation Science, 52(6), 1347-1364

    2018

  46. [54]

    Yang, H., Zhang, X., and Meng, Q. (2007). Stackelberg games and multiple equilibrium behaviors on networks. Transportation Research Part B: Methodological, 41(8), 841-861

    2007

  47. [55]

    (2010, May)

    Yin, Z., Korzhyk, D., Kiekintveld, C., Conitzer, V., and Tambe, M. (2010, May). Stackelberg vs. Nash in security games: interchange- ability, equivalence, and uniqueness. In AAMAS (Vol. 10, p. 6)

    2010

  48. [56]

    I., Chow, J

    You, S. I., Chow, J. Y., and Ritchie, S. G. (2016). Inverse vehicle routing for activity-based urban freight forecast modeling and city logistics. Transportmetrica A: Transport Science, 12(7), 650-673

    2016

  49. [57]

    and Li, J

    Zhang, X., Li, J., Zhou, J., Zhang, S., Wang, J., Yuan, Y., ... and Li, J. (2025). Vehicle-to-Everything Communication in Intelligent Connected Vehicles: A Survey and Taxonomy. Automotive Innovation, 1-33

    2025

  50. [58]

    Self-driving cars are on the way – is your city ready? https://www2.deloitte.com/us/en/insights/industry/public-sector/autonomous- vehicles-deployment-in-cities.html, Accessed: 18th May, 2025

    2025

  51. [59]

    https://projects.research-and- innovation.ec.europa.eu/en/horizon-magazine/self-driving-vehicles-road-cheaper-sustainable-urban-transport-europe, Accessed: 18th May, 2025

    Self-driving vehicles: the road to cheaper, sustainable urban transport in Europe. https://projects.research-and- innovation.ec.europa.eu/en/horizon-magazine/self-driving-vehicles-road-cheaper-sustainable-urban-transport-europe, Accessed: 18th May, 2025

    2025

  52. [60]

    https://www.yicaiglobal.com/news/over- 50-chinese-cities-issue-self-driving-intelligent-connected-vehicle-rules, Accessed: 18th May, 2025

    Over 50 Chinese Cities Have Brought Out Rules for Self-Driving, Smart Connected Vehicles. https://www.yicaiglobal.com/news/over- 50-chinese-cities-issue-self-driving-intelligent-connected-vehicle-rules, Accessed: 18th May, 2025. A Relation to Stackelberg and Nash routing In th...

    2025

  53. [61]

    Consequently, the Stackelberg and Nash equilibria would coincide

    ensures the same equilibrium whatever the order of players. Consequently, the Stackelberg and Nash equilibria would coincide. Corollary 50.It seems that the probabilistic Stackelberg routing in Example 47 leads to wildly varying travel times on routes. On the contrary, the myo...

  54. [62]

    In contrast to Section C.2, however, where the routes were linearly dependent, here they are not

    and ∇t =   t′ a +t′ c t′ a t′ c t′ a t′ a +t′ d t′ d t′ c t′ b +t′ c t′ b t′ d t′ b t′ b +t′ d   29 which is identical to the matrix obtained in Section C.2 with dependent routes. In contrast to Section C.2, however, where the routes were linearly dependent, here the...

Pith tools

Reviewed August 6, 2026 · model on record in the stance chip above.