Conference Agenda

Overview and details of the sessions of this conference. Please select a date or location to show only sessions at that day or location. Please select a single session for detailed view (with abstracts and downloads if available).

 
 
Session Overview
Session
MC4 - SM8: Ride-hailing platforms
Time:
Monday, 26/June/2023:
MC 13:00-14:30

Location: Mezzanine

2nd floor

Show help for 'Increase or decrease the abstract text size'
Presentations

Price-waiting trade-offs in ride-hailing platforms

Aikaterini Giannoutsou, Andrew Daw

University of Southern California, United States of America

We present a model for studying a ride-hailing platform that is faced with price and delay sensitive riders and drivers, and is considering offering two different service classes which are differentiated in prices and delays. We explore the “price of two sides”, show that the preferences of drivers impact the delays the riders experience and demonstrate that achieving the “full optimum" of price differentiation may not be feasible or optimal for a platform in all market conditions.



Shared-ride efficiency of ride-hailing platforms

Terry Taylor

UC Berkeley, United States of America

Ride-hailing platforms offering shared rides devote effort to reducing improving shared-ride efficiency: reducing the trip-lengthening detours that accommodate fellow customers' divergent transportation needs. Contrary to naive intuition, we show: greater customer sensitivity to shared-ride delay and greater labor cost can reduce the value of improving shared-ride efficiency; and an increase in shared-ride efficiency can prompt a platform to add individual-ride service.



Matching technology and competition in ride-hailing marketplaces

Kaitlin Daniels1, Danko Turcic2

1Washington University in St. Louis; 2University of California, Riverside

TBD



 
Contact and Legal Notice · Contact Address:
Privacy Statement · Conference: MSOM 2023
Conference Software: ConfTool Pro 2.6.149+TC+CC
© 2001–2024 by Dr. H. Weinreich, Hamburg, Germany