On the public citation graph
Sequential Equilibrium in Computational Games
0 signed · 24 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1006/game.1997.0535openalex-snapshot
Dynamic Consistency and Imperfect Recall
inferredcites →https://doi.org/10.1006/game.1997.0536openalex-snapshot
On the Interpretation of Decision Problems with Imperfect Recall
inferredcites →https://doi.org/10.1006/game.1997.0557openalex-snapshot
On Ambiguities in the Interpretation of Game Trees
inferredcites →https://doi.org/10.1006/game.1997.0558openalex-snapshot
On the Expected Value of Games with Absentmindedness
inferredcites →https://doi.org/10.1016/0022-0531(86)90021-9openalex-snapshot
Finite automata play the repeated prisoner's dilemma
inferredcites →https://doi.org/10.1016/0165-4896(94)90005-1openalex-snapshot
Reasoning about knowledge
inferredcites →https://doi.org/10.1016/j.geb.2018.09.007openalex-snapshot
On equilibria in games with imperfect recall
inferredcites →https://doi.org/10.1016/j.jet.2014.04.007openalex-snapshot
Algorithmic rationality: Game theory with costly computation
inferredcites →https://doi.org/10.1016/s0004-3702(00)00082-5openalex-snapshot
Principles and applications of continual computation
inferredcites →https://doi.org/10.1111/j.2517-6161.1952.tb00104.xopenalex-snapshot
Rational Decisions
inferredcites →https://doi.org/10.48550/arxiv.1412.2993openalex-snapshot
Algorithmic Rationality: Game Theory with Costly Computation
inferredcites →https://doi.org/10.7551/mitpress/5803.001.0001openalex-snapshot
Reasoning About Knowledge
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/int.22450openalex-snapshot
Exploring the effects of computational costs in extensive games via modeling and simulation
inferred← citeshttps://doi.org/10.1007/978-3-030-30473-7_10openalex-snapshot
On the Existence of Nash Equilibrium in Games with Resource-Bounded Players
inferred← citeshttps://doi.org/10.1007/978-3-030-59013-0_35openalex-snapshot
Generic Superlight Client for Permissionless Blockchains
inferred← citeshttps://doi.org/10.1007/978-3-319-13129-0_20openalex-snapshot
Not Just an Empty Threat: Subgame-Perfect Equilibrium in Repeated Games Played by Computationally Bounded Players
inferred← citeshttps://doi.org/10.1016/j.geb.2019.04.008openalex-snapshot
The truth behind the myth of the Folk theorem
inferred← citeshttps://doi.org/10.1145/2940716.2940736openalex-snapshot
Imperfect-Recall Abstractions with Bounds in Games
inferred← citeshttps://doi.org/10.1145/3485002openalex-snapshot
Sequential Equilibrium in Games of Imperfect Recall
inferred← citeshttps://doi.org/10.21428/58320208.8e7f4fabopenalex-snapshot
SoK: Tools for Game Theoretic Models of Security for Cryptocurrencies
inferred← citeshttps://doi.org/10.48550/arxiv.1312.1017openalex-snapshot
The Truth Behind the Myth of the Folk Theorem
inferred← citeshttps://doi.org/10.5644/sjm.20.01.04openalex-snapshot
Testing Randomness by Matching Pennies
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.