{"total":13,"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":"2503.03195","title":"Online Bidding under RoS Constraints without Knowing the Value","created":"2025-03-05","cited_by_count":2,"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":"2603.18551","title":"Learning Decision-Sufficient Representations for Linear Optimization","created":"2026-03-19","cited_by_count":1,"area":null},{"id":"2309.15395","title":"Model-Free, Regret-Optimal Best Policy Identification in Online CMDPs","created":"2023-09-27","cited_by_count":0,"area":null},{"id":"2412.03983","title":"Safe and Efficient Online Convex Optimization with Linear Budget Constraints and Partial Feedback","created":"2024-12-05","cited_by_count":0,"area":null},{"id":"2503.02043","title":"Constrained Linear Thompson Sampling","created":"2025-03-03","cited_by_count":0,"area":null},{"id":"2510.01020","title":"The Good, the Bad, and the Sampled: a No-Regret Approach to Safe Online Classification","created":"2025-10-01","cited_by_count":0,"area":null},{"id":"2510.12523","title":"Multi-Armed Bandits with Minimum Aggregated Revenue Constraints","created":"2025-10-14","cited_by_count":0,"area":null},{"id":"2602.05019","title":"A Simple Reduction Scheme for Constrained Contextual Bandits with Adversarial Contexts via Regression","created":"2026-02-04","cited_by_count":0,"area":null},{"id":"2602.14543","title":"Truly Adapting to Adversarial Constraints in Constrained MABs","created":"2026-02-16","cited_by_count":0,"area":null},{"id":"2607.16895","title":"When Can Safe Controllers Adapt? Information before Commitment","created":"2026-07-18","cited_by_count":0,"area":null}],"next_cursor":null}