Deutsch
 
Datenschutzhinweis Impressum
  DetailsucheBrowse

Datensatz

 
 
DownloadE-Mail
  On the correctness of monadic backward induction

Brede, N., Botta, N. (2021): On the correctness of monadic backward induction. - Journal of Functional Programming, 31, e26.
https://doi.org/10.1017/S0956796821000228

Item is

Dateien

einblenden: Dateien
ausblenden: Dateien
:
25948oa.pdf (Verlagsversion), 770KB
Name:
25948oa.pdf
Beschreibung:
-
Sichtbarkeit:
Öffentlich
MIME-Typ / Prüfsumme:
application/pdf / [MD5]
Technische Metadaten:
Copyright Datum:
-
Copyright Info:
-

Externe Referenzen

einblenden:

Urheber

einblenden:
ausblenden:
 Urheber:
Brede, Nuria1, Autor              
Botta, Nicola1, Autor              
Affiliations:
1Potsdam Institute for Climate Impact Research, ou_persistent13              

Inhalt

einblenden:
ausblenden:
Schlagwörter: -
 Zusammenfassung: 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

einblenden:
ausblenden:
Sprache(n): eng - Englisch
 Datum: 2021-08-012021-10-292021
 Publikationsstatus: Final veröffentlicht
 Seiten: 39
 Ort, Verlag, Ausgabe: -
 Inhaltsverzeichnis: -
 Art der Begutachtung: Expertenbegutachtung
 Identifikatoren: 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
DOI: 10.1017/S0956796821000228
OATYPE: Hybrid - Cambridge University Press
 Art des Abschluß: -

Veranstaltung

einblenden:

Entscheidung

einblenden:

Projektinformation

einblenden:

Quelle 1

einblenden:
ausblenden:
Titel: Journal of Functional Programming
Genre der Quelle: Zeitschrift, SCI, Scopus
 Urheber:
Affiliations:
Ort, Verlag, Ausgabe: -
Seiten: - Band / Heft: 31 Artikelnummer: e26 Start- / Endseite: - Identifikator: Publisher: Cambridge University Press
CoNE: https://publications.pik-potsdam.de/cone/journals/resource/journal-functional-programming