trustme.bro/r/…
✓ checked
trust me, bro:
here is the receipt.
the claim

A sequence of games has a well-defined Nash equilibrium

the verdict
SUPPORTED
the evidence backs this
Recorded sources
3 sources for · 0 against

Counts group repeated records of the same source within each side. They do not measure evidence strength or source independence.

AS REPORTEDno primary record reached; this is what the reporting says

Evidence indicates that sequential games (or a sequence of games/moves) can have well-defined Nash equilibria, provided certain conditions like preference acyclicity are met.

How claims like this are judged

Judged against reference works: claims of this kind are settled by reference works, not journal abstracts.

Evidence for · 3
Recorded source metadata

ar5iv.labs.arxiv.org: [1302.3973] Infinite sequential Nash equilibrium. ar5iv.labs.arxiv.org. https://ar5iv.labs.arxiv.org/html/1302.3973

Item states that sequential games have a Nash equilibrium under certain acyclicity conditions or specific quasi-Borel constraints.

See more details
More for · 2
Recorded source metadata

link.springer.com: A complete folk theorem for finitely repeated games | International Journal of Game Theory | Springer Nature Link. link.springer.com. https://link.springer.com/article/10.1007/s00182-020-00735-z

Discusses finitely repeated games and pure strategy subgame perfect Nash equilibria.

Recorded source metadata

ar5iv.labs.arxiv.org: [0705.3316] Acyclicity of Preferences, Nash Equilibria, and Subgame Perfect Equilibria: a Formal and Constructive Equivalence. ar5iv.labs.arxiv.org. https://ar5iv.labs.arxiv.org/html/0705.3316

States that every sequential game has a Nash equilibrium.

The paper trail · every fact has a biography
first checked01 Aug 2026
judged → SUPPORTED · 7501 Aug 2026
Anyone with this link can read the claim and its public receipt, including any personal information in that text. Open permanent receipt.
Check your own claim
Challenge the receipt
Requests are recorded for review. This does not start an automatic check or guarantee a response time.
trust me, bro: win the argument, pass the class, survive peer review.

Citation formatting by citeproc-js (Frank Bennett) and the Citation Style Language project. Source and licenses.

This receipt is an automated verdict against our published method · not an opinion about any author or publication.
Terms · Privacy · How verdicts work · Dispute this receipt