Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 2608.12136

Tolls for Dynamic Equilibrium Flows

Lukas Graf·Tobias Harks·Julian Schwarz
View original source ↗Read source document ↗Export metadata ↓

Abstract

We consider dynamic network flows and study the following question: Which dynamic edge flows can be implemented as tolled dynamic equilibrium flows? We study this question for the heterogeneous-user model, where the flow particles are partitioned into populations characterized by their own source,destination-pairs and a cost function associating with any walk and departure time some costs. As our two main results, we first provide a duality-based characterization of implementability of dynamic edge flows for the multi-source, multi-destination case. Secondly, we derive both, a combinatorial and duality-based characterization of implementability of dynamic edge flows for the multi-source, single-destination case. Both results are derived under a fairly general network loading model. For the proof, we make several technical contributions: We formulate a novel infinite dimensional optimization problem, where the goal is to minimize the aggregated costs of the particles with respect to the fixed network loading induced by the given edge flow. This requires the recently introduced concept of autonomous network loadings for which we show several new structural insights. In particular, we give an alternative (tighter) characterization of the existence of autonomous network loadings for our setting by deriving a generalization of a result of M.A. Zarecki\u{\i} on the Lusin $N^{-1}$ property of absolutely continuous monotone functions which may also be of independent interest. These insights allow us to prove the stated characterizations under the assumption of strong duality. Finally, for the case of a single-destination, we are able to provide a non-trivial proof that this assumption is always fulfilled for finitely supported edge flows with costs representing weighted travel times.

Explore related subjects

cs.GT

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Lukas Graf, Tobias Harks, Julian Schwarz. 2026-08-12. Tolls for Dynamic Equilibrium Flows. https://arxiv.org/abs/2608.12136

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

MMS Allocation for Chores with Online Agent Arrivals

We study the fair allocation of $m$ indivisible chores to $n$ agents with subadditive cost functions arriving online in an arbitrary order. Upon an agent's arrival, we are informed of her cost function and must irrevocably assign her a set of chores. We focus on the Maximin Share (MMS) fairness notion and aim to compute an allocation in which all items are assigned, and no agent incurs a cost more than $\alpha$ times her MMS. Without any prior information about the instance (other than $n$ and $m$), we design an algorithm with a competitive ratio of $O(\min\{n, k\log^{1+\epsilon}k, \log m\})$ for any constant $\epsilon > 0$, where $k$ denotes the number of cost function types. Our bound matches the best known offline approximation guarantees for MMS under subadditive costs and is nearly optimal with respect to all three parameters: we show that even for binary additive cost functions, no online algorithm can achieve a competitive ratio of $o(\min\{n, k\log k, \log m\})$. We then consider the setting in which the $k$ cost function types are known in advance (though the realized types of arriving agents are not). For additive cost functions, we provide an algorithm with a competitive ratio of $O(\min\{\log k, \log(kn)/\log\log(kn)\})$, and show that constant-competitive algorithms do not exist for general $k$, even for the binary additive setting. For binary additive functions when $k \le n$, we propose a $3$-competitive algorithm and establish a lower bound of $2$.

cs.GT↗
arXiv2026

Truncated Noisy Best-Response Algorithms: Toward Game Theoretic Learning with Safety Guarantees

We consider a game theoretic approach to solve multi-agent coordination problems with submodular maximization objectives. It is known for such problems that the Nash equilibria for the corresponding game are always within 50% of the optimal, but that the equilibria which achieve this worst-case bound are not stable. To exploit this instability, we propose a family of algorithms which we call Truncated Noisy Best-Response (TNBR) Algorithms. These algorithms are flexibly characterized by agents asynchronously and stochastically selecting actions from a neighbourhood of their best response payoffs. We compute bounds on the recurrent classes of TNBR algorithms' associated Markov chains. Our bounds fall into two categories: first, "Performance" bounds ensure that TNBR algorithms always have a high-value recurrent state; second, "Safety" bounds ensure that TNBR algorithms never have arbitrarily-bad recurrent states. Furthermore, these two types of bounds are linked by a waterbed-like effect: every game with a poor Safety guarantee necessarily has a favorable Performance guarantee.

cs.GT↗
arXiv2026

Existence of the Core in Approval-Based Committee Elections

We settle the main open question in the theory of approval-based multi-winner elections: we show that there always exists a committee in the core. The core is a stability and group fairness concept. The proof introduces a new voting rule that optimizes an entropy-like objective function over committees and payment systems. All local optima of this objective function lie in the core, which implies that a core committee can be found in polynomial time.

cs.GT↗