"Polynomial Time Algorithms for Branching Markov Decision Processes and ..."

Kousha Etessami, Alistair Stewart, Mihalis Yannakakis (2020)

> Home

Details and statistics

DOI: 10.1287/MOOR.2018.0970

access: closed

type: Journal Article

metadata version: 2024-08-04

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/mor/EtessamiSY20
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/mor/EtessamiSY20
Kousha Etessami, Alistair Stewart, Mihalis Yannakakis:
Polynomial Time Algorithms for Branching Markov Decision Processes and Probabilistic Min(Max) Polynomial Bellman Equations. Math. Oper. Res. 45(1): 34-62 (2020)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.