Pages that link to "Item:Q3588641"
From MaRDI portal
The following pages link to Non-Transferable Utility Coalitional Games via Mixed-Integer Linear Constraints (Q3588641):
Displaying 7 items.
- On the complexity of core, kernel, and bargaining set (Q650525) (← links)
- Answers set programs for non-transferable utility games: expressiveness, complexity and applications (Q2060739) (← links)
- Coalitional games induced by matching problems: complexity and islands of tractability for the Shapley value (Q2289024) (← 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)