Search

Krishna Kumar Selvam

from San Francisco, CA
Age ~35
Get Report
Connected to:
Aarthy Selvamani, 38Manju Selvam, 39Nirmala M Selvam, 71Rajalakshmi Selvam, 43Sathish Selvam, 40Uma M Selvam, 45Kalayini Selvanayagam, 68Prem K Selvan, 39Senthil Selvan, 51Rajeshwaran Selvanesan, 52

Krishna Selvam Phones & Addresses

  • San Francisco, CA
  • San Mateo, CA
  • Cambridge, MA

Resumes

Resumes

Krishna Selvam Photo 1

Staff Research Scientist

View page
Location:
Miami, FL
Industry:
Financial Services
Work:
Lyft
Staff Research Scientist
Nomis Solutions Sep 2014 - Dec 2015
Modeling Analyst
Massachusetts Institute of Technology (Mit) Sep 2012 - Jun 2014
Research Assistant
Sh&E Jun 2013 - Aug 2013
Aviation Intern
Indian Institute of Technology, Madras Aug 2011 - Jul 2012
Research Assistant
Education:
Massachusetts Institute of Technology 2012 - 2014
Masters, Engineering Indian Institute of Technology, Madras 2011 - 2012
Masters Indian Institute of Technology, Madras 2007 - 2011
Bachelors, Civil Engineering D.a.v. Senior Secondary School 2007
D.a.v. Senior Secondary School 2005
Skills:
Simulations
Matlab
Data Analysis
Algorithms
C++
R
Statistics
C
Statistical Modeling
Latex
Numerical Analysis
Operations Research
Research
Transportation Planning
Autocad
Data Mining
Languages:
English
Hindi
Tamil
Krishna Selvam Photo 2

Krishna Selvam

View page
Krishna Selvam Photo 3

Krishna Selvam

View page
Krishna Selvam Photo 4

Krishna Selvam

View page

Publications

Us Patents

Systems And Methods For Matching Transportation Devices Based On Conversion Probability

View page
US Patent:
20210082075, Mar 18, 2021
Filed:
Dec 17, 2019
Appl. No.:
16/718129
Inventors:
- San Francisco CA, US
Mayank Gulati - San Francisco CA, US
Krishna Kumar Selvam - San Francisco CA, US
Aleksandr Zamoshchin - San Francisco CA, US
International Classification:
G06Q 50/30
G06Q 30/06
Abstract:
The disclosed computer-implemented method may include implementing factors and conversion probabilities when matching a transportation requestor to a transportation provider. Matches between transportation requestors and transportation providers that rely solely on an estimation of arrival time may not give requestors or providers the best transportation options. Lacking these optimal transportation options, requestors and providers may move to other platforms. By looking at a various transportation factors and conversion probabilities, the method may provide optimal transportation options to both requestors and providers. Various other methods, systems, and computer-readable media are also disclosed.

Systems And Methods For Matching Provider Devices To Multiple Requestor Devices

View page
US Patent:
20210082076, Mar 18, 2021
Filed:
Dec 17, 2019
Appl. No.:
16/718130
Inventors:
- San Francisco CA, US
Peter Bansuk Lee - San Francisco CA, US
Krishna Kumar Selvam - San Francisco CA, US
Charles Parker Sielman - San Francisco CA, US
Aleksandr Zamoshchin - San Francisco CA, US
International Classification:
G06Q 50/30
G06Q 10/02
G01C 21/34
H04W 4/021
Abstract:
The disclosed computer-implemented method may calculate individual utility metrics for each combination of potential transportation requestors and cancellations to arrive at a more accurate total expected utility for shared transportation. In one embodiment, the method may reduce computation resource requirements by calculating each cancellation probability independently. In some examples, the method may only calculate utility metrics for some fixed number and/or percentage of the most probable combinations. In some embodiments, the method may account for travel time and/or distance when calculating utility metrics. By making matching decisions for shared transportation that account for the possibility of cancellation, the method may improve the efficiency of the transportation network. Various other methods, systems, and computer-readable media are also disclosed.

Determining Matches Using Dynamic Provider Eligibility Model

View page
US Patent:
20200072622, Mar 5, 2020
Filed:
Aug 5, 2019
Appl. No.:
16/531897
Inventors:
- San Francisco CA, US
Robert Anthony Farmer - San Mateo CA, US
Krishna Kumar Selvam - San Francisco CA, US
International Classification:
G01C 21/34
G01C 21/36
H04W 4/029
H04W 4/02
Abstract:
Embodiments provide techniques, including systems and methods, for determining matches of requestors and providers based on a dynamic provider eligibility model. For example, a request matching model uses an estimated arrival time for a requestor and estimated travel times for available providers to a pickup location to determine eligible providers for matching to a ride request. The matching model determines those providers that are far enough away from the request location to allow the requestor time to arrive at the pickup location without matching providers that are too far away, causing delay for the requestor and lowering the efficiency of the system by taking provider system resources from other service areas and increasing provider downtime upon matching. Additionally, embodiments provide more efficient matching processing leading to fewer canceled matched requests, fewer requests for a successful match, and fewer system resources necessary to meet requestor demand.

Systems And Methods For Matching Transportation Requests Over Extended Batching Windows

View page
US Patent:
20200005205, Jan 2, 2020
Filed:
Jun 29, 2018
Appl. No.:
16/024349
Inventors:
- San Francisco CA, US
Vincent Chih-jye Chang - San Francicso CA, US
Dor Levi - San Francicso CA, US
Molly Angelica Ingles Lorenzo - San Francisco CA, US
Keshav Puranmalka - Seattle WA, US
Krishna Kumar Selvam - San Francisco CA, US
International Classification:
G06Q 10/06
Abstract:
The disclosed computer-implemented method may include matching transportation requests. By collecting and batching match requests over an extended period, a dynamic transportation matching system may identify more efficient matches (e.g., may match transportation requests with greater overlaps). In addition, by dynamically setting and/or extending the upper bound of time that a transportation request may remain batched with other transportation requests, the dynamic transportation matching system may account for contextual information thereby situationally improving matching efficiencies made possible with higher upper bounds while avoiding requestor dissatisfaction, lost conversions, or other inefficiencies that may result from upper bounds that are too high. Furthermore, by providing a notification interface for a transportation requestor device that notifies the requestor when to be ready, a transportation matching application may provide a positive requestor experience while allowing for longer match windows. Various other methods, systems, and computer-readable media are also disclosed.

Determining Matches Using Dynamic Provider Eligibility Model

View page
US Patent:
20180259351, Sep 13, 2018
Filed:
Mar 9, 2017
Appl. No.:
15/454906
Inventors:
- San Francisco CA, US
Robert Anthony Farmer - San Mateo CA, US
Krishna Kumar Selvam - San Francisco CA, US
International Classification:
G01C 21/34
H04W 4/02
G01C 21/36
Abstract:
Embodiments provide techniques, including systems and methods, for determining matches of requestors and providers based on a dynamic provider eligibility model. For example, a request matching model uses an estimated arrival time for a requestor and estimated travel times for available providers to a pickup location to determine eligible providers for matching to a ride request. The matching model determines those providers that are far enough away from the request location to allow the requestor time to arrive at the pickup location without matching providers that are too far away, causing delay for the requestor and lowering the efficiency of the system by taking provider system resources from other service areas and increasing provider downtime upon matching. Additionally, embodiments provide more efficient matching processing leading to fewer canceled matched requests, fewer requests for a successful match, and fewer system resources necessary to meet requestor demand.
Control profile
Krishna Kumar Selvam from San Francisco, CA, age ~35 Get Report