相关论文: A new look at departure time choice equilibrium mo…

In heterogeneous networks (HetNets), load balancing among different tiers can be effectively achieved by a biased user association scheme with which each user chooses to associate with one base station (BS) based on the biased received…

We consider the influence of disorder on the non-equilibrium steady state of a minimal model for intracellular transport. In this model particles move unidirectionally according to the \emph{totally asymmetric exclusion process} (TASEP) and…

Heterogeneous systems are present from powerful supercomputers, to mobile devices, including desktop computers, thanks to their excellent performance and energy consumption. The ubiquity of these architectures in both desktop systems and…

This paper presents a distributed model predictive control (DMPC) algorithm for heterogeneous vehicle platoons with unidirectional topologies and a priori unknown desired set point. The vehicles (or nodes) in a platoon are dynamically…

We investigate a new multi-marginal optimal transport problem arising from a dissociation model in the Strong Interaction Limit of Density Functional Theory. In this short note, we introduce such dissociation model, the corresponding…

Assigning passenger trips to specific network paths using automatic fare collection (AFC) data is a fundamental application in urban transit analysis. The task is a difficult inverse problem: the only available information consists of each…

We discuss the Monge problem of mass transportation in the framework of stochastic thermodynamics and revisit the problem of the Landauer limit for finite-time thermodynamics, a problem that got the interest of Krzysztof Gawedzki in the…

Dynamic user equilibrium (DUE) is the most widely studied form of dynamic traffic assignment, in which road travelers engage in a non-cooperative Nash-like game with departure time and route choices. DUE models describe and predict the…

In (Jin, 2018), a new day-to-day dynamical system was proposed for drivers' departure time choice at a single bottleneck. Based on three behavioral principles, the nonlocal departure and arrival times choice problems were converted to the…

In transportation, the number of observations associated with one discrete outcome is often greatly different from the number of observations associated with another discrete outcome. This situation is known as class-imbalance. In…

It is well-known that the power-of-d choices routing algorithm maximizes throughput and is heavy-traffic optimal in load balancing systems with homogeneous servers. However, if the servers are heterogeneous, throughput optimality does not…

We provide a solution to the problem of optimal transport by Brownian martingales in general dimensions whenever the transport cost satisfies certain subharmonic properties in the target variable, as well as a stochastic version of the…

Optimizing passengers routes is crucial to design efficient transportation networks. Recent results show that optimal transport provides an efficient alternative to standard optimization methods. However, it is not yet clear if this…

Mobile-edge computing (MEC) has been envisioned as a promising paradigm to meet ever-increasing resource demands of mobile users, prolong battery lives of mobile devices, and shorten request response delays experienced by users. An MEC…

This paper proposes a dynamic congestion pricing model that takes into account mobile source emissions. We consider a tollable vehicular network where the users selfishly minimize their own travel costs, including travel time, early/late…

The paper considers a coupled system of linear Boltzmann transport equations (BTE), and its Continuous Slowing Down Approximation (CSDA). This system can be used to model the relevant transport of particles used e.g. in dose calculation in…

We study a dynamic matching problem on a two-sided platform with unbalanced patience, in which long-lived supply accumulates over time with a unit waiting cost per period, while short-lived demand departs if not matched promptly. High- or…

It is well-known that the optimal transport problem on the real line for the classical distance cost may not have a unique solution. In this paper we recover uniqueness by considering the transport problems where the costs are a power…

This paper links matching markets with aligned preferences to optimal transport theory. We show that stability, efficiency, and fairness emerge as solutions to a parametric family of optimal transport problems. The parameter reflects…

We seek to understand when heterogeneity in user preferences yields improved outcomes in terms of overall cost. That this might be hoped for is based on the common belief that diversity is advantageous in many settings. We investigate this…