{"total":13,"rows":[{"id":"2501.17513","title":"Sequential Learning of the Pareto Front for Multi-objective Bandits","created":"2025-01-29","cited_by_count":15,"area":null},{"id":"2502.13457","title":"Provably Efficient Multi-Objective Bandit Algorithms under Preference-Centric Customization","created":"2025-02-19","cited_by_count":5,"area":null},{"id":"2505.17869","title":"Best Group Identification in Multi-Objective Bandits","created":"2025-05-23","cited_by_count":2,"area":null},{"id":"2512.00930","title":"Thompson Sampling for Multi-Objective Linear Contextual Bandit","created":"2025-11-30","cited_by_count":2,"area":null},{"id":"2608.04324","title":"Efficient Online Lexicographic Generalized Low-Rank Matrix Bandits","created":"2026-08-05","cited_by_count":2,"area":null},{"id":"2306.01095","title":"Large-Batch, Iteration-Efficient Neural Bayesian Design Optimization","created":"2023-06-01","cited_by_count":1,"area":null},{"id":"2308.08046","title":"Regret Lower Bounds in Multi-agent Multi-armed Bandit","created":"2023-08-15","cited_by_count":1,"area":null},{"id":"2506.13125","title":"Stochastic Multi-Objective Multi-Armed Bandits: Regret Definition and Algorithm","created":"2025-06-16","cited_by_count":1,"area":null},{"id":"2601.10600","title":"Procedural Fairness in Multi-Agent Bandits","created":"2026-01-15","cited_by_count":0,"area":null},{"id":"2604.07096","title":"Are Stochastic Multi-objective Bandits Harder than Single-objective Bandits?","created":"2026-04-08","cited_by_count":0,"area":null},{"id":"2606.21929","title":"Selective Ensemble Based on Preference-Directed Multi-Objective Bandits","created":"2026-06-20","cited_by_count":0,"area":null},{"id":"2610.16840","title":"Few-for-Many Best-Arm Identification in Multi-Objective Bandits","created":"2026-10-12","cited_by_count":0,"area":null},{"id":"2610.18577","title":"When More Objectives Make Identification Easier: The Role of Preferences and Feedback","created":"2026-10-13","cited_by_count":0,"area":null}],"next_cursor":null}