Search Results for author:
Found 4 papers, 1 papers with code
CLAIM: Curriculum Learning Policy for Influence Maximization in Unknown Social Networks
Influence maximization is the problem of finding a small subset of nodes in a network that can maximize the diffusion of information.
Competitive Ratios for Online Multi-capacity Ridesharing
The desired matching between resources and request groups is constrained by the edges between requests and request groups in this tripartite graph (i. e., a request can be part of at most one request group in the final assignment).
Zone pAth Construction (ZAC) based Approaches for Effective Real-Time Ridesharing
This challenge has been addressed in existing work by: (i) generating as many relevant feasible (with respect to the available delay for customers) combinations of requests as possible in real-time; and then (ii) optimizing assignment of the feasible request combinations to vehicles.
Neural Approximate Dynamic Programming for On-Demand Ride-Pooling
This is because even a myopic assignment in ride-pooling involves considering what combinations of passenger requests that can be assigned to vehicles, which adds a layer of combinatorial complexity to the ToD problem.
