BEGIN:VCALENDAR
VERSION:2.0
PRODID:researchseminars.org
CALSCALE:GREGORIAN
X-WR-CALNAME:researchseminars.org
BEGIN:VEVENT
SUMMARY:Julia Yan (UBC Sauder School of Business)
DTSTART:20231102T210000Z
DTEND:20231102T220000Z
DTSTAMP:20260513T193650Z
UID:SFUOR/24
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/SFUOR/24/">P
 ricing Shared Rides</a>\nby Julia Yan (UBC Sauder School of Business) as p
 art of PIMS-CORDS SFU Operations Research Seminar\n\nLecture held in ASB 1
 0908.\n\nAbstract\nShared rides\, which pool individual riders into a sing
 le vehicle\, are essential for mitigating congestion and promoting more su
 stainable urban transportation. However\, major ridesharing platforms have
  long struggled to maintain a healthy and profitable shared rides product.
  To understand why shared rides have struggled\, we analyze procedures com
 monly used in practice to set static prices for shared rides\, and discuss
  their pitfalls. We then propose a pricing policy that is adaptive to matc
 hing outcomes\, dubbed match-based pricing\, which varies prices depending
  on whether a rider is dispatched alone or to what extent she is matched w
 ith another rider. Analysis on a single origin-destination setting reveals
  that match-based pricing is both profit-maximizing and altruistic\, simul
 taneously improving cost efficiency (i.e.\, the fraction of cost saved by 
 shared rides relative to individual rides) and reducing rider payments rel
 ative to the optimal static pricing policy. These theoretical results are 
 validated on a large-scale simulation with hundreds of origin-destinations
  from Chicago ridesharing data. The improvements in efficiency and reducti
 ons in payments are especially noticeable when costs are high and demand d
 ensity is low\, enabling healthy operations where they have historically b
 een most challenging.\n
LOCATION:https://researchseminars.org/talk/SFUOR/24/
END:VEVENT
END:VCALENDAR
