Mix and Match: Markov Chains and Mixing Times for Matching in Rideshare (Conference Paper) | NSF PAGES

skip to main content

Citation Details

Mix and Match: Markov Chains and Mixing Times for Matching in Rideshare

Award ID(s):: 1749864

NSF-PAR ID:: 10149365

Author(s) / Creator(s):: Curry, Michael J; Dickerson, John P; Sankararaman, Karthik A; Srinivasan, Aravind; Wan, Yuhao; Xu, Pan

Date Published:: 2019-12-01

Journal Name:: Web and Internet Economics Conference (WINE)

Format(s):: Medium: X

Sponsoring Org:: National Science Foundation

Free Publicly Accessible Full Text
Accepted Manuscript1.0
Conference Paper:
The DOI is not currently available.