2 papers
cs.GT2017
Computing the Shapley Value in Allocation Problems: Approximations and Bounds, with an Application to the Italian VQR Research Assessment Program
Francesco Lupia, Angelo Mendicelli, Andrea Ribichini +2
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…
cs.DB2016
Greedy Strategies and Larger Islands of Tractability for Conjunctive Queries and Constraint Satisfaction Problems
Gianluigi Greco, Francesco Scarcello
Structural decomposition methods have been developed for identifying tractable classes of instances of fundamental problems in databases, such as conjunctive queries and query cont…