Randomized Shortest-Path Problems: Two Related Models

  title={Randomized Shortest-Path Problems: Two Related Models},
  author={Marco Saerens and Youssef Achbany and François Fouss and Luh Yen},
  journal={Neural Computation},
This letter addresses the problem of designing the transition probabilities of a finite Markov chain (the policy) in order to minimize the expected cost for reaching a destination node from a source node while maintaining a fixed level of entropy spread throughout the network (the exploration). It is motivated by the following scenario. Suppose you have to route agents through a network in some optimal way, for instance, by minimizing the total travel costnothing particular up to nowyou could… CONTINUE READING
36 Extracted Citations
59 Extracted References
Similar Papers

Citing Papers

Publications influenced by this paper.
Showing 1-10 of 36 extracted citations

Referenced Papers

Publications referenced by this paper.
Showing 1-10 of 59 references

Cyclic flows, Markov process and stochastic traffic assignment

  • T. Akamatsu
  • Transportation Research B, 30(5), 369–386.
  • 1996
Highly Influential
6 Excerpts

A modern course in statistical physics (2nd ed.)

  • L. Reichl
  • 1998
Highly Influential
4 Excerpts

Markov chains

  • J. Norris
  • Cambridge: Cambridge University Press.
  • 1997
Highly Influential
5 Excerpts

Entropy optimization principles with applications

  • J. N. Kapur, H. K. Kesavan
  • 1992
Highly Influential
4 Excerpts

Finite Markov chains (rev

  • J. G. Kemeny, J. L. Snell
  • ed.). Berlin: SpringerVerlag
  • 1976
Highly Influential
4 Excerpts

Similar Papers

Loading similar papers…