Highly Influenced

# Randomized Shortest-Path Problems: Two Related Models

@article{Saerens2009RandomizedSP, title={Randomized Shortest-Path Problems: Two Related Models}, author={Marco Saerens and Youssef Achbany and François Fouss and Luh Yen}, journal={Neural Computation}, year={2009}, volume={21}, pages={2363-2404} }

- Published 2009 in Neural Computation
DOI:10.1162/neco.2009.11-07-643

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

#### From This Paper

##### Figures, tables, results, connections, and topics extracted from this paper.

36 Extracted Citations

59 Extracted References

Similar Papers

#### Referenced Papers

##### Publications referenced by this paper.

Showing 1-10 of 59 references

Highly Influential

Highly Influential

Highly Influential

Highly Influential

Highly Influential

Highly Influential

Highly Influential

Highly Influential

Highly Influential

Highly Influential