nash social welfare

Fair Algorithms with Probing for Multi-Agent Multi-Armed Bandits AAAI 2026 Learning Fair Division from Bandit Feedback AISTATS 2024 Maximizing Nash Social Welfare under Two-Sided Preferences AAAI 2024 No-Regret Learning for Fair Multi-Agent Social Welfare Optimization NeurIPS 2024 An Efficient Algorithm for Fair Multi-Agent Multi-Armed Bandit with Low Regret AAAI 2023 Fairness and Welfare Quantification for Regret in Multi-Armed Bandits AAAI 2023 Finding Fair Allocations under Budget Constraints AAAI 2023 Nash Regret Guarantees for Linear Bandits NeurIPS 2023 Maximizing Nash Social Welfare in 2-Value Instances AAAI 2022 Almost Envy-freeness, Envy-rank, and Nash Social Welfare Matchings AAAI 2021 Budget-feasible Maximum Nash Social Welfare is Almost Envy-free IJCAI 2021 Fair Algorithms for Multi-Agent Multi-Armed Bandits NeurIPS 2021 Fair and Truthful Mechanisms for Dichotomous Valuations AAAI 2021 Improving Nash Social Welfare Approximations IJCAI 2019 Multi-Criteria Dimensionality Reduction with Applications to Fairness NeurIPS 2019 Fair and Efficient Social Choice in Dynamic Settings IJCAI 2017