Algorithmic fairness is an essential requirement as AI becomes integrated in society. In the case of social applications where AI distributes resources, algorithms often must make decisions that will benefit a subset of users, sometimes repeatedly or exclusively, while attempting to maximize specific outcomes. How should we design such systems to serve users more fairly? This paper explores this question in the case where a group of users works toward a shared goal in a social exergame called Step Heroes. We identify adverse outcomes in traditional multi-armed bandits (MABs) and formalize the Greedy Bandit Problem. We then propose a solution based on a new type of fairness-aware multi-armed bandit, Shapley Bandits. It uses the Shapley Value for increasing overall player participation and intervention adherence rather than the maximization of total group output, which is traditionally achieved by favoring only high-performing participants. We evaluate our approach via a user study (n=46). Our results indicate that our Shapley Bandits effectively mediates the Greedy Bandit Problem and achieves better user retention and motivation across the participants.

翻译：算法公平性是人工智能融入社会时的基本要求。在人工智能分配资源的社交应用中，算法通常需要做出能使部分用户受益的决策——有时是重复或排他性地——同时试图最大化特定结果。我们应如何设计此类系统以更公平地服务用户？本文以一款名为《Step Heroes》的社交运动游戏中用户群体共同完成目标的情境为例，探讨该问题。我们识别了传统多臂赌博机（MABs）中的不良结果，并正式定义了贪婪赌博机问题。随后基于一种新型公平感知多臂赌博机——Shapley Bandits提出解决方案。该方法利用Shapley值提升整体玩家参与度和干预依从性，而非通过偏向高表现参与者来最大化群体总产出（即传统方法）。我们通过用户研究（n=46）评估该方法，结果表明我们的Shapley Bandits能有效缓解贪婪赌博机问题，并在参与者中实现更优的用户留存与动机。