Sequential decision problems, dependent types and generic solutions

DOI10.23638/LMCS-13(1:7)2017zbMATH Open1398.68489arXiv1610.07145MaRDI QIDQ2980971FDOQ2980971

Patrik Jansson, David R. Christiansen, N. Botta, Edwin Brady, C. Ionescu

Publication date: 8 May 2017

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

Recommendations

• On the correctness of monadic backward induction
• On dynamic programming for sequential decision problems under a general form of uncertainty
• A Dynamic Programming Type Algorithm for Finite Decision Problems in Banach Spaces
• Sequential decision processes under act-state independence with arbitrary choice functions
• scientific article; zbMATH DE number 1336305

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Approximation methods and heuristics in mathematical programming (90C59)

Cites Work

• Introduction to algorithms
• Title not available (Why is that?)
• Title not available (Why is that?)
• Algebra of programming in Agda: Dependent types for relational program derivation

Cited In (2)

• Contributions to a computational theory of policy advice and avoidability
• On the correctness of monadic backward induction

Uses Software

• Agda
• AoPA
• Idris

This page was built for publication: Sequential decision problems, dependent types and generic solutions

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