Mix and match: Markov chains and mixing times for matching in rideshare (Q776248)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Mix and match: Markov chains and mixing times for matching in rideshare |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Mix and match: Markov chains and mixing times for matching in rideshare |
scientific article |
Statements
Mix and match: Markov chains and mixing times for matching in rideshare (English)
0 references
30 June 2020
0 references
0 references
0.7309647798538208
0 references
0.7298073172569275
0 references
0.7138420343399048
0 references
0.7045066356658936
0 references
0.6890409588813782
0 references
