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

All finite games have at least one Nash equilibrium.

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

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

Is it true that all finite games have at least one Nash equilibrium?

Yes. Multiple reference and peer-reviewed sources state Nash's theorem that every finite game has at least one Nash equilibrium (allowing mixed strategies). The claim matches this established result exactly.

Verdict: SUPPORTED · 6 sources for, 0 against · Last checked

The private library was unavailable for some searches in this check. Missing library results are not evidence against the claim.

Evidence for · 6
Nash equilibrium - Wikipedia
Get citation
Nash equilibrium - Wikipedia. (n.d.). en.wikipedia.org. https://en.wikipedia.org/wiki/Nash_equilibrium

See more details
More for · 5
Existence of Pure Strategy Nash Equilibria in Finite ...
Get citation
Existence of Pure Strategy Nash Equilibria in Finite.... (n.d.). arxiv.org. https://arxiv.org/pdf/2606.26564

Game Theory 101: The Complete Textbook
2011
Get citation
Spaniel, W. (2011). Game Theory 101: The Complete Textbook. archive.org. https://archive.org/details/gametheory101com0000will

Essays on game theory
1996
Get citation
1928-, N. J. F. (1996). Essays on game theory. archive.org. https://archive.org/details/essaysongametheo0000nash

Essays on the foundations of game theory
1990
Get citation
1940-, B. K. G. (1990). Essays on the foundations of game theory. archive.org. https://archive.org/details/essaysonfoundati0000binm

From Nash Equilibria to Chain Recurrent Sets: An Algorithmic Solution Concept for Game Theory
2018
Get citation
Papadimitriou, C. & Piliouras, G. (2018). From Nash Equilibria to Chain Recurrent Sets: An Algorithmic Solution Concept for Game Theory. doi.org. https://doi.org/10.3390/e20100782

Receipt History
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.

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