IDEAS home Printed from https://ideas.repec.org/a/ebl/ecbull/eb-13-00831.html
   My bibliography  Save this article

It is hard to agree on a spanning tree

Author

Listed:
  • Andreas Darmann

    (Institute of Public Economics, University of Graz)

Abstract

We consider the problem of finding a "fair" or "acceptable" spanning tree in an undirected graph when each member of a group of agents proposes a spanning tree. An "acceptable" spanning tree in that respect is a spanning tree which does not differ in more than a given number of edges from each of the single proposals. We show that, from a computational perspective, determining if such a spanning tree exists is a difficult (NP-complete) problem.

Suggested Citation

  • Andreas Darmann, 2014. "It is hard to agree on a spanning tree," Economics Bulletin, AccessEcon, vol. 34(1), pages 34-40.
    • Handle: RePEc:ebl:ecbull:eb-13-00831
    as

    Download full text from publisher

    File URL: http://www.accessecon.com/Pubs/EB/2014/Volume34/EB-14-V34-I1-P4.pdf
    Download Restriction: no
    ---><---

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Andreas Darmann, 2016. "It is difficult to tell if there is a Condorcet spanning tree," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 84(1), pages 93-104, August.

    More about this item

    Keywords

    social choice; spanning trees; computational complexity;
    All these keywords.

    JEL classification:

    • D7 - Microeconomics - - Analysis of Collective Decision-Making

    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:ebl:ecbull:eb-13-00831. 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: John P. Conley (email available below). General contact details of provider: .

    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.