Corpus ID: 12667815

Allocation Problems in Ride-Sharing Platforms: Online Matching with Offline Reusable Resources

@inproceedings{Dickerson2018AllocationPI,
  title={Allocation Problems in Ride-Sharing Platforms: Online Matching with Offline Reusable Resources},
  author={John P. Dickerson and Karthik Abinav Sankararaman and Aravind Srinivasan and Pan Xu},
  booktitle={AAAI},
  year={2018}
}
  • John P. Dickerson, Karthik Abinav Sankararaman, +1 author Pan Xu
  • Published in AAAI 2018
  • Computer Science
  • Bipartite matching markets pair agents on one side of a market with agents, items, or contracts on the opposing side. [...] Key Method We show that our model is tractable by presenting an LP-based adaptive algorithm that achieves an online competitive ratio of 1/2 - eps for any given eps greater than 0. We also show that no non-adaptive algorithm can achieve a ratio of 1/2 + o(1) based on the same benchmark LP. Through a data-driven analysis on a massive openly-available dataset, we show our model is robust…Expand Abstract

    Citations

    Publications citing this paper.
    SHOWING 1-10 OF 22 CITATIONS

    A Unified Approach to Online Matching with Conflict-Aware Constraints

    VIEW 4 EXCERPTS
    CITES BACKGROUND

    Online Resource Allocation with Matching Constraints

    VIEW 2 EXCERPTS
    CITES METHODS

    Competitive Ratios for Online Multi-capacity Ridesharing

    VIEW 7 EXCERPTS
    CITES BACKGROUND, METHODS & RESULTS
    HIGHLY INFLUENCED

    FILTER CITATIONS BY YEAR

    2016
    2020

    CITATION STATISTICS

    • 6 Highly Influenced Citations

    • Averaged 7 Citations per year from 2018 through 2020

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 38 REFERENCES

    Online Stochastic Matching: Beating 1-1/e