The article explores the lifelong challenge of matching versus transcending standards, using vector distance, cosine similarity, and transformation matrices as metaphors, and illustrates the concept through personal examples and the film Nezha, urging readers to question and reshape the norms that guide them.
The article surveys Didi’s driver‑passenger matching challenges and presents a suite of solutions—from greedy nearest‑driver and Kuhn‑Munkres bipartite matching to stable marriage, dynamic and one‑to‑many assignments, reinforcement‑learning, routing and queueing models—while validating assumptions statistically, integrating preference‑aware machine learning, and outlining multi‑objective and digital‑twin future research.
This article surveys recent deep learning approaches for matching in search and recommendation systems, presenting a unified view of matching, categorizing methods into representation learning and matching function learning, and detailing model architectures from input to output layers, while highlighting broader applications such as QA and image captioning.
This article explains Alibaba's Deep Tree Matching (TDM) technology, covering the challenges of large‑scale match retrieval, the progression from classic two‑stage recall to tree‑based indexing, max‑heap tree modeling, beam‑search retrieval, and the joint model‑index learning across TDM 1.0, 2.0, and 3.0, highlighting significant offline and online performance gains and future research directions.
This article examines how O2O ride‑hailing services like Uber and Didi rely on layered system architecture and algorithmic data platforms to enable intelligent matching, dynamic pricing, and safety mechanisms through machine‑learning models and real‑time data integration.
This article details how Alibaba's 1688 B2B platform leverages deep learning techniques—including Deep Match, DIN, DIEN, DMR, and heterogeneous network models—to evolve its product recall, ranking, and live‑content recommendation pipelines, highlighting system architecture, practical lessons, and online performance improvements.
The paper proposes the Deep Match to Rank (DMR) model, which integrates matching‑stage collaborative‑filtering ideas into the ranking stage to explicitly represent user‑to‑item relevance, thereby enhancing personalization and achieving significant CTR and DPV improvements in e‑commerce recommendation scenarios.
This article explains how Didi’s ride‑hailing platform evolved its dispatch system—from basic nearest‑driver assignment to sophisticated batch matching, demand‑prediction, chain dispatch, and reinforcement‑learning techniques—highlighting the operational challenges, algorithmic solutions, and the massive scale impact on user experience.
This article explains why modern ride‑hailing platforms need advanced dispatch algorithms, describes the underlying order‑allocation problem, explores simple and complex matching scenarios, and introduces batch matching, supply‑demand prediction, chain dispatch, and AI‑driven techniques used by Didi to improve efficiency and fairness.
Didi’s ride‑hailing dispatch system has progressed from a simple greedy, first‑come‑first‑served matcher to sophisticated batch, chain, and predictive algorithms that use deep‑learning demand forecasts and reinforcement‑learning optimization to assign drivers under complex business rules, boosting response rates and serving over 30 million daily requests.
