The following pages link to Enrico Malizia (Q650524):
Displayed 12 items.
- On the complexity of core, kernel, and bargaining set (Q650525) (← links)
- Inconsistency-tolerant query answering for existential rules (Q2124462) (← links)
- Complexity results for preference aggregation over (\(m\))CP-nets: Pareto and majority voting (Q2321294) (← links)
- A novel characterization of the complexity class \(\Theta_k^{\mathrm{P}}\) based on counting and comparison (Q2404077) (← links)
- Complexity results for preference aggregation over \((m)\)CP-nets: max and rank voting (Q2667819) (← links)
- The Complexity of the Nucleolus in Compact Games (Q2828226) (← links)
- (Q3457238) (← links)
- Non-Transferable Utility Coalitional Games via Mixed-Integer Linear Constraints (Q3588641) (← links)
- Bounds on the Cost of Stabilizing a Cooperative Game (Q4611396) (← links)
- Achieving new upper bounds for the hypergraph duality problem through logic (Q4635628) (← links)
- Achieving New Upper Bounds for the Hypergraph Duality Problem through Logic (Q4637759) (← links)
- (Q4999267) (← links)