IDEAS home Printed from https://ideas.repec.org/p/kei/dpaper/2012-030.html
   My bibliography  Save this paper

Metzler Functions and the Shortest-Path Problem

Author

Listed:
  • Takuya Masuzawa

    (Faculty of Economics, Keio University)

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.

Suggested Citation

  • Takuya Masuzawa, 2013. "Metzler Functions and the Shortest-Path Problem," Keio/Kyoto Joint Global COE Discussion Paper Series 2012-030, Keio/Kyoto Joint Global COE Program.
    • Handle: RePEc:kei:dpaper:2012-030
    as

    Download full text from publisher

    File URL: https://ies.keio.ac.jp/old_project/old/gcoe-econbus/pdf/dp/DP2012-030.pdf
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Takuya Masuzawa, 2004. "Punishment strategies make the α-coalitional game ordinally convex and balanced," International Journal of Game Theory, Springer;Game Theory Society, vol. 32(4), pages 479-483, August.
    2. 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.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Takuya Masuzawa, 2012. "A Simple and Constructive Proof of the Existence of a Competitive Price Under the Gross Substitute Property," Keio/Kyoto Joint Global COE Discussion Paper Series 2012-022, Keio/Kyoto Joint Global COE Program.
    2. Takuya Masuzawa, 2012. "Punishment-Dominance Condition on Stable Two-Sided Matching Algorithms," Keio/Kyoto Joint Global COE Discussion Paper Series 2012-018, Keio/Kyoto Joint Global COE Program.
    3. Csóka, Péter & Jean-Jacques Herings, P. & Kóczy, László Á. & Pintér, Miklós, 2011. "Convex and exact games with non-transferable utility," European Journal of Operational Research, Elsevier, vol. 209(1), pages 57-62, February.

    More about this item

    NEP fields

    This paper has been announced in the following NEP Reports:

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. 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.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Global COE Program Office (email available below). General contact details of provider: https://edirc.repec.org/data/iekeijp.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.