A robust resolution of Newcomb's paradox
From MaRDI portal
Publication:333469
DOI10.1007/S11238-016-9543-2zbMath1378.91034OpenAlexW3122543774WikidataQ59460951 ScholiaQ59460951MaRDI QIDQ333469
Publication date: 31 October 2016
Published in: Theory and Decision (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11238-016-9543-2
Decision theory (91B06) Dynamic games (91A25) Rationality and learning in game theory (91A26) Decision theory for games (91A35)
Cites Work
- Unnamed Item
- Unnamed Item
- Niels Bohr and complementarity. An introduction.
- A continuum of commitment
- Newcomb's many solutions
- Foundations of dynamic monopoly and the Coase conjecture
- Agreeing to disagree
- A New Take from Nozick on Newcomb's Problem and Prisoners' Dilemma
- The Folk Theorem in Repeated Games with Discounting or with Incomplete Information
This page was built for publication: A robust resolution of Newcomb's paradox