Pages that link to "Item:Q3363092"

The following pages link to Multichain Markov Decision Processes with a Sample Path Constraint: A Decomposition Approach (Q3363092):

Displaying 20 items.

• On Bellman's principle with inequality constraints (Q435749) (← links)
• Stationary anonymous sequential games with undiscounted rewards (Q493048) (← links)
• Constrained Markov decision processes in Borel spaces: from discounted to average optimality (Q510431) (← links)
• Stochastic games on a product state space: the periodic case (Q532671) (← links)
• Exact decomposition approaches for Markov decision processes: a survey (Q606196) (← links)
• Markov control processes with pathwise constraints (Q992046) (← links)
• Resource-constrained management of heterogeneous assets with stochastic deterioration (Q1042122) (← links)
• A decomposition algorithm for limiting average Markov decision problems. (Q1412714) (← links)
• Acceptable strategy profiles in stochastic games (Q1651302) (← links)
• Communicating zero-sum product stochastic games (Q2314820) (← links)
• A note on two-person zero-sum communicating stochastic games (Q2466590) (← links)
• On constrained Markov decision processes (Q2564237) (← links)
• Two-person zero-sum stochastic games (Q2638976) (← links)
• On some algorithms for limiting average Markov decision processes (Q2643806) (← links)
• STRONG AVERAGE OPTIMALITY FOR CONTROLLED NONHOMOGENEOUS MARKOV CHAINS^* (Q2710472) (← links)
• Variance-minimization of Markov control processes with pathwise constraints (Q3145054) (← links)
• Constrained Semi-Markov decision processes with average rewards (Q4300602) (← links)
• The LP approach in average reward MDPs with multiple cost constraints: The countable state case (Q4354089) (← links)
• Average Reward Markov Decision Processes with Multiple Cost Constraints (Q4718597) (← links)
• The Linear Program approach in multi-chain Markov Decision Processes revisited (Q4861875) (← links)