When Hashing Met Matching: Efficient Search for Potential Matches in Ride Sharing

09/07/2018
by   Chinmoy Dutta, et al.
0

We study the problem of matching rides in a ride sharing platform. Such platforms face the daunting combinatorial task of finding potential matches for rides from a matching pool of tens of thousands of rides very efficiently while retaining near-optimality compared to an exhaustive search. We formalize this problem and present a novel algorithm for it based on the beautiful theory of locality sensitive hashing for Maximum Inner Product Search (MIPS). The proposed algorithm can find k (can be practically a constant for ride sharing platforms) potential matches for a given ride from a pool of n rides in sub-linear time O(n^ρ (k + n) k) for ρ < 1, which is significant saving compared to an exhaustive search in the pool requiring O(n) time. The space requirement for our algorithm is O(n^1 + ρ k). We show that the set of k potential matches include the near-optimal ones with high probability. Implementation of our algorithm could efficiently find near-optimal set of potential matches with high probability from a pool of thousands of real rides.

READ FULL TEXT
research
05/28/2019

A near-optimal algorithm for approximating the John Ellipsoid

We develop a simple and efficient algorithm for approximating the John E...
research
06/22/2019

Algorithms for Similarity Search and Pseudorandomness

We study the problem of approximate near neighbor (ANN) search and show ...
research
10/20/2014

Improved Asymmetric Locality Sensitive Hashing (ALSH) for Maximum Inner Product Search (MIPS)

Recently it was shown that the problem of Maximum Inner Product Search (...
research
10/31/2022

Indexability is Not Enough for Whittle: Improved, Near-Optimal Algorithms for Restless Bandits

We study the problem of planning restless multi-armed bandits (RMABs) wi...
research
06/01/2022

Near-Optimal Search Time in δ-Optimal Space

Two recent lower bounds on the compressiblity of repetitive sequences, δ...
research
03/11/2019

conLSH: Context based Locality Sensitive Hashing for Mapping of noisy SMRT Reads

Single Molecule Real-Time (SMRT) sequencing is a recent advancement of N...
research
02/16/2021

Efficient Competitions and Online Learning with Strategic Forecasters

Winner-take-all competitions in forecasting and machine-learning suffer ...

Please sign up or login with your details

Forgot password? Click here to reset