Search Results
| Search type | Search syntax |
|---|---|
| Tags | [tag] |
| Exact | "words here" |
| Author |
user:1234 user:me (yours) |
| Score |
score:3 (3+) score:0 (none) |
| Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
| Views | views:250 |
| Code | code:"if (foo != bar)" |
| Sections |
title:apples body:"apples oranges" |
| URL | url:"*.example.com" |
| Saves | in:saves |
| Status |
closed:yes duplicate:no migrated:no wiki:no |
| Types |
is:question is:answer |
| Exclude |
-[tag] -apples |
| For more details on advanced search visit our help page | |
Results tagged with oc.optimization-and-control
Search options not deleted
user 11768
Operations research, linear programming, control theory, systems theory, optimal control, game theory
4
votes
0
answers
115
views
Sufficiency of stationary policy for negative stochastic dynamic programming
Consider a Markov Decision Process with Borel state space $X$ and Borel action space $U$, like the one defined in the book "Stochastic Optimal Control: Discrete-time case" by Bertsekas and Shreve. All …
- 1,655
1
vote
Maximal probability of "infinitely often" over MDP
Just for the sake of the question having an answer, the following paper by A. Maitra and W. Sudderth gives a very nice characterization of the value function for the i.o. event in the framework of gam …
- 1,655
2
votes
1
answer
117
views
Maximal probability of "infinitely often" over MDP
Let us consider a Markov Decision Process (MDP) with a Borel state space $X$. Often, the optimization problems over MDP involve optimization of some objectives dependent on the reward function
$$
r: …
- 1,655
2
votes
Accepted
Upper bound concerning Snell envelope
I think it is just a sequence of much stronger inequalities that goes as follows. All the inequalities below are $\Bbb P$-a.s.
Let $\tau\in \mathcal T_{t,T}$ be an arbitrary stopping time, then
$$
…
- 1,655