当前位置: X-MOL 学术arXiv.cs.GT › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
Evaluating and Rewarding Teamwork Using Cooperative Game Abstractions
arXiv - CS - Computer Science and Game Theory Pub Date : 2020-06-16 , DOI: arxiv-2006.09538
Tom Yan, Christian Kroer, Alexander Peysakhovich

Can we predict how well a team of individuals will perform together? How should individuals be rewarded for their contributions to the team performance? Cooperative game theory gives us a powerful set of tools for answering these questions: the Characteristic Function (CF) and solution concepts like the Shapley Value (SV). There are two major difficulties in applying these techniques to real world problems: first, the CF is rarely given to us and needs to be learned from data. Second, the SV is combinatorial in nature. We introduce a parametric model called cooperative game abstractions (CGAs) for estimating CFs from data. CGAs are easy to learn, readily interpretable, and crucially allow linear-time computation of the SV. We provide identification results and sample complexity bounds for CGA models as well as error bounds in the estimation of the SV using CGAs. We apply our methods to study teams of artificial RL agents as well as real world teams from professional sports.

中文翻译:

使用合作博弈抽象评估和奖励团队合作

我们能预测一个团队的个人表现如何吗?个人对团队绩效的贡献应该如何得到奖励?合作博弈论为我们提供了一组强大的工具来回答这些问题:特征函数 (CF) 和解决方案概念,如沙普利值 (SV)。将这些技术应用于现实世界的问题有两个主要困难:第一,CF 很少提供给我们,需要从数据中学习。其次,SV 本质上是组合的。我们引入了一种称为合作博弈抽象 (CGA) 的参数模型,用于从数据中估计 CF。CGA 易于学习、易于解释,并且至关重要的是允许对 SV 进行线性时间计算。我们提供了 CGA 模型的识别结果和样本复杂度界限,以及使用 CGA 估计 SV 的误差界限。我们将我们的方法应用于研究人工 RL 代理团队以及来自职业体育的现实世界团队。
更新日期:2020-06-18
down
wechat
bug