Mix and match: Markov chains and mixing times for matching in rideshare

DOI10.1007/978-3-030-35389-6_10zbMath1435.91126arXiv1912.00225OpenAlexW2991487268MaRDI QIDQ776248

John P. Dickerson, Pan Xu, Aravind Srinivasan, Yuhao Wan, Karthik Abinav Sankararaman, Michael T. Curry

Publication date: 30 June 2020

Full work available at URL: https://arxiv.org/abs/1912.00225

Mathematics Subject Classification ID

Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.) (60J20) Matching models (91B68)

Cites Work

• Unnamed Item
• An introduction to MCMC for machine learning
• Online spatio-temporal matching in stochastic and dynamic domains
• Bayesian Mechanism Design
• Equation of State Calculations by Fast Computing Machines
• Monte Carlo sampling methods using Markov chains and their applications
• The Monte Carlo Method

This page was built for publication: Mix and match: Markov chains and mixing times for matching in rideshare