基于Shapley Bandits的自适应社会博弈公平性改进
Improving Fairness in Adaptive Social Exergames via Shapley Bandits
摘要:
随着人工智能融入社会,算法公平性是一项基本要求。在人工智能分配资源的社交应用中,算法通常必须做出有利于一部分用户的决策,有时是重复的或排他性的,同时试图最大化特定的结果。我们应该如何设计这样的系统来更公平地为用户服务?本文探讨了这个问题的情况下,一组用户朝着一个共同的目标,在一个社会exergame称为步骤英雄。我们确定在传统的多武装土匪(MABs)的不利后果,并正式贪婪的土匪问题。然后,我们提出了一个解决方案的基础上,一种新型的公平意识的多臂强盗,Shapley强盗。它使用Shapley值来提高整体参与者的参与度和干预依从性,而不是最大化总的群体输出,这是传统上通过只支持高表现的参与者来实现的。我们通过用户研究(n=46)评估我们的方法。我们的研究结果表明,我们的Shapley Bandits有效地调解了贪婪的强盗问题,并在参与者中实现了更好的用户保留和动机。
英文摘要:
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.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。