Metzler Functions and the Shortest-Path Problem

Takuya Masuzawa
Additional contact information
Takuya Masuzawa: Faculty of Economics, Keio University

No 2012-030, Keio/Kyoto Joint Global COE Discussion Paper Series from Keio/Kyoto Joint Global COE Program

Abstract: 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.

Pages: 15 pages
Date: 2013-02
New Economics Papers: this item is included in nep-net
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
https://ies.keio.ac.jp/old_project/old/gcoe-econbus/pdf/dp/DP2012-030.pdf (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:kei:dpaper:2012-030

Access Statistics for this paper

More papers in Keio/Kyoto Joint Global COE Discussion Paper Series from Keio/Kyoto Joint Global COE Program Contact information at EDIRC.
Bibliographic data for series maintained by Global COE Program Office ().