Multi-Armed Bandits with Fairness Constraints for Distributing Resources to Human Teammates
How should a robot that collaborates with multiple people decide upon the distribution of resources (e.g. social attention, or parts needed for an assembly)? People are uniquely attuned to how resources are distributed. A decision to distribute more resources to one team member than another might be perceived as unfair with potentially detrimental effects for trust. We introduce a multi-armed bandit algorithm with fairness constraints, where a robot distributes resources to human teammates of different skill levels. In this problem, the robot does not know the skill level of each human teammate, but learns it by observing their performance over time. We define fairness as a constraint on the minimum rate that each human teammate is selected throughout the task. We provide theoretical guarantees on performance and perform a large-scale user study, where we adjust the level of fairness in our algorithm. Results show that fairness in resource distribution has a significant effect on users' trust in the system.
Code (0)
등록된 구현이 없습니다.
Tasks
FairnessMulti-Armed BanditsReinforcement LearningSimilar Papers 제목 키워드 기반
A Regret bound for Non-stationary Multi-Armed Bandits with Fairness Constraints
The multi-armed bandits' framework is the most common platform to study strategies for sequential decision-making problems. Recently, the notion of fairness has attracted a lot of attention in the machine learning commun…
Decision MakingFairnessMulti-Armed BanditsSequential Decision MakingEfficient Resource Allocation with Fairness Constraints in Restless Multi-Armed Bandits
Restless Multi-Armed Bandits (RMAB) is an apt model to represent decision-making problems in public health interventions (e.g., tuberculosis, maternal, and child care), anti-poaching planning, sensor monitoring, personal…
Decision MakingFairnessMulti-Armed BanditsOnline Restless Multi-Armed Bandits with Long-Term Fairness Constraints
Restless multi-armed bandits (RMAB) have been widely used to model sequential decision making problems with constraints. The decision maker (DM) aims to maximize the expected total reward over an infinite horizon under a…
Decision MakingFairnessMulti-Armed BanditsReinforcement Learning (RL)+1Thompson Sampling for Combinatorial Semi-bandits with Sleeping Arms and Long-Term Fairness Constraints
We study the combinatorial sleeping multi-armed semi-bandit problem with long-term fairness constraints~(CSMAB-F). To address the problem, we adopt Thompson Sampling~(TS) to maximize the total rewards and use virtual que…
FairnessMovie RecommendationThompson SamplingFairness of Exposure in Online Restless Multi-armed Bandits
Restless multi-armed bandits (RMABs) generalize the multi-armed bandits where each arm exhibits Markovian behavior and transitions according to their transition dynamics. Solutions to RMAB exist for both offline and onli…
FairnessMulti-Armed Bandits