Minimizing Regret in Dynamic Decision Problems

January 31, 2015 Β· Declared Dead Β· πŸ› European Conference on Symbolic and Quantitative Approaches to Reasoning and Uncertainty

πŸ‘» CAUSE OF DEATH: Ghosted
No code link whatsoever

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors Joseph Y. Halpern, Samantha Leung arXiv ID 1502.00152 Category cs.AI: Artificial Intelligence Citations 5 Venue European Conference on Symbolic and Quantitative Approaches to Reasoning and Uncertainty Last Checked 4 months ago
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.
Community shame:
Not yet rated
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

πŸ“œ Similar Papers

In the same crypt β€” Artificial Intelligence

Died the same way β€” πŸ‘» Ghosted