Francesco Lupia

Learn More
Process discovery has emerged as a powerful approach to support the analysis and the design of complex processes. It consists of analyzing a set of traces registering the sequence of tasks performed along several enactments of a transactional system, in order to build a process model that can explain all the episodes recorded over them. An approach to(More)
Allocation games are coalitional games defined in the literature as a way to analyze fair division problems of indivisible goods. The prototypical solution concepts for them are the Shapley value and the Banzhaf value. Unfortunately, their computation is intractable, formally #P-hard. Motivated by this bad news, structural requirements are investigated(More)
Structural decomposition methods have been developed for identifying tractable classes of instances of fundamental problems in databases, such as conjunctive queries and query containment, of the constraint satisfaction problem in artificial intelligence, or more generally of the homomorphism problem over relational structures. These methods work on the(More)
Main research activities and results of the project “TETRis – TETRA Innovative Open Source Services” are described that are aimed at enabling innovative services for Smart City/Smart Territory by means of technological tools and intelligent platforms for collecting, representing, managing and exploiting data and information(More)
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.(More)
Matching games form a class of coalitional games that attracted much attention in the literature. Indeed, several results are known about the complexity of computing over them solution concepts. In particular, it is known that computing the Shapley value is intractable in general, formally #P-hard, and feasible in polynomial time over games defined on(More)
  • 1