{"total":5,"rows":[{"id":"2506.13244","title":"No-Regret Learning Under Adversarial Resource Constraints: A Spending Plan Is All You Need!","created":"2025-06-16","cited_by_count":5,"area":null},{"id":"2505.20010","title":"Data-Dependent Regret Bounds for Constrained MABs","created":"2025-05-26","cited_by_count":2,"area":null},{"id":"2602.14580","title":"Replicable Constrained Bandits","created":"2026-02-16","cited_by_count":2,"area":null},{"id":"2509.16650","title":"Safe and Near-Optimal Control with Online Dynamics Learning","created":"2025-09-20","cited_by_count":1,"area":null},{"id":"2605.06227","title":"Price of Fairness in Short-Term and Long-Term Algorithmic Selections","created":"2026-05-07","cited_by_count":0,"area":null}],"next_cursor":null}