Computing the Shapley Value in Allocation Problems: Approximations and Bounds, with an Application to the Italian VQR Research Assessment Program
| Autor: | Marco Schaerf, Francesco Scarcello, Francesco Lupia, Andrea Ribichini, Angelo Mendicelli |
|---|---|
| Rok vydání: | 2017 |
| Předmět: |
FOS: Computer and information sciences
Coalitional games Computer science Computer Science - Artificial Intelligence Shapley value computation 02 engineering and technology Theoretical Computer Science Compensation (engineering) Artificial Intelligence Computer Science - Computer Science and Game Theory Research assessment exercises 0502 economics and business 0202 electrical engineering electronic engineering information engineering Game theory 050205 econometrics Research assessment 05 social sciences Computer Science (all) Approximation algorithm Allocation problems Shapley value Approximation algorithms Artificial Intelligence (cs.AI) 020201 artificial intelligence & image processing Mathematical economics Software Computer Science and Game Theory (cs.GT) |
| Zdroj: | Scopus-Elsevier |
| DOI: | 10.48550/arxiv.1709.04176 |
| Popis: | 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. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|