The DOI matches its Crossref record; 4 of the 4 references it cites were found in a registry or an index.
On the Complexity of Cooperative Solution Concepts
Abstract
We study from a complexity theoretic standpoint the various solution concepts arising in cooperative game theory. We use as a vehicle for this study a game in which the players are nodes of a graph with weights on the edges, and the value of a coalition is determined by the total weight of the edges contained in it. The Shapley value is always easy to compute. The core is easy to characterize when the game is convex, and is intractable (NP-complete) otherwise. Similar results are shown for the kernel, the nucleolus, the ε-core, and the bargaining set. As for the von Neumann-Morgenstern solution, we point out that its existence may not even be decidable. Many of these results generalize to the case in which the game is presented by a hypergraph with edges of size k > 2.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
(1979) · Cited by 43,841
Combinatorial Optimization: Algorithms and Complexity.
Johnson, D. S., Papadimitriou, C. H., & Steiglitz, K. (1984) · The American Mathematical Monthly · doi:10.2307/2322374 · Cited by 5,942
Self-citationShapley, L. S. (1971) · International Journal of Game Theory · doi:10.1007/bf01753431 · Cited by 1,613
Bounded complexity justifies cooperation in the finitely repeated prisoners' dilemma
Neyman, A. (1985) · Economics Letters · doi:10.1016/0165-1765(85)90026-6 · Cited by 344
Cited by
Multiagent systems: algorithmic, game-theoretic, and logical foundations
(2009) · Choice Reviews Online · doi:10.5860/choice.46-5662 · Cited by 1,756
Algorithms, games, and the internet
Papadimitriou, C. (2001) · Proceedings of the thirty-third annual ACM symposium on Theory of computing · doi:10.1145/380752.380883 · Cited by 1,085
Self-citationPolynomial calculation of the Shapley value based on sampling
Castro, J., Gómez, D., & Tejada, J. (2009) · Computers & Operations Research · doi:10.1016/j.cor.2008.04.004 · Cited by 601
Algorithms to estimate Shapley value feature attributions
Chen, H., Covert, I. C., Lundberg, S. M., & Lee, S.-I. (2023) · Nature Machine Intelligence · doi:10.1038/s42256-023-00657-x · Cited by 472
Computational Aspects of Cooperative Game Theory
Chalkiadakis, G., Elkind, E., & Wooldridge, M. (2012) · Synthesis Lectures on Artificial Intelligence and Machine Learning · doi:10.1007/978-3-031-01558-8 · Cited by 337
Metadata
- Authors
- Deng, X., & Papadimitriou, C. H.
- Venue
- Mathematics of Operations Research
- Published
- 1994-05
- Volume
- 19
- Issue
- 2
- Pages
- 257-266
- ISSN
- 0364-765X (ISSN-L)
- 1526-5471
- OpenAlex
- W2046116913
- Cited by
- 629
- References
- 4
- FWCI
- 10.00
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: On the Complexity of Cooperative Solution Concepts. https://app.cochat.ai/papers/10.1287/moor.19.2.257
- The paper
- Deng, X., & Papadimitriou, C. H. (1994). On the Complexity of Cooperative Solution Concepts. Mathematics of Operations Research. https://doi.org/10.1287/moor.19.2.257
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.