Metzler Functions and the Shortest-Path Problem
AbstractMetzler functions arise in various kinds of system optimization problems such as the stable matching of two-sided markets and the α-cores of games with punishment-dominance relations. In this paper, we discuss the shortest-path problem as an application of the theory of Metzler functions. We derive the Moore-Bellman-Ford algorithm for the shortest-path problem.
Download InfoIf you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
Bibliographic InfoPaper provided by Keio/Kyoto Joint Global COE Program in its series Keio/Kyoto Joint Global COE Discussion Paper Series with number 2012-030.
Length: 15 pages
Date of creation: Feb 2013
Date of revision:
This paper has been announced in the following NEP Reports:
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- Takuya Masuzawa, 2008. "Computing the cores of strategic games with punishment–dominance relations," International Journal of Game Theory, Springer, vol. 37(2), pages 185-201, June.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Global COE Program Office).
If references are entirely missing, you can add them using this form.