arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1907.00313cs.AI
收藏

具有公平约束的多臂强盗资源分配问题

Multi-Armed Bandits with Fairness Constraints for Distributing Resources to Human Teammates

Cornell University(康奈尔大学);University of Southern California(南加州大学)

Houston Claure, Yifang Chen, Jignesh Modi, Malte Jung, Stefanos Nikolaidis

摘要:

一个与多人协作的机器人应该如何决定资源的分配(例如社会关注度,或装配所需的零件)?人们对资源的分配方式有着独特的理解。将更多资源分配给一个团队成员而不是另一个团队成员的决定可能会被认为是不公平的,可能会对信任产生不利影响。我们引入了一个多臂强盗算法的公平性约束,其中一个机器人分配资源给人类队友的不同技能水平。在这个问题中,机器人并不知道每个人类队友的技能水平,而是通过观察他们随着时间的推移的表现来学习。我们将公平性定义为对每个人类队友在整个任务中被选择的最低比率的约束。我们提供了理论上的性能保证,并进行了大规模的用户研究,在那里我们调整我们的算法的公平性水平。结果表明,资源分配的公平性对系统中用户的信任有显著影响。

英文摘要:

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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑