The adversarial stochastic shortest path problem with unknown transition probabilities.
Gergely NeuAndrás GyörgyCsaba SzepesváriPublished in: AISTATS (2012)
Keyphrases
- shortest path problem
- transition probabilities
- markov chain
- shortest path
- random walk
- markov models
- single source
- directed graph
- interval data
- multiple objectives
- combinatorial optimization problems
- markov model
- link structure
- directed acyclic graph
- maximum entropy
- state space
- neural network
- reward function
- objective function