An Analysis of Stochastic Shortest Path Problems
From MaRDI portal
Recommendations
Cited in
(only showing first 100 items - show all)- Reachability games and friends: a journey through the Lens of memory and complexity (invited talk)
- Reaching Your Goal Optimally by Playing at Random with No Memory
- Stability estimation of transient Markov decision processes
- Multiply accelerated value iteration for nonsymmetric affine fixed point problems and application to Markov decision processes
- Réseaux stochastiques
- Markov reward models and Markov decision processes in discrete and continuous time: performance evaluation and optimization
- Maximum-stopping-value policies in finite Markov population decision chains
- A mean-risk model for the traffic assignment problem with stochastic travel times
- On probability-raising causality in Markov decision processes
- Road traffic estimation and distribution-based route selection
- Probabilistic causes in Markov chains
- Should sports professionals consider their Adversary's strategy? A case study of match play in golf
- A semantics for every GSPN
- Stochastic shortest path with unlimited hops
- SPAR: Stochastic Programming with Adversarial Recourse
- Foundations of probability-raising causality in Markov decision processes
- Teaching randomized learners with feedback
- Stochastic shortest path problems with associative accumulative criteria
- Robust shortest path planning and semicontractive dynamic programming
- An anytime algorithm for constrained stochastic shortest path problems with deterministic policies
- Policy iteration type algorithms for recurrent state Markov decision processes
- Regular policies in abstract dynamic programming
- Minimax weight learning for absorbing MDPs
- On the fastest finite Markov processes
- Exact algorithms for the stochastic shortest path problem with a decreasing deadline utility function
- Percentile queries in multi-dimensional Markov decision processes
- Variations on the stochastic shortest path problem
- Stochastic shortest path problem with delay excess penalty
- UTILIZING DISTRIBUTED LEARNING AUTOMATA TO SOLVE STOCHASTIC SHORTEST PATH PROBLEMS
- On the complexity of time-dependent shortest paths
- Anonymous Stochastic Routing
- A Tutorial on Interactive Markov Chains
- Playing stochastically in weighted timed games to emulate memory
- A game-based abstraction-refinement framework for Markov decision processes
- Robust adaptive routing under uncertainty
- Change acceleration and detection
- Sample complexity bounds for stochastic shortest path with a generative model
- On the convergence of reinforcement learning with Monte Carlo exploring starts
- PageRank optimization by edge selection
- Robust path choice in networks with failures
- Model Checking Exact Cost for Attack Scenarios
- Performance analysis of probabilistic timed automata using digital clocks
- Iterative algorithms for solving one-sided partially observable stochastic shortest path games
- An approach to the distributionally robust shortest path problem
- Finding the shortest path in stochastic graphs using learning automata and adaptive stochastic Petri nets
- The stochastic shortest path problem: a polyhedral combinatorics perspective
- Depth-based short-sighted stochastic shortest path problems
- An application of Lemke's method to a class of Markov decision problems
- Efficient constraint generation for stochastic shortest path problems
- Competence-aware systems
- A Heuristic Search Approach for a Nonstationary Stochastic Shortest Path Problem with Terminal Cost
- Preference-based probabilistic planning with partially-ordered temporal goals
- On an exact method for the constrained shortest path problem
- On convergence of value iteration for a class of total cost Markov decision processes
- Demonic variance and a non-determinism score for Markov decision processes
- On the Speed of Convergence of Value Iteration on Stochastic Shortest-Path Problems
- On Skolem-hardness and saturation points in Markov decision processes
- Symbolic minimum expected time controller synthesis for probabilistic timed automata
- Optimization of a peer-to-peer system for efficient content replication
- Dynamic shortest path problems: hybrid routing policies considering network disruptions
- PH-graphs for analyzing shortest path problems with correlated traveling times
- Optimal search from multiple distributions with infinite horizon
- A directed hypergraph model for random time dependent shortest paths
- Computing transience bounds of emergency call centers: a hierarchical timed Petri net approach
- Risk-averse optimization of total rewards in Markovian models using deviation measures
- Perseverance and suspense in tug-of-war
- Nearly optimal verifiable data streaming
- Risk-sensitive multiagent decision-theoretic planning based on MDP and one-switch utility functions
- Computation tree measurement language (CTML)
- An integer linear programming formulation and heuristics for the minmax relative regret robust shortest path problem
- The stochastic shortest-path problem for Markov chains with infinite state space with applications to nearest-neighbor lattice chains
- Concurrent reachability games
- Entropic risk for turn-based stochastic games
- A simple ant colony optimizer for stochastic shortest path problems
- Using mathematical programming to solve factored Markov decision processes with imprecise probabilities
- Technical Note—A Note on the Stochastic Shortest Route Problem
- scientific article; zbMATH DE number 3869088 (Why is no real title available?)
- A note on detecting unbounded instances of the online shortest path problem
- Optimal stopping with a probabilistic constraint
- Real-time dynamic programming for Markov decision processes with imprecise probabilities
- Computational methods for risk-averse undiscounted transient Markov models
- Error bounds for stochastic shortest path problems
- Symblicit algorithms for mean-payoff and shortest path in monotonic Markov decision processes
- On terminating Markov decision processes with a risk-averse objective function
- Dynamic shortest path in stochastic dynamic networks: Ship routing problem
- Wasserstein distributionally robust shortest path problem
- Q-learning and policy iteration algorithms for stochastic shortest path problems
- Minimizing risk models in stochastic shortest path problems
- Relax-and-split method for nonconvex inverse problems
- Label-setting methods for multimode stochastic shortest path problems on graphs
- Optimal threshold probability in undiscounted Markov decision processes with a target set.
- A practitioner's guide to MDP model checking algorithms
- Symbolic optimal expected time reachability computation and controller synthesis for probabilistic timed automata
- Markov decision processes and stochastic games with total effective payoff
- Optimal decisions in stochastic graphs with uncorrelated and correlated edge weights
- Maximizing the conditional expected reward for reaching the goal
- Efficient solutions to factored MDPs with imprecise transition probabilities
- Proximal algorithms and temporal difference methods for solving fixed point problems
- An analysis of transient Markov decision processes
- Meet your expectations with guarantees: beyond worst-case synthesis in quantitative games
This page was built for publication: An Analysis of Stochastic Shortest Path Problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3986758)
