conftrace_

nash social welfare

16 papers

Explore in graph

Also known as

NSW

Co-occurring keywords

multi-armed bandit (1098) fair division (158) approximation algorithm (630) regret bound (1926) fair allocation (73) indivisible good (46) multi-agent system (1819) fairness optimization (28) budget constraint (57) envy-free allocation (46)

Papers

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