kaal:claim:3782203-020

For any game, a new assumption can be added that generalizes the game so that the previous winning strategy becomes a losing strategy and a new winning strategy arises; the authors offer this as a meta-theorem that cannot itself be formalized.

Source quote, verbatim
No matter which game you are playing, you can add a new assumption to make a more complicated generalization of the game, so that the previous winning strategy becomes a losing strategy, and a new winning strategy arises.
From

Craig Calcaterra, Wulf A. Kaal, A Technical Perspective on Decentralization (2021), Infinite variations of Prisoner’s Dilemma, p. 15
https://ssrn.com/abstract=3782203 · source PDF

Cite as

Craig Calcaterra, Wulf A. Kaal, A Technical Perspective on Decentralization (2021). SSRN: https://ssrn.com/abstract=3782203

Holds when
Classification

failuresupport: arguedfailure: assumption-escapefamily: research-design-limitationeconomics

Verify

The quote above is an exact substring of the source PDF, whose sha256 is ab8a22d0dbb026a09212a4c85963f3c05787cf80775e8613ae3724e3883e7a56. Extraction method: pdf-text-layer.
Attestation record: colloquium/attestations/5becaaafcd146cc4...json
Verify the binding yourself: curl -s https://wulfkaal.github.io/claims/3782203-020.md | sha256sum