Efficient Computation of Behavior Strategies
The DOI matches its Crossref record; 15 of the 15 references it cites were found in a registry or an index.
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
Cites
Linear Programming and Extensions
Dantzig, G. (1963) · RAND Corporation eBooks · doi:10.7249/r366 · Cited by 5,755
Nash, J. (1989) · Cournot Oligopoly · doi:10.1017/cbo9780511528231.007 · Cited by 5,595
Reexamination of the perfectness concept for equilibrium points in extensive games
Selten, R. (1975) · International Journal of Game Theory · doi:10.1007/bf01766400 · Cited by 3,337
The Linear Complementarity Problem
Cottle, R. W., Pang, J.-S., & Stone, R. E. (2009) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9780898719000 · Cited by 2,788
On the Strategic Stability of Equilibria
Kohlberg, E., & Mertens, J.-F. (1986) · Econometrica · doi:10.2307/1912320 · Cited by 1,397
Equilibrium Points of Bimatrix Games
Lemke, C. E., & Howson, Jr. (1964) · Journal of the Society for Industrial and Applied Mathematics · doi:10.1137/0112033 · Cited by 1,231 · cited 1×
“For bimatrix games, the algorithm by Lemke and Howson (1964) finds at least one form is not suitable for a direct application of the Lemke–Howson algorithm.”
MethodBimatrix Equilibrium Points and Mathematical Programming
Lemke, C. E. (1965) · Management Science · doi:10.1287/mnsc.11.7.681 · Cited by 1,029
11. Extensive Games and the Problem of Information
Kuhn, H. W. (1953) · Contributions to the Theory of Games (AM-28), Volume II · doi:10.1515/9781400881970-012 · Cited by 913 · cited 2×
“The concept of perfect recall has been introduced by Kuhn (1953).”
BackgroundThe Theory of Linear Economic Models
Mukerji, V., & Gale, D. (1962) · Econometrica · doi:10.2307/1910243 · Cited by 901
Stability and Perfection of Nash Equilibria
Osborne, M. J., & Damme, E. V. (1989) · The Canadian Journal of Economics · doi:10.2307/135684 · Cited by 726
Cited by
Multiagent systems: algorithmic, game-theoretic, and logical foundations
(2009) · Choice Reviews Online · doi:10.5860/choice.46-5662 · Cited by 1,756
Multi-Agent Reinforcement Learning: A Selective Overview of Theories and Algorithms
Zhang, K., Yang, Z., & Başar, T. (2021) · Studies in Systems, Decision and Control · doi:10.1007/978-3-030-60990-0_12 · Cited by 1,264
Efficient Computation of Equilibria for Extensive Two-Person Games
Koller, D., Megiddo, N., & von Stengel, B. (1996) · Games and Economic Behavior · doi:10.1006/game.1996.0051 · Cited by 228
Self-citationComplexity Results about Nash Equilibria
Conitzer, V., & Sandholm, T. (2002) · arXiv (Cornell University) · doi:10.48550/arxiv.cs/0205074 · Cited by 223
“There is also a significant body of research on solving extensive-form games [18, 19, 25, 26, 34, 43, 51, 52].”
New complexity results about Nash equilibria
Conitzer, V., & Sandholm, T. (2008) · Games and Economic Behavior · doi:10.1016/j.geb.2008.02.015 · Cited by 210
Metadata
- Authors
- von Stengel, B.
- Venue
- Games and Economic Behavior
- Publisher
- Elsevier BV
- Published
- 1996-06
- Volume
- 14
- Issue
- 2
- Pages
- 220-246
- ISSN
- 0899-8256 (ISSN-L)
- OpenAlex
- W2136427775
- Cited by
- 199
- References
- 15
- FWCI
- 4.52
- 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.