% Key papers for Online allocation with constraints (scime atlas, https://atlas.scime.ai). Authors are not included: add them from the paper pages.

@inproceedings{aaai2018_allocation_101027,
  title = {{Allocation Problems in Ride-Sharing Platforms: Online Matching With Offline Reusable Resources}},
  booktitle = {AAAI Conference on Artificial Intelligence (AAAI)},
  year = {2018},
  url = {https://ojs.aaai.org/index.php/AAAI/article/view/11477},
}

@inproceedings{neurips2017_online_56544,
  title = {{Online Influence Maximization under Independent Cascade Model with Semi-Bandit Feedback}},
  booktitle = {Advances in Neural Information Processing Systems (NeurIPS)},
  year = {2017},
  url = {https://nips.cc/virtual/2017/poster/9087},
}

@inproceedings{icml2019_online_37615,
  title = {{Online Algorithms for Rent-Or-Buy with Expert Advice}},
  booktitle = {International Conference on Machine Learning (ICML)},
  year = {2019},
  url = {https://icml.cc/virtual/2019/poster/4288},
}

@inproceedings{icml2020_dual_38135,
  title = {{Dual Mirror Descent for Online Allocation Problems}},
  booktitle = {International Conference on Machine Learning (ICML)},
  year = {2020},
  url = {https://icml.cc/virtual/2020/poster/6241},
}

@inproceedings{neurips2018_efficient_57086,
  title = {{Efficient Online Portfolio with Logarithmic Regret}},
  booktitle = {Advances in Neural Information Processing Systems (NeurIPS)},
  year = {2018},
  url = {https://nips.cc/virtual/2018/poster/11788},
}

@inproceedings{neurips2018_near_57418,
  title = {{Near-Optimal Policies for Dynamic Multinomial Logit Assortment Selection Models}},
  booktitle = {Advances in Neural Information Processing Systems (NeurIPS)},
  year = {2018},
  url = {https://nips.cc/virtual/2018/poster/11315},
}

@inproceedings{neurips2022_online_64456,
  title = {{Online Bipartite Matching with Advice: Tight Robustness-Consistency Tradeoffs for the Two-Stage Model}},
  booktitle = {Advances in Neural Information Processing Systems (NeurIPS)},
  year = {2022},
  url = {https://nips.cc/virtual/2022/poster/52991},
}

@inproceedings{neurips2020_simple_60828,
  title = {{Simple and Fast Algorithm for Binary Integer and Online Linear Programming}},
  booktitle = {Advances in Neural Information Processing Systems (NeurIPS)},
  year = {2020},
  url = {https://nips.cc/virtual/2020/poster/17596},
}

@inproceedings{neurips2016_hardness_55765,
  title = {{Hardness of Online Sleeping Combinatorial Optimization Problems}},
  booktitle = {Advances in Neural Information Processing Systems (NeurIPS)},
  year = {2016},
  url = {https://nips.cc/virtual/2016/poster/7136},
}

@inproceedings{neurips2021_complexity_61947,
  title = {{Complexity Lower Bounds for Nonconvex-Strongly-Concave Min-Max Optimization}},
  booktitle = {Advances in Neural Information Processing Systems (NeurIPS)},
  year = {2021},
  url = {https://nips.cc/virtual/2021/poster/26788},
}

@inproceedings{neurips2017_near_56501,
  title = {{Near Minimax Optimal Players for the Finite-Time 3-Expert Prediction Problem}},
  booktitle = {Advances in Neural Information Processing Systems (NeurIPS)},
  year = {2017},
  url = {https://nips.cc/virtual/2017/poster/9088},
}

@inproceedings{neurips2021_online_61219,
  title = {{Online Knapsack with Frequency Predictions}},
  booktitle = {Advances in Neural Information Processing Systems (NeurIPS)},
  year = {2021},
  url = {https://nips.cc/virtual/2021/poster/27555},
}

@inproceedings{aaai2021_competitive_275,
  title = {{Competitive Analysis for Two-Level Ski-Rental Problem}},
  booktitle = {AAAI Conference on Artificial Intelligence (AAAI)},
  year = {2021},
  url = {https://aaai.org/papers/12034-competitive-analysis-for-two-level-ski-rental-problem/},
}

@inproceedings{aaai2021_online_1111,
  title = {{Online DR-Submodular Maximization: Minimizing Regret and Constraint Violation}},
  booktitle = {AAAI Conference on Artificial Intelligence (AAAI)},
  year = {2021},
  url = {https://aaai.org/papers/09395-online-dr-submodular-maximization-minimizing-regret-and-constraint-violation/},
}

@inproceedings{icml2022_online_40956,
  title = {{Online Learning for Min Sum Set Cover and Pandora’s Box}},
  booktitle = {International Conference on Machine Learning (ICML)},
  year = {2022},
  url = {https://icml.cc/virtual/2022/poster/17417},
}

@inproceedings{neurips2022_a_64337,
  title = {{A Unifying Framework for Online Optimization with Long-Term Constraints}},
  booktitle = {Advances in Neural Information Processing Systems (NeurIPS)},
  year = {2022},
  url = {https://nips.cc/virtual/2022/poster/54564},
}

@inproceedings{aaai2023_an_3106,
  title = {{An Improved Algorithm for Online Min-Sum Set Cover}},
  booktitle = {AAAI Conference on Artificial Intelligence (AAAI)},
  year = {2023},
  url = {https://ojs.aaai.org/index.php/AAAI/article/view/25835},
}

@inproceedings{neurips2018_community_56950,
  title = {{Community Exploration: From Offline Optimization to Online Learning}},
  booktitle = {Advances in Neural Information Processing Systems (NeurIPS)},
  year = {2018},
  url = {https://nips.cc/virtual/2018/poster/11535},
}

@inproceedings{neurips2020_improved_60053,
  title = {{Improved Algorithms for Online Submodular Maximization via First-order Regret Bounds}},
  booktitle = {Advances in Neural Information Processing Systems (NeurIPS)},
  year = {2020},
  url = {https://nips.cc/virtual/2020/poster/18309},
}

@inproceedings{neurips2022_dynamic_66216,
  title = {{Dynamic Learning in Large Matching Markets}},
  booktitle = {Advances in Neural Information Processing Systems (NeurIPS)},
  year = {2022},
  url = {https://nips.cc/virtual/2022/poster/53547},
}

@inproceedings{aaai2024_improved_6283,
  title = {{Improved Bandits in Many-to-One Matching Markets with Incentive Compatibility}},
  booktitle = {AAAI Conference on Artificial Intelligence (AAAI)},
  year = {2024},
  url = {https://ojs.aaai.org/index.php/AAAI/article/view/29226},
}

@inproceedings{neurips2025_on_77547,
  title = {{On the Universal Near Optimality of Hedge in Combinatorial Settings}},
  booktitle = {Advances in Neural Information Processing Systems (NeurIPS)},
  year = {2025},
  url = {https://openreview.net/forum?id=V7m2oQ5OFW},
}

@inproceedings{aaai2025_augmenting_8184,
  title = {{Augmenting Online Algorithms for Knapsack Problem with Total Weight Information}},
  booktitle = {AAAI Conference on Artificial Intelligence (AAAI)},
  year = {2025},
  url = {https://ojs.aaai.org/index.php/AAAI/article/view/34875},
}

@inproceedings{aaai2025_improved_9517,
  title = {{Improved Bounds for Online Facility Location with Predictions}},
  booktitle = {AAAI Conference on Artificial Intelligence (AAAI)},
  year = {2025},
  url = {https://ojs.aaai.org/index.php/AAAI/article/view/34903},
}

@inproceedings{iclr2024_learning_34591,
  title = {{Learning Optimal Contracts: How to Exploit Small Action Spaces}},
  booktitle = {International Conference on Learning Representations (ICLR)},
  year = {2024},
  url = {https://iclr.cc/virtual/2024/poster/18483},
}

@inproceedings{iclr2024_learning_35346,
  title = {{Learning Thresholds with Latent Values and Censored Feedback}},
  booktitle = {International Conference on Learning Representations (ICLR)},
  year = {2024},
  url = {https://iclr.cc/virtual/2024/poster/17727},
}

@inproceedings{icml2024_online_44414,
  title = {{Online Resource Allocation with Non-Stationary Customers}},
  booktitle = {International Conference on Machine Learning (ICML)},
  year = {2024},
  url = {https://icml.cc/virtual/2024/poster/34038},
}

@inproceedings{icml2025_learning_47830,
  title = {{Learning-Augmented Algorithms for MTS with Bandit Access to Multiple Predictors}},
  booktitle = {International Conference on Machine Learning (ICML)},
  year = {2025},
  url = {https://icml.cc/virtual/2025/poster/44771},
}

@inproceedings{icml2026_a_53209,
  title = {{A Two-Layer Framework for Joint Online Configuration Selection and Admission Control}},
  booktitle = {International Conference on Machine Learning (ICML)},
  year = {2026},
  url = {https://openreview.net/forum?id=dEszwexTMi},
}

@inproceedings{icml2026_online_54587,
  title = {{Online Social Welfare Function-based Resource Allocation}},
  booktitle = {International Conference on Machine Learning (ICML)},
  year = {2026},
  url = {https://openreview.net/forum?id=qSNU4NmDpE},
}

@inproceedings{icml2026_online_54695,
  title = {{Online Packet Scheduling with Deadlines and Learning}},
  booktitle = {International Conference on Machine Learning (ICML)},
  year = {2026},
  url = {https://openreview.net/forum?id=rZTiFcDihH},
}

@inproceedings{neurips2024_queueing_70154,
  title = {{Queueing Matching Bandits with Preference Feedback}},
  booktitle = {Advances in Neural Information Processing Systems (NeurIPS)},
  year = {2024},
  url = {https://neurips.cc/virtual/2024/poster/96929},
}

@inproceedings{neurips2024_noisy_70575,
  title = {{Noisy Dual Mirror Descent: A Near Optimal Algorithm for Jointly-DP Convex Resource Allocation}},
  booktitle = {Advances in Neural Information Processing Systems (NeurIPS)},
  year = {2024},
  url = {https://neurips.cc/virtual/2024/poster/96542},
}

@inproceedings{neurips2024_communication_71460,
  title = {{Communication Bounds for the Distributed Experts Problem}},
  booktitle = {Advances in Neural Information Processing Systems (NeurIPS)},
  year = {2024},
  url = {https://neurips.cc/virtual/2024/poster/95796},
}

@inproceedings{neurips2025_near_75440,
  title = {{Near-Optimal Regret-Queue Length Tradeoff in Online Learning for Two-Sided Markets}},
  booktitle = {Advances in Neural Information Processing Systems (NeurIPS)},
  year = {2025},
  url = {https://openreview.net/forum?id=88IP02bmrg},
}

@inproceedings{neurips2025_stable_76261,
  title = {{Stable Matching with Ties: Approximation Ratios and Learning}},
  booktitle = {Advances in Neural Information Processing Systems (NeurIPS)},
  year = {2025},
  url = {https://openreview.net/forum?id=HPmDgKOlM3},
}

@inproceedings{neurips2025_incentive_77717,
  title = {{Incentive-Aware Dynamic Resource Allocation under Long-Term Cost Constraints}},
  booktitle = {Advances in Neural Information Processing Systems (NeurIPS)},
  year = {2025},
  url = {https://openreview.net/forum?id=Wm5cizmdcm},
}

@inproceedings{neurips2025_online_78039,
  title = {{Online Two-Stage Submodular Maximization}},
  booktitle = {Advances in Neural Information Processing Systems (NeurIPS)},
  year = {2025},
  url = {https://openreview.net/forum?id=aTlVrJRrNg},
}

@inproceedings{neurips2025_learning_78096,
  title = {{Learning-Augmented Online Bipartite Fractional Matching}},
  booktitle = {Advances in Neural Information Processing Systems (NeurIPS)},
  year = {2025},
  url = {https://openreview.net/forum?id=aywsq2Bkom},
}

@inproceedings{neurips2025_non_78617,
  title = {{Non-Clairvoyant Scheduling with Progress Bars}},
  booktitle = {Advances in Neural Information Processing Systems (NeurIPS)},
  year = {2025},
  url = {https://openreview.net/forum?id=gYbreatcV1},
}