Marketplace Matching and Routing Questions

Study algorithmic and systems approaches for matching supply and demand and solving routing problems in multi sided marketplaces. Candidates should be able to formalize matching and dispatch problems using assignment, bipartite and multipartite matching, min cost flow, and vehicle routing formulations; reason about online and batch solutions; design approximation algorithms, greedy heuristics, and scalable distributed solvers; handle constraints such as time windows, capacity, batching, pooling, and fairness; consider incentive and pricing interactions with routing and allocation; evaluate solutions on metrics such as wait time, fill rate, throughput, and operational cost; and discuss simulation and offline evaluation strategies as well as integration with real time serving and monitoring.