activity
20082021
most citedOn the Complexity of Core, Kernel, and Bargaining Set

46 citations · 96 across the 4 of their papers we have counts for

collaborators

5 papers

cs.DB2021

Materializing Knowledge Bases via Trigger Graphs

Efthymia Tsamoura, David Carral, Enrico Malizia +1

The chase is a well-established family of algorithms used to materialize Knowledge Bases (KBs), like Knowledge Graphs (KGs), to tackle important tasks like query answering under de…

cs.AI2018★ 15 cited

Complexity Results for Preference Aggregation over (m)CP-nets: Pareto and Majority Voting

Thomas Lukasiewicz, Enrico Malizia

Combinatorial preference aggregation has many applications in AI. Given the exponential nature of these preferences, compact representations are needed and ()CP-nets are among t…

cs.CC2014★ 21 cited

Achieving New Upper Bounds for the Hypergraph Duality Problem through Logic

Georg Gottlob, Enrico Malizia

The hypergraph duality problem DUAL is defined as follows: given two simple hypergraphs and , decide whether consists precisely of all mini…

cs.GT2014★ 14 cited

Non-Transferable Utility Coalitional Games via Mixed-Integer Linear Constraints

Gianluigi Greco, Enrico Malizia, Luigi Palopoli +1

Coalitional games serve the purpose of modeling payoff distribution problems in scenarios where agents can collaborate by forming coalitions in order to obtain higher worths than b…

cs.GT2008★ 46 cited

On the Complexity of Core, Kernel, and Bargaining Set

Gianluigi Greco, Enrico Malizia, Luigi Palopoli +1

Coalitional games are mathematical models suited to analyze scenarios where players can collaborate by forming coalitions in order to obtain higher worths than by acting in isolati…