English
 
Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
  On the Correctness of Monadic Backward Induction

Brede, N., Botta, N. (in press): On the Correctness of Monadic Backward Induction. - Journal of Functional Programming.

Item is

Basic

show hide
Item Permalink: https://publications.pik-potsdam.de/pubman/item/item_25948 Version Permalink: https://publications.pik-potsdam.de/pubman/item/item_25948_1
Genre: Journal Article

Files

show Files
hide Files
:
Brede,Botta-CorrectnessMonadicBI_final_2021-09-01.pdf (Preprint), 405KB
 
File Permalink:
-
Name:
Brede,Botta-CorrectnessMonadicBI_final_2021-09-01.pdf
Description:
-
Visibility:
Private
MIME-Type / Checksum:
application/pdf
Technical Metadata:
Copyright Date:
-
Copyright Info:
-
License:
-
:
4554727#.YTC9FdPwBaQ (Any fulltext), 39KB
 
File Permalink:
-
Name:
4554727#.YTC9FdPwBaQ
Description:
-
Visibility:
Private
MIME-Type / Checksum:
text/html
Technical Metadata:
Copyright Date:
-
Copyright Info:
-
License:
-

Locators

show

Creators

show
hide
 Creators:
Brede, Nuria1, Author              
Botta, Nicola1, Author              
Affiliations:
1Potsdam Institute for Climate Impact Research, ou_persistent13              

Content

show
hide
Free keywords: -
 Abstract: In control theory, to solve a finite-horizon sequential decision problem (SDP) commonly means to find a list of decision rules that result in an optimal expected total reward (or cost) when taking a given number of decision steps. SDPs are routinely solved using Bellman’s backward induction. Textbook authors (e.g. Bertsekas or Puterman) typically give more or less formal proofs to show that the backward induction algorithm is correct as solution method for deterministic and stochastic SDPs. Botta, Jansson and Ionescu propose a generic framework for finite horizon, monadic SDPs together with a monadic version of backward induction for solving such SDPs. In monadic SDPs, the monad captures a generic notion of uncertainty, while a generic measure function aggregates rewards. In the present paper we define a notion of correctness for monadic SDPs and identify three conditions that allow us to prove a correctness result for monadic backward induction that is comparable to textbook correctness proofs for ordinary backward induction. The conditions that we impose are fairly general and can be cast in category-theoretical terms using the notion of Eilenberg-Moore-algebra. They hold in familiar settings like those of deterministic or stochastic SDPs but we also give examples in which they fail. Our results show that backward induction can safely be employed for a broader class of SDPs than usually treated in textbooks. However, they also rule out certain instances that were considered admissible in the context of Botta et al. ’s generic framework. Our development is formalised in Idris as an extension of the Botta et al. framework and the sources are available as supplementary material.

Details

show
hide
Language(s):
 Dates: 2021-08-01
 Publication Status: Accepted / In Press
 Pages: -
 Publishing info: -
 Table of Contents: -
 Rev. Type: Peer
 Identifiers: PIKDOMAIN: RD4 - Complexity Science
Organisational keyword: RD4 - Complexity Science
MDB-ID: yes - 3222
Model / method: Open Source Software
Model / method: Research Software Engineering (RSE)
Model / method: Decision Theory
 Degree: -

Event

show

Legal Case

show

Project information

show

Source 1

show
hide
Title: Journal of Functional Programming
Source Genre: Journal, SCI, Scopus
 Creator(s):
Affiliations:
Publ. Info: -
Pages: - Volume / Issue: - Sequence Number: - Start / End Page: - Identifier: Publisher: Cambridge University Press
CoNE: https://publications.pik-potsdam.de/cone/journals/resource/journal-functional-programming