相关论文: Multi-Commodity Nash Flows Over Time
This paper researches combinatorial algorithms for the multi-commodity flow problem. We relax the capacity constraints and introduce a penalty function $h$ for each arc. If the flow exceeds the capacity on arc $a$, arc $a$ would have a…
This paper introduces a novel theoretical framework and a suite of highly efficient, parallelizable algorithms for solving the large-scale multicommodity flow (MCF) feasibility problem. We reframe the classical constraint-satisfaction…
In this paper we study the existence and uniqueness of Nash equilibria (solution to competition-wise problems, with several controls trying to reach possibly different goals) associated to linear partial differential equations and show…
Stable flows generalize the well-known concept of stable matchings to markets in which transactions may involve several agents, forwarding flow from one to another. An instance of the problem consists of a capacitated directed network, in…
A paradigm put forth by E. Schr\"odinger in 1931/32, known as Schr\"odinger bridges, represents a formalism to pose and solve control and estimation problems seeking a perturbation from an initial control schedule (in the case of control),…
There has been much research on network flows over time due to their important role in real world applications. This has led to many results, but the more challenging continuous time model still lacks some of the key concepts and techniques…
We consider the platoon matching problem for a set of trucks with the same origin, but different destinations. It is assumed that the vehicles benefit from traveling in a platoon for instance through reduced fuel consumption. The vehicles…
We study a Stackelberg strategy subject to the evolutionary linearized micropolar fluids equations in domains with moving boundaries, considering a Nash multi-objective equilibrium (non necessarily cooperative) for the "follower players"…
We introduce a formalism to deal with the microscopic modeling of vehicular traffic on a road network. Traffic on each road is uni-directional, and the dynamics of each vehicle is described by a Follow-the-Leader model. From a mathematical…
Recent literature has proved that stable dynamic routing algorithms have solid theoretical foundation that makes them suitable to be implemented in a real protocol, and used in practice in many different operational network contexts. Such…
We study optimal transport-based distributionally robust optimization problems where a fictitious adversary, often envisioned as nature, can choose the distribution of the uncertain problem parameters by reshaping a prescribed reference…
Recent advances in time series, where deterministic and stochastic modelings as well as the storage and analysis of big data are useless, permit a new approach to short-term traffic flow forecasting and to its reliability, i.e., to the…
The maximum multicommodity flow problem is a natural generalization of the maximum flow problem to route multiple distinct flows. Obtaining a $1-\epsilon$ approximation to the multicommodity flow problem on graphs is a well-studied problem.…
This paper investigates the game theory of resource-allocation situations where the "first come, first serve" heuristic creates inequitable, asymmetric benefits to the players. Specifically, this problem is formulated as a Generalized Nash…
This study validates the continuum traffic flow model of capacity drop at sag and tunnel bottlenecks, as proposed by Jin (2018) and Wada et al. (2020), through empirical analysis. Specifically, after addressing the limitations in the…
Mobility-on-demand (MoD) systems represent a rapidly developing mode of transportation wherein travel requests are dynamically handled by a coordinated fleet of vehicles. Crucially, the efficiency of an MoD system highly depends on how well…
Modeling transition-continuum hypersonic flows poses significant challenges due to thermodynamic nonequilibrium and the associated breakdown of the continuum assumption. Standard continuum models such as the Navier-Stokes equations are…
We introduce the problem of groundwater trading, capturing the emergent groundwater market setups among stakeholders in a given groundwater basin. The agents optimize their production, taking into account their available water rights, the…
The present paper proposes a stochastic model of the traffic flow. This model has a discrete set of states and the continuous time. The model is a generalization of the discrete stochastis model that has been considered in a previous paper…
The paper investigates the throughput behavior of single-commodity dynamical flow networks governed by monotone distributed routing policies. The networks are modeled as systems of ODEs based on mass conversation laws on directed graphs…