Capacitated Spatiotemporal Matching

We study a spatiotemporal service matching problem in which demand, heterogeneous in location and time sensitivity/preference, is to be assigned to service stations. The planner seeks to maximize social welfare, defined as total service reward minus spatial and temporal costs, by optimally scheduling demand to stations and service time under processing capacity constraints. We formulate the problem as an optimal transport (OT) model that allows for both demand-capacity imbalance and endogenously unserved demand when service costs exceed rewards. Leveraging a barycenter-style decomposition, we reformulate the problem as a finite-dimensional convex optimization problem that generalizes semi-discrete OT and enables scalable computation. We characterize the geometry of optimal assignments, showing that spatial partitions correspond to generalized Laguerre cells. Temporally, we show that the structure of the optimal schedule depends on demand heterogeneity: when demand differs only in temporal cost sensitivity, higher-sensitivity demand is assigned service times closer to the common ideal time; when demand differs only in preferred times, the assignment is order-preserving with respect to preferred times. We further propose an envy-free, individually rational implementation of the optimal schedule using time-dependent pricing and a finite-slot mechanism with explicit bounds depending on the number of required slots. To illustrate the framework, we extend the classic Hotelling linear-city model on a line segment by incorporating a continuum of waiting-cost sensitivities, demonstrating how optimal spatial partitions vary with changes in sensitivity heterogeneity and reward.