General time consistent discounting
From MaRDI portal
Publication:391749
DOI10.1016/j.tcs.2013.09.022zbMath1358.68296arXiv1107.5528OpenAlexW2144863733WikidataQ58012220 ScholiaQ58012220MaRDI QIDQ391749
Publication date: 13 January 2014
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1107.5528
Related Items
Extreme state aggregation beyond Markov decision processes, Reward tampering problems and solutions in reinforcement learning: a causal influence diagram perspective, On the computability of Solomonoff induction and AIXI
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Subgame-perfect equilibria of finite- and infinite-horizon games
- Asymptotically efficient adaptive allocation rules
- Universal artificial intelligence. Sequential decisions based on algorithmic probability.
- Self-Optimizing and Pareto-Optimal Policies in General Environments based on Bayes-Mixtures
- General Discounting Versus Average Reward
- Consistent Plans
- Stationary Ordinal Utility and Impatience
- On the Existence of a Consistent Course of Action when Tastes are Changing