online matching

Matching Policy Design for Gig Platforms with “Priority” Features AAAI 2026 Online Capacitated General Matching with Knapsack AAAI 2026 Design a Win-Win Strategy That Is Fair to Both Service Providers and Tasks When Rejection Is Not an Option IJCAI 2024 Fairness and Efficiency in Online Class Matching NeurIPS 2024 Online Matching with Stochastic Rewards: Provable Better Bound via Adversarial Reinforcement Learning ICML 2024 Promoting Fairness Among Dynamic Agents in Online-Matching Markets under Known Stationary Arrival Distributions NeurIPS 2024 Class Fairness in Online Matching AAAI 2023 Fully Online Matching with Stochastic Arrivals and Departures AAAI 2023 Primal-Dual Algorithms with Predictions for Online Bounded Allocation and Ad-Auctions Problems ALT 2023 Multi-slots Online Matching with High Entropy ICML 2022 Online Matching with Controllable Rewards and Arrival Probabilities IJCAI 2022 Online Task Assignment Problems with Reusable Resources AAAI 2022 Secretary Matching with Vertex Arrivals and No Rejections AAAI 2022 A Primal-Dual Online Algorithm for Online Matching Problem in Dynamic Environments AAAI 2021 Online Matching in Sparse Random Graphs: Non-Asymptotic Performances of Greedy Algorithm NeurIPS 2021 A Unified Approach to Online Matching with Conflict-Aware Constraints AAAI 2019 Balancing Relevance and Diversity in Online Bipartite Matching via Submodularity AAAI 2019 Robust Online Matching with User Arrival Distribution Drift AAAI 2019 Bi-Objective Online Matching and Submodular Allocations NeurIPS 2016