Minimizing regret in dynamic decision problems

From MaRDI portal
Publication:2629329

DOI10.1007/978-3-319-20807-7_1zbMATH Open1378.91065arXiv1502.00152OpenAlexW2914456641MaRDI QIDQ2629329FDOQ2629329


Authors: Joseph Y. Halpern, Samantha Leung Edit this on Wikidata


Publication date: 6 July 2016

Published in: Theory and Decision, Lecture Notes in Computer Science (Search for Journal in Brave)

Abstract: The menu-dependent nature of regret-minimization creates subtleties when it is applied to dynamic decision problems. Firstly, it is not clear whether emph{forgone opportunities} should be included in the emph{menu}, with respect to which regrets are computed, at different points of the decision problem. If forgone opportunities are included, however, we can characterize when a form of dynamic consistency is guaranteed. Secondly, more subtleties arise when sophistication is used to deal with dynamic inconsistency. In the full version of this paper, we examine, axiomatically and by common examples, the implications of different menu definitions for sophisticated, regret-minimizing agents.


Full work available at URL: https://arxiv.org/abs/1502.00152




Recommendations




Cites Work


Cited In (8)





This page was built for publication: Minimizing regret in dynamic decision problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2629329)