Metzler Functions and the Shortest-Path Problem
Metzler 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.
|Date of creation:||Feb 2013|
|Date of revision:|
|Contact details of provider:|| Postal: 2-15-45, Mita, Minato-ku, Tokyo 108-8345|
Web page: http://ies.keio.ac.jp/old_project/old/gcoe-econbus/
More information through EDIRC
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;Game Theory Society, vol. 37(2), pages 185-201, June.
When requesting a correction, please mention this item's handle: RePEc:kei:dpaper:2012-030. See general information about how to correct material in RePEc.
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.