A PARAMETRIC, RESOURCE-BOUNDED GENERALIZATION OF LÖB’S THEOREM, AND A ROBUST COOPERATION CRITERION FOR OPEN-SOURCE GAME THEORY

DOI10.1017/jsl.2017.42zbMath1454.03026OpenAlexW2932862961WikidataQ115012293 ScholiaQ115012293MaRDI QIDQ5207557

Andrew Critch

Publication date: 10 January 2020

Published in: The Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/jsl.2017.42

zbMATH Keywords

bounded rationalityprisoner's dilemmaprogram equilibriumproof lengthLöbian cooperation

Mathematics Subject Classification ID

Noncooperative games (91A10) 2-person games (91A05) Modal logic (including the logic of norms) (03B45) Logic in computer science (03B70) Proof theory in general (including proof-theoretic semantics) (03F03) Decision theory for games (91A35)

Related Items (1)

Robust program equilibrium

Uses Software

• Metamath

Cites Work

• Program equilibrium
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A PARAMETRIC, RESOURCE-BOUNDED GENERALIZATION OF LÖB’S THEOREM, AND A ROBUST COOPERATION CRITERION FOR OPEN-SOURCE GAME THEORY