The DOI matches its Crossref record.
Contributions to the Theory of Games
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
Cited by
A decision-theoretic generalization of on-line learning and an application to boosting
Freund, Y., & Schapire, R. E. (1997) · Journal of Computer and System Sciences · doi:10.1006/jcss.1997.1504 · Cited by 20,466
Methods for task allocation via agent coalition formation
Shehory, O., & Kraus, S. (1998) · Artificial Intelligence · doi:10.1016/s0004-3702(98)00045-9 · Cited by 1,080
k-order additive discrete fuzzy measures and their representation
Grabisch, M. (1997) · Fuzzy Sets and Systems · doi:10.1016/s0165-0114(97)00168-1 · Cited by 992
Estimating Dynamic Models of Imperfect Competition
Bajari, P., Benkard, C. L., & Levin, J. (2007) · Econometrica · doi:10.1111/j.1468-0262.2007.00796.x · Cited by 836
The generalized simplex method for minimizing a linear form under linear inequality restraints
Dantzig, G., Orden, A., & Wolfe, P. (1955) · Pacific Journal of Mathematics · doi:10.2140/pjm.1955.5.183 · Cited by 585
Explainability in Graph Neural Networks: A Taxonomic Survey
Yuan, H., Yu, H., Gui, S., & Ji, S. (2022) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2022.3204236 · Cited by 583
Separation of estimation and control for discrete time systems
Witsenhausen, H. S. (1971) · Proceedings of the IEEE · doi:10.1109/proc.1971.8488 · Cited by 519
Adaptive Game Playing Using Multiplicative Weights
Freund, Y., & Schapire, R. E. (1999) · Games and Economic Behavior · doi:10.1006/game.1999.0738 · Cited by 515
A Fully Automated Framework for Control of Linear Systems from Temporal Logic Specifications
Kloetzer, M., & Belta, C. (2008) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2007.914952 · Cited by 514
Rodríguez-Pérez, R., & Bajorath, J. (2020) · Journal of Medicinal Chemistry · doi:10.1021/acs.jmedchem.9b01101 · Cited by 512
Explainable Machine Learning in Credit Risk Management
Bussmann, N., Giudici, P., Marinelli, D., & Papenbrock, J. (2021) · Computational Economics · doi:10.1007/s10614-020-10042-0 · Cited by 503
Sharing the Cost of Multicast Transmissions
Feigenbaum, J., Papadimitriou, C. H., & Shenker, S. (2001) · Journal of Computer and System Sciences · doi:10.1006/jcss.2001.1754 · Cited by 404
Universal prediction of individual sequences
Feder, M., Merhav, N., & Gutman, M. (1992) · IEEE Transactions on Information Theory · doi:10.1109/18.144706 · Cited by 373
Information Technology, Incentives, and the Optimal Number of Suppliers
Bakos, J. Y., & Brynjolfsson, E. (1993) · Journal of Management Information Systems · doi:10.1080/07421222.1993.11517999 · Cited by 368
A Simplified Bargaining Model for the n-Person Cooperative Game
Harsanyi, J. C. (1982) · Papers in Game Theory · doi:10.1007/978-94-017-2527-9_3 · Cited by 315
Yang, H., Huang, K., Zhang, K., Weng, Q., Zhang, H., & Wang, F. (2021) · Environmental Science & Technology · doi:10.1021/acs.est.1c02479 · Cited by 289
Interpretable and explainable AI (XAI) model for spatial drought prediction
Dikshit, A., & Pradhan, B. (2021) · Science of The Total Environment · doi:10.1016/j.scitotenv.2021.149797 · Cited by 272
Interpretable machine learning for imbalanced credit scoring datasets
Chen, Y., Calabrese, R., & Martin-Barragan, B. (2024) · European Journal of Operational Research · doi:10.1016/j.ejor.2023.06.036 · Cited by 190
Guleria, P., & Sood, M. (2023) · Education and Information Technologies · doi:10.1007/s10639-022-11221-2 · Cited by 178
Competitive analysis of randomized paging algorithms
Achlioptas, D., Chrobak, M., & Noga, J. (2000) · Theoretical Computer Science · doi:10.1016/s0304-3975(98)00116-9 · Cited by 127
Metadata
- Authors
- Rubin, H., Kuhn, H. W., & Tucker, A. W.
- Venue
- Econometrica
- Publisher
- JSTOR
- Published
- 1952-01
- Volume
- 20
- Issue
- 1
- Pages
- 112
- ISSN
- 0012-9682 (ISSN-L)
- OpenAlex
- W4300576158
- Cited by
- 1,198
- References
- 0
- FWCI
- 3.88
- 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
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.