Shared-account usage is common on short-video platforms, especially on mobile and tablet devices, where a single device is accessed by multiple users. While existing industrial solutions generally focus on behavior sequence purification to disentangle mixed user preferences, such approaches inherently depend on behavior accumulation and therefore lack the capability for real-time user identification. To adapt to online recommendation, utilizing gesture interaction features is a natural and promising option, as they (1) are instantaneous without behavior collection and (2) naturally encode fine-grained user operation habits. Nevertheless, we empirically observe that directly incorporating raw gesture features into recommendation models yields limited gains. Identity-discriminative patterns embedded in gesture signals are largely entangled during the main model training, preventing them from being leveraged as explicit and reliable identity cues. As a result, efficiently utilizing gesture information to provide more distinct identity signals for recommendation models remains a critical challenge. To address this issue, we propose G-CORE (Gesture Clustering for Real-time REcommendation), an unsupervised framework that disentangles gesture representations via clustering before integrating them into the main recommendation model. By providing clearer and more identity-aware signals, G-CORE enables the main model with faster user switching without relying on a volume of behavior accumulation. Through extensive offline experiments and online A/B tests on Kuaishou platform, G-CORE demonstrates its effectiveness in various shared-account scenarios, and has been successfully deployed in the Mobile and Tablet system of the platform.

Assigning orders to drivers under localized spatiotemporal context (micro-view order-dispatching) is a major task in Didi, as it influences ride-hailing service experience. Existing industrial solutions mainly follow a two-stage pattern that incorporate heuristic or learning-based algorithms with naive combinatorial methods, tackling the uncertainty of both sides' behaviors, including emerging timings, spatial relationships, and travel duration, etc. In this paper, we propose a one-stage end-to-end reinforcement learning based order-dispatching approach that solves behavior prediction and combinatorial optimization uniformly in a sequential decision-making manner. Specifically, we employ a two-layer Markov Decision Process framework to model this problem, and present Deep Double Scalable Network (D2SN), an encoder-decoder structure network to generate order-driver assignments directly and stop assignments accordingly. Besides, by leveraging contextual dynamics, our approach can adapt to the behavioral patterns for better performance. Extensive experiments on Didi's real-world benchmarks justify that the proposed approach significantly outperforms competitive baselines in optimizing matching efficiency and user experience tasks. In addition, we evaluate the deployment outline and discuss the gains and experiences obtained during the deployment tests from the view of large-scale engineering implementation.

Achieving optimal order dispatching has been a long-standing challenge for online ride-hailing platforms. Early methods would make shortsighted matchings as they only consider order prices alone as the edge weights in the driver-order bipartite graph, thus harming the platform's revenue. To address this problem, recent works evaluate the value of the order's destination region to be the long-term income a driver could obtain in average in such region and incorporate it into the order's edge weight to influence the matching results. However, they often result in insufficient driver supplies in many regions, as the values evaluated in different regions vary greatly, mainly because the impact of one region's value on the future number of drivers and revenue in other regions is overlooked. This paper models such impact within a cooperative Markov game, which involves each value's impact over the platform's revenue with the goal to find the optimal region values for revenue maximization. To solve this game, our work proposes a novelgoal-reaching collaboration (GRC) algorithm that realizes credit assignment from a novel goal-reaching perspective, addressing the difficulty for accurate credit assignment with large-scale agents of previous methods and resolving the conflict between credit assignment and offline reinforcement learning. Specifically, during training, GRC predicts the city's future state through an environment model and utilizes a scoring model to rate the predicted states to judge their levels of profitability, where high-scoring states are regarded as the goal states. Then, the policies in the game are updated to promote the city to stay in the goal states for as long as possible. To evaluate GRC, we deploy a baseline policy online in several cities for three weeks to collect real-world dataset. Training and testing results on the collected dataset indicate that our GRC consistently outperforms the baselines in different cities and peak periods.