In multi-capacity ridesharing, multiple requests (e.g., customers, food
items, parcels) with different origin and destination pairs travel in one
resource. In recent years, online multi-capacity ridesharing servi
研究了在线分配问题，通过创建不对称性来控制重用性引起的随机依赖，并建立了一个新算法，获得了最佳竞争比率。(The paper studies the problem of online allocation and proposes a new algorithm that creates asymmetry to control the stochastic dependencies induced by reusability, achieving the best possible competitive ratio.)