- New
-
Topics
- All Categories
- Metaphysics and Epistemology
- Value Theory
- Science, Logic, and Mathematics
- Science, Logic, and Mathematics
- Logic and Philosophy of Logic
- Philosophy of Biology
- Philosophy of Cognitive Science
- Philosophy of Computing and Information
- Philosophy of Mathematics
- Philosophy of Physical Science
- Philosophy of Social Science
- Philosophy of Probability
- General Philosophy of Science
- Philosophy of Science, Misc
- History of Western Philosophy
- Philosophical Traditions
- Philosophy, Misc
- Other Academic Areas
- Journals
- Submit material
- More
Answers set programs for non-transferable utility games: Expressiveness, complexity and applications
Artificial Intelligence 302 (C):103606 (2022)
Abstract
This article has no associated abstract. (fix it)My notes
Similar books and articles
A comparison of non-transferable utility values.Sergiu Hart - 2004 - Theory and Decision 56 (1-2):35-46.
The complexity and generality of learning answer set programs.Mark Law, Alessandra Russo & Krysia Broda - 2018 - Artificial Intelligence 259:110-146.
Abstraction for non-ground answer set programs.Zeynep G. Saribatur, Thomas Eiter & Peter Schüller - 2021 - Artificial Intelligence 300 (C):103563.
Carteggio Croce-Amendola.Benedetto Croce, Giovanni Amendola & Roberto Pertici - 1982 - Istituto Italiano Per Gli Studi Storici.
Characterization of dominance relations in finite coalitional games.Felix Brandt & Paul Harrenstein - 2010 - Theory and Decision 69 (2):233-256.
On the computational complexity of coalitional resource games.Michael Wooldridge & Paul E. Dunne - 2006 - Artificial Intelligence 170 (10):835-871.
On the computational complexity of qualitative coalitional games.Michael Wooldridge & Paul E. Dunne - 2004 - Artificial Intelligence 158 (1):27-73.
Hedonic diversity games: A complexity picture with more than two colors.Robert Ganian, Thekla Hamm, Dušan Knop, Šimon Schierreich & Ondřej Suchý - 2023 - Artificial Intelligence 325 (C):104017.
The complexity of decision problems about equilibria in two-player Boolean games.Egor Ianovski & Luke Ong - 2018 - Artificial Intelligence 261 (C):1-15.
Coalitional games induced by matching problems: Complexity and islands of tractability for the Shapley value.Gianluigi Greco, Francesco Lupia & Francesco Scarcello - 2020 - Artificial Intelligence 278 (C):103180.
Analytics
Added to PP
2022-11-21
Downloads
12 (#1,114,703)
6 months
5 (#710,385)
2022-11-21
Downloads
12 (#1,114,703)
6 months
5 (#710,385)
Historical graph of downloads
References found in this work
Extending and implementing the stable model semantics.Patrik Simons, Ilkka Niemelä & Timo Soininen - 2002 - Artificial Intelligence 138 (1-2):181-234.
On the complexity of core, kernel, and bargaining set.Gianluigi Greco, Enrico Malizia, Luigi Palopoli & Francesco Scarcello - 2011 - Artificial Intelligence 175 (12-13):1877-1910.
Semi-equilibrium models for paracoherent answer set programs.Giovanni Amendola, Thomas Eiter, Michael Fink, Nicola Leone & João Moura - 2016 - Artificial Intelligence 234 (C):219-271.
Characteristic function games with restricted agent interactions: Core-stability and coalition structures.Georgios Chalkiadakis, Gianluigi Greco & Evangelos Markakis - 2016 - Artificial Intelligence 232 (C):76-113.
Complexity of constructing solutions in the core based on synergies among coalitions.Vincent Conitzer & Tuomas Sandholm - 2006 - Artificial Intelligence 170 (6-7):607-619.
PhilPapers logo by Andrea Andrews and Meghan Driscoll.
This site uses cookies and Google Analytics (see our terms & conditions for details regarding the privacy implications). Use of this site is subject to terms & conditions.
All rights reserved by The PhilPapers Foundation
Server: philpapers-web-68866f4b87-sz9d2 uwo