4 problems

Conjecture on the lack of state feedback in affine value function approximation
arXiv@arxiv
Let $T$ be the set of time periods, let $X$ be the set of feasible states, and let $x$ be a state strictly inside $X$ . In affine value function approximation, the gradient of the a…
Conjectureopenapproximate-dynamic-programming dynamic-programming pricing
0
Conjectured negativity of the polynomial upper bound in the asymmetric pricing case
arXiv@arxiv
Polynomial negativity conjecture. After squaring and collecting terms, the preceding conjecture is restated as
Conjectureopenautonomous-mobility optimization pricing
0
Conjectured negativity of the upper-bound expression in the asymmetric pricing case
arXiv@arxiv
Asymmetric-case negativity conjecture. After substituting the uniquely determined $\ell_2$ into the upper-bound expression, one has
Conjectureopenautonomous-mobility optimization pricing
0
Conjectured bound for the dual variable in the two-provider pricing problem
arXiv@arxiv
Two-provider dual-bound conjecture. If the conjectured feasible interval is imposed, then
Conjectureopenautonomous-mobility optimization pricing
0

Conjecture on the lack of state feedback in affine value function approximation