scholarly journals Approximate linear programming for networks: Average cost bounds

2015 ◽  
Vol 63 ◽  
pp. 32-45 ◽  
Author(s):  
Michael H. Veatch
2013 ◽  
Vol 46 (13) ◽  
pp. 478-483
Author(s):  
Yan Zhaoyang ◽  
Ma Xin ◽  
Gao Dong ◽  
Liu Pingping ◽  
Zhang Beike

1994 ◽  
Vol 31 (04) ◽  
pp. 979-990
Author(s):  
Jean B. Lasserre

We present two sufficient conditions for detection of optimal and non-optimal actions in (ergodic) average-cost MDPs. They are easily interpreted and can be implemented as detection tests in both policy iteration and linear programming methods. An efficient implementation of a recent new policy iteration scheme is discussed.


Sign in / Sign up

Export Citation Format

Share Document