arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1709.04176cs.GTcs.AI
收藏

分配问题中Shapley值的计算:近似和界,以及对意大利VQR研究评估计划的应用

Computing the Shapley Value in Allocation Problems: Approximations and Bounds, with an Application to the Italian VQR Research Assessment Program

University of Calabria(卡拉布里亚大学);Sapienza University(罗马大学)

Francesco Lupia, Angelo Mendicelli, Andrea Ribichini, Francesco Scarcello, Marco Schaerf

摘要:

在分配问题中,一组给定的商品以这样一种方式分配给代理人,即社会福利最大化,即实现最大可能的全球价值。当商品是不可分割的,它是可能的,使用货币补偿,以执行一个公平的分配,考虑到实际贡献的所有代理人的社会福利。联盟博弈提供了一个正式的数学框架来模拟这些问题,特别是Shapley值是一个广泛用于以公平的方式分配价值给代理的解决方案概念。不幸的是,计算这个值是一个$\#{\rm P}$难题,因此在现实世界的问题中应用这个好的理论概念通常是相当困难的。我们描述了有用的属性,使我们能够大大简化分配问题的实例,而不影响任何球员的Shapley值。此外,我们提出了计算Shapley值的上界和下界的算法,在某些情况下,它提供了准确的结果,并可以与近似算法相结合。所提出的技术已被实施和测试的现实世界中的应用分配问题,即意大利的研究评估计划,被称为VQR。对于实验中考虑的大型大学来说,问题涉及成千上万的代理人和商品(这里是研究人员和他们的研究产品)。本文中描述的算法能够计算大多数这些代理的Shapley值,并获得所有代理的Shapley值的良好近似。

英文摘要:

In allocation problems, a given set of goods are assigned to agents in such a way that the social welfare is maximised, that is, the largest possible global worth is achieved. When goods are indivisible, it is possible to use money compensation to perform a fair allocation taking into account the actual contribution of all agents to the social welfare. Coalitional games provide a formal mathematical framework to model such problems, in particular the Shapley value is a solution concept widely used for assigning worths to agents in a fair way. Unfortunately, computing this value is a $\#{\rm P}$-hard problem, so that applying this good theoretical notion is often quite difficult in real-world problems. We describe useful properties that allow us to greatly simplify the instances of allocation problems, without affecting the Shapley value of any player. Moreover, we propose algorithms for computing lower bounds and upper bounds of the Shapley value, which in some cases provide the exact result and that can be combined with approximation algorithms. The proposed techniques have been implemented and tested on a real-world application of allocation problems, namely, the Italian research assessment program, known as VQR. For the large university considered in the experiments, the problem involves thousands of agents and goods (here, researchers and their research products). The algorithms described in the paper are able to compute the Shapley value for most of those agents, and to get a good approximation of the Shapley value for all of them.

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

↑