IDEAS home Printed from https://ideas.repec.org/p/snu/ioerwp/no88.html
   My bibliography  Save this paper

Demand Operators and the Dutta-Kar Rule for Minimum Cost Spanning Tree Problems

Author

Listed:
  • Youngsub Chun
  • Chang-Yong Han
  • Bawoo Kim

Abstract

We investigate the implications of two demand operators, the weak demand operator and the strong demand operator, introduced by Granot and Huberman (1984) for minimum cost spanning tree problems (mcstp¡¯s). The demand operator is intended to measure the maximum amount that each agent can ask to her followers in compensation for making a link to her. However, the original definition of the weak demand operator does not capture this idea and we propose its modification. Then, we introduce a procedure which enables us to calculate the maximum sequentially for each agent. By applying the modified weak demand operator to the irreducible mcstp¡¯s, the Dutta-Kar allocation is obtained from any component-wise efficient initial allocation. For the strong demand operator, the Dutta-Kar allocation can be obtained if the procedure is initiated from any allocation in the irreducible core.

Suggested Citation

  • Youngsub Chun & Chang-Yong Han & Bawoo Kim, 2013. "Demand Operators and the Dutta-Kar Rule for Minimum Cost Spanning Tree Problems," Working Paper Series no88, Institute of Economic Research, Seoul National University.
    • Handle: RePEc:snu:ioerwp:no88
    as

    Download full text from publisher

    File URL: https://ier.snu.ac.kr/activity/working-papers?md=download&seqidx=37
    Download Restriction: no
    ---><---

    More about this item

    Keywords

    Minimum cost spanning tree problems; demand operators; irreducible matrix; Dutta-Kar rule; Prim algorithm;
    All these keywords.

    JEL classification:

    • C71 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - Cooperative Games

    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:snu:ioerwp:no88. 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.

    We have no bibliographic references for this item. You can help adding them by using 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: Hojung Lee (email available below). General contact details of provider: https://edirc.repec.org/data/iesnukr.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.