{"total":39,"rows":[{"id":"2210.06835","title":"Multi-agent Dynamic Algorithm Configuration","created":"2022-10-13","cited_by_count":36,"area":null},{"id":"2205.13930","title":"Fairness and Welfare Quantification for Regret in Multi-Armed Bandits","created":"2022-05-27","cited_by_count":17,"area":null},{"id":"2305.04699","title":"Runtime Monitoring of Dynamic Fairness Properties","created":"2023-05-08","cited_by_count":17,"area":null},{"id":"2208.12584","title":"Socially Fair Reinforcement Learning","created":"2022-08-26","cited_by_count":13,"area":null},{"id":"2209.11817","title":"An Efficient Algorithm for Fair Multi-Agent Multi-Armed Bandit with Low Regret","created":"2022-09-23","cited_by_count":10,"area":null},{"id":"2202.06830","title":"Online Approval Committee Elections","created":"2022-02-14","cited_by_count":9,"area":null},{"id":"2310.02023","title":"Nash Regret Guarantees for Linear Bandits","created":"2023-10-03","cited_by_count":9,"area":null},{"id":"2208.09254","title":"Mitigating Disparity while Maximizing Reward: Tight Anytime Guarantee for Improving Bandits","created":"2022-08-19","cited_by_count":8,"area":null},{"id":"2302.01377","title":"Learning with Exposure Constraints in Recommendation Systems","created":"2023-02-02","cited_by_count":8,"area":null},{"id":"2306.00324","title":"Achieving Fairness in Multi-Agent Markov Decision Processes Using Reinforcement Learning","created":"2023-06-01","cited_by_count":8,"area":null},{"id":"2405.20678","title":"No-Regret Learning for Fair Multi-Agent Social Welfare Optimization","created":"2024-05-31","cited_by_count":8,"area":null},{"id":"2302.07446","title":"On-Demand Communication for Asynchronous Multi-Agent Bandits","created":"2023-02-15","cited_by_count":7,"area":null},{"id":"2304.05219","title":"BanditQ: Fair Bandits with Guaranteed Rewards","created":"2023-04-11","cited_by_count":6,"area":null},{"id":"2412.10751","title":"p-Mean Regret for Stochastic Bandits","created":"2024-12-14","cited_by_count":6,"area":null},{"id":"2112.11818","title":"Decentralized Task Offloading in Edge Computing: A Multi-User Multi-Armed Bandit Approach","created":"2021-12-22","cited_by_count":5,"area":null},{"id":"2403.00116","title":"Federated Linear Contextual Bandits with Heterogeneous Clients","created":"2024-02-29","cited_by_count":4,"area":null},{"id":"2405.13919","title":"Fair Online Bilateral Trade","created":"2024-05-22","cited_by_count":4,"area":null},{"id":"2408.12845","title":"Keep Everyone Happy: Online Fair Division of Numerous Items with Few Copies","created":"2024-08-23","cited_by_count":4,"area":null},{"id":"2410.05856","title":"Stochastic Bandits for Egalitarian Assignment","created":"2024-10-08","cited_by_count":4,"area":null},{"id":"2510.21312","title":"Revisiting Social Welfare in Bandits: UCB is (Nearly) All You Need","created":"2025-10-24","cited_by_count":4,"area":null},{"id":"2205.05659","title":"Ranked Prioritization of Groups in Combinatorial Bandit Allocation","created":"2022-05-11","cited_by_count":3,"area":null},{"id":"2408.17313","title":"Fair Best Arm Identification with Fixed Confidence","created":"2024-08-30","cited_by_count":3,"area":null},{"id":"2311.04528","title":"Bandit Learning to Rank with Position-Based Click Models: Personalized and Equal Treatments","created":"2023-11-08","cited_by_count":2,"area":null},{"id":"2502.08542","title":"Beyond Predictions: A Participatory Framework for Multi-Stakeholder Decision-Making","created":"2025-02-12","cited_by_count":2,"area":null},{"id":"2402.03531","title":"Fairness and Privacy Guarantees in Federated Contextual Bandits","created":"2024-02-05","cited_by_count":1,"area":null},{"id":"2402.05575","title":"Simultaneously Achieving Group Exposure Fairness and Within-Group Meritocracy in Stochastic Bandits","created":"2024-02-08","cited_by_count":1,"area":null},{"id":"2402.11710","title":"A Note on Bias to Complete","created":"2024-02-18","cited_by_count":1,"area":null},{"id":"2410.05496","title":"Intuitions of Compromise: Utilitarianism vs. Contractualism","created":"2024-10-07","cited_by_count":1,"area":null},{"id":"2410.23867","title":"QuACK: A Multipurpose Queuing Algorithm for Cooperative $k$-Armed Bandits","created":"2024-10-31","cited_by_count":1,"area":null},{"id":"2505.05169","title":"Bandit Max-Min Fair Allocation","created":"2025-05-08","cited_by_count":1,"area":null},{"id":"2506.14988","title":"Fair Algorithms with Probing for Multi-Agent Multi-Armed Bandits","created":"2025-06-17","cited_by_count":1,"area":null},{"id":"2508.11070","title":"Your Recourse, My Loss? Algorithmic Recourse under Shared Constraints","created":"2025-08-14","cited_by_count":1,"area":null},{"id":"2605.06864","title":"Multi-Objective Multi-Agent Bandits: From Learning Efficiency to Fairness Optimization","created":"2026-05-07","cited_by_count":1,"area":null},{"id":"2305.14537","title":"Disincentivizing Polarization in Social Networks","created":"2023-05-23","cited_by_count":0,"area":null},{"id":"2502.15240","title":"Multi-agent Multi-armed Bandits with Minimum Reward Guarantee Fairness","created":"2025-02-21","cited_by_count":0,"area":null},{"id":"2511.23097","title":"Fairness in the Multi-Secretary Problem","created":"2025-11-28","cited_by_count":0,"area":null},{"id":"2601.10600","title":"Procedural Fairness in Multi-Agent Bandits","created":"2026-01-15","cited_by_count":0,"area":null},{"id":"2602.06361","title":"Envy-Free Allocation of Indivisible Goods via Noisy Queries","created":"2026-02-06","cited_by_count":0,"area":null},{"id":"2607.17311","title":"The Optimization Trilemma: Efficiency, Comfort and Fairness in Decentralized Multi-agent Coordination","created":"2026-07-19","cited_by_count":0,"area":null}],"next_cursor":null}