Non-Transferable Utility Coalitional Games via Mixed-Integer Linear Constraints
From MaRDI portal
Publication:3588641
DOI10.1613/jair.3060zbMath1203.91017arXiv1401.3852WikidataQ62044184 ScholiaQ62044184MaRDI QIDQ3588641
Gianluigi Greco, Francesco Scarcello, Enrico Malizia, Luigi Palopoli
Publication date: 9 September 2010
Published in: Journal of Artificial Intelligence Research (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1401.3852
91A12: Cooperative games
68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)
Related Items
On the complexity of core, kernel, and bargaining set, Answers set programs for non-transferable utility games: expressiveness, complexity and applications, Coalitional games induced by matching problems: complexity and islands of tractability for the Shapley value, Complexity results for preference aggregation over (\(m\))CP-nets: Pareto and majority voting, A novel characterization of the complexity class \(\Theta_k^{\mathrm{P}}\) based on counting and comparison, Complexity results for preference aggregation over \((m)\)CP-nets: max and rank voting, The Complexity of the Nucleolus in Compact Games