{"id":"6335e0c4-ff20-42fd-8cb7-55938da9d66f","arxiv_id":"2507.19675","paper_version":1,"verdict":"CONDITIONAL","confidence":"MODERATE","novelty_score":4.0,"correctness_risk":"medium","formal_verification":"none","parameter_count":0,"one_line_summary":"By rotating drivers through system-optimal routes over multiple days, a city can make average travel times equal across drivers while keeping each day's assignment system-optimal, yielding a Cyclical User Equilibrium.","lead":"The paper proposes a multi-day 'Wardropian cycle' routing scheme for autonomous vehicles: each day the city assigns system-optimal routes, and over a cycle every driver experiences the same average travel time, which is also faster than selfish equilibrium. The idea promises to eliminate congestion externalities fairly, but practical guarantees depend on full compliance and on assumptions the paper only partially proves.","discovery_kind":"new_method","skeptic_critique":{"model":"deepseek-v4-flash","headline":"CUE's advertised stability under unilateral deviations is not established: a driver assigned to a slow route on a given day can switch to the fastest route and improve, as the paper itself concedes in §1.1; the equilibrium condition only rules out switching to UE every day, not single-day…","rationale":"The paper's core existence result is mathematically sound: for integer path flows, rotating drivers through the SO routes yields equal per-driver average travel times while preserving aggregate path flows and hence daily system optimality. The proofs of Propositions 2.11, 2.12, and the greedy rule's one-day optimality are consistent with the model. However, the broader claim that this constitutes a Cyclical User Equilibrium that is stable under unilateral deviations is not supported. Definition 2.21 only rules out two extreme strategies, not the natural best-response of deviating on the day one is assigned to a slow route. The manuscript itself admits this in Section 1.1. Because the stated motivation for Wardropian cycles is voluntary acceptance and elimination of price-of-anarchy without a dictator, this gap directly affects the central contribution. The concern is not fatal to the constructive, existence-style results: if full compliance is assumed, or if 'deviation' is formally restricted to changes of the whole multi-day plan (or if light enforcement such as expulsion is part of the mechanism), the stability claim can be repaired. The OD-fair SO constraint is a separate but real limitation: without it, 17.5% of Barcelona OD pairs are worse off than UE, so universal voluntary participation and the headline PoA-elimination narrative remain conditional on solving a nonconvex formulation that the paper explicitly does not implement. Overall, the reader's conditional verdict remains appropriate and no additional verdict change is needed beyond what was already identified.","tokens_in":25984,"tokens_out":7214,"duration_ms":92383,"concrete_test":"Take the 18-vehicle example in Section 3.1 (flows 4/6/8 on routes with times 15/14/9; mean 12). Build the full 18-day shift cycle. On a day a driver is assigned to Route 1 (15 min), allow that single driver to take Route 3 (9 min) instead; keep all other drivers on schedule and update BPR route times with Q=18 (or use the paper's Barcelona BPR parameters). If the deviator's realized Route-3 time on that day is below the 15 min they would have experienced on Route 1, then over the rest of the cycle the deviator's average is below 12, proving CUE is not stable under unilateral single-day deviations. A stronger check: repeat this deviation test for all 2078 Barcelona OD pairs; if any driver can improve via one-day deviations, the abstract's stability claim fails.","verdict_should_be":"UNCHANGED","load_bearing_attack":"The most load-bearing weakness is the stability claim for Cyclical User Equilibrium (CUE). Definition 2.21 and the abstract state that CUE 'ensures stability of optimal Wardropian Cycles under unilateral deviations,' but the equilibrium condition only compares two whole-cycle strategies: following the assigned cycle and following UE every day (eq. 19). It does not rule out a single-day deviation. The paper concedes this in Section 1.1: 'by deviating on a single day, a user of our framework may improve its travel time.' Under the static BPR model used throughout, on any day path travel times differ; a driver assigned to a slower route can switch to the fastest route and strictly improve that day's travel time (the deviator's new day time is at most the old fastest-route time plus a small congestion increment, while the assigned slower-route time also falls). Repeating this on every slow day gives an average below the OD mean, contradicting the claimed 'no incentive to deviate' property unless deviations are defined as changing the entire multi-day plan or expulsion enforcement is imposed. Since voluntary acceptance is the stated motivation for eliminating price-of-anarchy, this gap is load-bearing. The OD-fair SO constraint (eq. 20) is a second, separate limitation: without it, 17.5% of Barcelona OD pairs are worse off than UE and would not voluntarily join.","agreement_with_reader":"agree"},"referee_report":{"model":"deepseek-v4-flash","summary":"This paper proposes a multi-day traffic assignment framework in which, for each origin-destination (OD) pair, drivers are rotated among routes so that every daily assignment reproduces the System Optimal path flows while, over the cycle, each driver's average travel time equals the OD average. The authors define Wardropian Cycles, prove existence via cyclic shifts (Prop. 2.11), shorten cycles via the GCD of path flows (Prop. 2.12), give a reordering heuristic with a deviation bound (Prop. 2.15), and prove that a greedy rule minimizes next-day inequity (Prop. 2.17). They introduce Cyclical User Equilibrium (Def. 2.21) as a state in which all drivers receive lower average travel time than under User Equilibrium, and they propose an OD-fair System Optimal assignment (eq. 20) to extend the property to all OD pairs. Numerical experiments on Barcelona and four other networks report substantial price-of-anarchy reductions and rapid decay of inequity under the greedy rule.","tokens_in":26231,"tokens_out":6171,"duration_ms":63070,"significance":"The elementary existence proof for Wardropian Cycles is a genuine conceptual contribution: it shows that the dichotomy between User Equilibrium and System Optimum dissolves when the assignment horizon is extended to several days, and the construction is parameter-free in the sense that equalization follows from permutation cycles rather than from fitted quantities. The authors provide public code and large-scale experiments, and the greedy rule's one-step optimality is cleanly proved. The main caveat is that the equilibrium interpretation is weaker than advertised: the formal conditions (19) do not rule out profitable one-day deviations, and the system-wide 'every user benefits' claim is conditional on an OD-fair SO constraint (20) that is not implemented. These issues are fixable by rephrasing the stability claim and qualifying the numerical conclusions.","major_comments":[{"comment":"The abstract and Definition 2.21 claim that Cyclical User Equilibrium 'ensures stability of optimal Wardropian Cycles under unilateral deviations', but this is not established by the model. Equation (19) only compares two whole-horizon strategies: following the assigned cycle AWC and travelling via User Equilibrium every day. It does not compare against a single-day deviation. Under the static BPR model, on any day a driver assigned to a slower route can switch to that day's fastest route and strictly reduce that day's travel time; because the assigned route was slower, the deviation pays immediately, and repeating this on every slow day yields an average below the OD mean. The paper concedes exactly this in Section 1.1 ('by deviating on a single day, a user of our framework may improve its travel time'). Therefore the stability claim in the abstract and the statement in Section 2.9 that 'no user has incentive to opt out of the cycle' are unsupported unless 'deviating' is redefined as abandoning the cycle for the entire period, or unless expulsion enforcement is made an explicit assumption of CUE. Please either weaken the claim to 'no incentive to abandon the cycle in the long run' and add the commitment assumption, or incorporate enforcement into Definition 2.21.","section":"Abstract and §2.9, Definition 2.21"},{"comment":"Section 2.10 introduces the OD-fair constraint (20) but states that it 'cannot be easily implemented' due to non-convexity, and the experiments do not enforce it. Consequently, the claim in Section 3.2 that users on 82.5% of Barcelona OD pairs benefit from the cyclical assignment means that 17.5% of OD pairs are actually worse off than UE and hence fail condition (19b); the concluding statement that 'each participating user' benefits is not supported for those pairs. The system-wide voluntary-acceptance argument therefore rests on an optimization that is not solved. Please either provide a tractable formulation or approximation of (20) with computational results, or explicitly restrict the fairness/acceptance claims to OD pairs satisfying (19b) and discuss the implications for deployment.","section":"§2.10 and §3.2"},{"comment":"Section 2.8 states that rounding continuous Frank-Wolfe flows 'to the nearest integer yielded a sufficiently accurate approximation', but no error bound, sensitivity analysis, or validation is provided. Since the Wardropian Cycles and daily optimality claims are defined for integer path flows Qk satisfying (4b), the city-scale results in Section 3 are exact only if the rounded flows coincide with the SO solution; otherwise the daily assignment is only approximately system-optimal. Please quantify the rounding error in terms of total travel time (or bound the BPR function's sensitivity to flow perturbation), or present the discretized assignment as an approximate SO solution with measured suboptimality.","section":"§2.8"}],"minor_comments":[{"comment":"The spelling 'Wardopian' appears in several places (e.g., Section 2.7 and Figure 2) instead of 'Wardropian'; please harmonize the terminology.","section":"Throughout"},{"comment":"Entries such as '8 .003' and '5 .2910' contain stray spaces and appear garbled; the table should be typeset so that numbers are clearly separated.","section":"Table 3"},{"comment":"The notation D_j for single-day deviations (Def. 2.3) and D^J for cumulative deviations (Def. 2.4) is visually confusing; in equations such as (16), the expression 'PJ j=1[DJ]i' should be written as a sum over D_j with a clear index, or a distinct symbol should be used for cumulative deviations.","section":"Definitions 2.3–2.4 and eq. (16)"},{"comment":"The caption says 'The cumulated differences in average travel time (Y-axis) cancel out over time (X-axis)' but the plot appears to show minimal and maximal average travel times per OD pair; please clarify what is plotted and what 'cancel out' means.","section":"Figure 7 caption"}],"recommendation":"major_revision","confidential_remarks":"The manuscript is a conceptually interesting contribution with correct core existence proofs, but the abstract and conclusions overstate the equilibrium properties. In my view the paper can be made publishable by (i) replacing 'unilateral deviations' with a committed multi-day participation model or an explicit enforcement assumption, and (ii) qualifying the system-wide benefits due to the unsolved OD-fair constraint. The authors should also be asked to document the rounding error in the discretization step."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"The core idea is simple and sound: if you rotate drivers through the system-optimal route flow pattern over multiple days, each driver's average travel time converges to the OD average, so you get SO efficiency with long-run fairness. The existence proof (shift matrix) and the GCD reduction are correct and clean; the greedy assignment rule is a sensible heuristic with a genuinely useful bound (Prop. 2.18). The multi-day framing is a real departure from the one-day UE-vs-SO trade-off, and the paper's own simulations show fast inequity reduction. I found no fatal mathematical error in the core construction.\n\nBut the 'stability' claim for Cyclical User Equilibrium as stated is not established. A driver assigned to a slow route on a given day can switch to the fastest route that day and improve; the paper admits this in §1.1. The equilibrium condition only compares following the full cycle vs. UE every day, not single-day deviations. That's a real gap between the abstract's 'ensures stability under unilateral deviations' and what is actually proven. It is fixable—recognize the equilibrium is over multi-day strategies, or assume enforceable contracts—but as written it oversells. The OD-fair SO constraint (eq. 20) is a second, acknowledged limitation: without it, 17.5% of Barcelona OD pairs are worse off than UE and would not voluntarily join. The paper states it can't be easily implemented due to non-convexity, so the 'benefits all users' narrative only holds for a subset.\n\nProportionately: these are significant soft spots in the framing and the policy claims, not in the math of the cycles. The core construction holds; the paper is honest about many limitations in §2.12 and §4.\n\nVerdict: this deserves a serious referee. The conceptual novelty is real and the proofs are simple enough to verify quickly. The right review outcome would be 'major revision': tighten the equilibrium definition, either explicitly restrict deviations to full-plan changes or make enforcement part of the model, and quantify the OD-fairness gap instead of leaving it as a postulate.\n\nWho should read it: transportation researchers working on CAV routing and on fair/efficient traffic assignment. It's a useful discussion paper even if the 'equilibrium' terminology needs work.","headline":"A genuinely new multi-day rotation idea with correct core math, but the advertised CUE stability under unilateral deviations is overstated and needs a clearer equilibrium definition.","tokens_in":26799,"tokens_out":1842,"would_cite":true,"duration_ms":20318,"reading_group":"maybe","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":["90B20","91A10"],"pacs":[],"model":"deepseek-v4-flash","headline":"This paper claims traffic assignment can be both fair and optimal if fairness is judged over a multi-day cycle: for any origin–destination pair, a finite sequence of daily route permutations equalizes every driver's average travel time…","keywords":["Wardropian cycles","Cyclical User Equilibrium","system optimum","user equilibrium","price of anarchy","traffic assignment","connected autonomous vehicles","fairness"],"falsifier":"Run the Wardropian Cycle in a field or simulation study where each driver is free to switch to a faster route on any single day, with no penalty; if a nontrivial share of such daily-optimizing drivers breaks the equality of average travel times, the stability claim of Cyclical User Equilibrium is refuted.","tokens_in":25747,"feed_emoji":"🚗","tokens_out":8715,"duration_ms":93853,"temperature":0.7,"pith_summary":"This paper claims that traffic assignment need not choose between fairness and efficiency if drivers are considered over a sequence of days rather than a single day. For any origin–destination pair and any daily flow pattern—in particular the system-optimal pattern that minimizes total travel time—the authors prove there is a finite cycle of daily route assignments, called a Wardropian Cycle, that gives every driver the same average travel time while keeping every single day system-optimal. If true, this dissolves the usual trade-off between User Equilibrium (fair but inefficient) and System Optimum (efficient but unfair), and removes the Price of Anarchy in a way that could be socially acceptable. The paper also introduces Cyclical User Equilibrium as a stability concept for such cycles, and reports city-scale simulations in which the greedy variant reduces inequity to a small fraction of its initial value within days.","feed_headline":"Cyclical route swaps make traffic both fair and optimal","feed_subtitle":"A finite cycle of daily assignments equalizes average times while every day stays system-optimal.","key_machinery":"The central object is the Wardropian Cycle: a finite sequence of daily assignment matrices $(A_1,\\dots,A_n)$, each preserving the system-optimal path flows, whose cumulative travel-time deviation vector $D_n = \\sum_{j=1}^n D_j$ equals zero. Existence is shown via the shift matrix $P$, a permutation matrix that rotates drivers one position through the route list; after $Q$ days each driver has taken each route $Q_k$ times. The paper then shortens cycles using the greatest common divisor of path flows (reducing the cycle length to $Q/M$), partitions drivers into sub-cycles of equal mean travel time, bounds the worst per-day deviation by reordering route times, and introduces a greedy daily assignment rule that assigns the fastest routes to the drivers with the largest accumulated disadvantage. The greedy rule provably minimizes next-day inequity and drives average times toward equality, although it does not in general produce an exact finite cycle.","core_discovery":"The central discovery is that the system-optimal assignment, which is normally unfair because drivers on different routes experience different travel times, can be embedded in a finite sequence of daily assignments (a Wardropian Cycle) such that every traveller's average travel time over the cycle equals the OD-average travel time, while each day's assignment still realizes the system-optimal path flows. Formally, for any OD pair and any assignment, there exists a finite sequence of daily assignments $A_1,\\dots,A_n$ with cumulative deviation vector $D_n = \\sum_{j=1}^n D_j = 0$. The paper proves existence by rotating drivers through the route list with a permutation matrix: after $Q$ days, each driver has taken each route exactly the number of times that route appears in the optimal flow, so every driver's mean travel time equals $\\hat t$. This reconciles Wardrop's first principle (no user has a faster average route) with his second principle (system-optimal flows), in the multi-day average, and yields a new equilibrium notion, Cyclical User Equilibrium, in which no user wants to switch positions in the cycle or revert to User Equilibrium.","pith_inferences":["The same 'rotate the unlucky slot' logic applies to any repeated allocation problem where agents care about long-run averages—shift work, queue serving, or computing jobs—though the paper only studies traffic.","Introducing day-to-day travel-time noise would break the exact equality of the cycle; a stochastic version would likely need to replace fixed cycles with a feedback rule like the greedy assignment, which the paper develops but does not analyze probabilistically.","Rather than relying on expulsion to deter single-day deviations, one could design the cycle so that faster routes on a given day go to those with the largest accumulated debt; such an incentive-compatible variant is not explored in the paper.","The non-convex OD-fair SO constraint could be bypassed by allowing inter-OD compensation through credits, but the paper notes monetary transfers may be socially unacceptable, leaving a design gap."],"forward_implications":["City-scale CAV fleets could run system-optimal routing every day while guaranteeing equal average travel times per OD pair over the cycle, so the Price of Anarchy can be removed without permanently selecting winners and losers.","When exact cycles are too long, the greedy daily assignment rule still removes most inequity within days—less than 7% of initial inequity remains after 10 days in Barcelona, Anaheim, and Sioux Falls—making the scheme practical before full convergence.","Because the cycle construction works for any assignment, not only travel-time System Optimum, the same mechanism can equalize average outcomes for other policy objectives such as mileage or CO$_2$ minimization.","Cyclical User Equilibrium gives a precise sense in which no user wants to switch places with another user on the same OD pair and no user wants to revert to User Equilibrium, making the fair-optimal assignment an equilibrium in the multi-day average.","The proposed OD-fair System Optimal extension would extend the benefit to all OD pairs, not just the 82.5% of Barcelona pairs that currently benefit, but its non-convex constraint remains an open implementation problem."],"supporting_citations":[{"why":"Defines User Equilibrium and System Optimum, the two assignment principles the Wardropian Cycle reconciles.","marker":"Wardrop (1952)"},{"why":"Introduces the price of anarchy, the inefficiency measure the paper's multi-day assignments are designed to remove.","marker":"Koutsoupias and Papadimitriou (1999)"},{"why":"Gives empirical price-of-anarchy measurements in real traffic networks that motivate the fairness problem.","marker":"Youn et al. (2008)"},{"why":"Supplies constrained system-optimal assignment methods the paper can use to reduce route-time spread and thus improve cycle acceptability.","marker":"Jahn et al. (2005)"},{"why":"Provides the Frank-Wolfe traffic assignment implementation used to compute UE and SO flows in the city-scale experiments.","marker":"Bettini (2021)"},{"why":"Supplies the city network datasets (Barcelona, Anaheim, Berlin, Sioux Falls, Eastern Massachusetts) used in the simulations.","marker":"Stabler (2023)"},{"why":"The rearrangement inequality is the basis for proving that the greedy assignment minimizes next-day inequity.","marker":"Hardy et al. (1952)"},{"why":"Basis for the NP-hardness reductions showing that optimal cycle shortening and inequity minimization are intractable.","marker":"Garey and Johnson (1979)"}],"fun_headline_variants":["Finite cycle of route swaps makes traffic both fair and optimal","Rotate routes daily: equalized travel times, system-optimal flows","Fair traffic via daily rotation of system-optimal routes","Wardropian cycles: optimal everyday, fair on average"],"cache_read_input_tokens":3200,"weakest_assumption_plain":"The load-bearing assumption is that drivers evaluate their travel time over the whole multi-day cycle rather than day by day, so they will accept a slower day when the cycle as a whole is faster and fairer; if even a fraction of users optimize each single day, the equalization can unravel.","fun_headline_variants_meta":{"raw":{"variants":["Finite cycle of route swaps makes traffic both fair and optimal","Rotate routes daily: equalized travel times, system-optimal flows","Fair traffic via daily rotation of system-optimal routes","Wardropian cycles: optimal everyday, fair on average"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.000226,"raw_usage":{"total_tokens":1541,"prompt_tokens":1090,"completion_tokens":451,"prompt_tokens_details":{"cached_tokens":384},"prompt_cache_hit_tokens":384,"prompt_cache_miss_tokens":706,"completion_tokens_details":{"reasoning_tokens":380}},"tokens_in":706,"tokens_out":451,"duration_ms":5337,"temperature":1.0,"reasoning_tokens":380,"cache_read_input_tokens":384,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-06T14:09:23.346330+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"Run the Wardropian Cycle in a field or simulation study where each driver is free to switch to a faster route on any single day, with no penalty; if a nontrivial share of such daily-optimizing drivers breaks the equality of average travel times, the stability claim of Cyclical User Equilibrium is refuted.","supporting_citations":[],"review_version":1}