Abstract: Computer-implemented methods, devices, and systems for matching a requester with at least one requestee. An input representing a request from the requester is received. A top-k learning tree-based deep model is applied to at least one node embedding representing at least one requestee successively across at least one time window. Each output from each time window is concatenated with the input into a neural network input. A neural network determines each probability for the input to match each requestee. At least one requestee is presented to the requester for approval based on the probability for the input to match the requestee.