{"paper":{"title":"Online Matching in a Ride-Sharing Platform","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Chinmoy Dutta, Chris Sholley","submitted_at":"2018-06-27T07:52:11Z","abstract_excerpt":"We propose a formal graph-theoretic model for studying the problem of matching rides online in a ride-sharing platform. Unlike most of the literature on online matching, our model, that we call {\\em Online Windowed Non-Bipartite Matching} ($\\mbox{OWNBM}$), pertains to online matching in {\\em non-bipartite} graphs. We show that the edge-weighted and vertex-weighted versions of our model arise naturally in ride-sharing platforms. We provide a randomized $\\frac{1}{4}$-competitive algorithm for the edge-weighted case using a beautiful result of Lehmann, Lehmann and Nisan (EC 2001) for combinatoria"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.10327","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"}