{"total":14,"rows":[{"id":"2303.00968","title":"Dynamic fairness-aware recommendation through multi-agent social choice","created":"2023-03-02","cited_by_count":9,"area":null},{"id":"2505.19252","title":"Learning-Augmented Online Bipartite Fractional Matching","created":"2025-05-25","cited_by_count":8,"area":null},{"id":"2108.04862","title":"Matching Algorithms for Blood Donation","created":"2021-08-10","cited_by_count":7,"area":null},{"id":"2201.06021","title":"Rawlsian Fairness in Online Bipartite Matching: Two-sided, Group, and Individual","created":"2022-01-16","cited_by_count":7,"area":null},{"id":"2108.06371","title":"Near-Optimal Reviewer Splitting in Two-Phase Paper Reviewing and Conference Experiment Design","created":"2021-08-13","cited_by_count":6,"area":null},{"id":"2109.08934","title":"Fairness Maximization among Offline Agents in Online-Matching Markets","created":"2021-09-18","cited_by_count":6,"area":null},{"id":"2105.10625","title":"Combinatorial Blocking Bandits with Stochastic Delays","created":"2021-05-22","cited_by_count":3,"area":null},{"id":"2303.14646","title":"A Survey of Machine Learning-Based Ride-Hailing Planning","created":"2023-03-26","cited_by_count":3,"area":null},{"id":"2203.07605","title":"Online Task Assignment Problems with Reusable Resources","created":"2022-03-15","cited_by_count":1,"area":null},{"id":"2301.03099","title":"Fully Dynamic Online Selection through Online Contention Resolution Schemes","created":"2023-01-08","cited_by_count":0,"area":null},{"id":"2407.00032","title":"Design a Win-Win Strategy That Is Fair to Both Service Providers and Tasks When Rejection Is Not an Option","created":"2024-05-22","cited_by_count":0,"area":null},{"id":"2602.18431","title":"SMaRT: Online Reusable Resource Assignment and an Application to Mediation in the Kenyan Judiciary","created":"2026-02-20","cited_by_count":0,"area":null},{"id":"2609.20200","title":"JointMatch: A Unified Heterogeneous Graph Neural Solver for Large-Scale Ride-Sharing Matching","created":"2026-07-25","cited_by_count":0,"area":null},{"id":"2610.19038","title":"Lag: A Mean-Field Optimal Policy for Online Assignment with Reusable Resources","created":"2026-10-13","cited_by_count":0,"area":null}],"next_cursor":null}