Sharing the Cost of Maximum Quality Optimal Spanning Trees

Begoña Subiza and Josep E. Peris

No 19-2, QM&ET Working Papers from University of Alicante, D. Quantitative Methods and Economic Theory

Abstract: Minimum cost spanning tree problems have been widely studied in operation research and economic literature. Multi-criteria optimal spanning trees provide a more realistic representation of di↵erent actual problems. Once an optimal tree is obtained, how to allocate its cost among the agents defines a situation quite di↵erent from what we have in the minimum cost spanning tree problems. In this paper, we analyze a multicriteria problem where the objective is to connect a group of agents to a source with the highest possible quality at the cheapest cost. We compute optimal networks and propose cost allocations for the total cost of the project. We analyze properties of the proposed solution; in particular, we focus on coalitional stability (core selection), a central concern in the literature on minimum cost spanning tree problems.

Keywords: Minimum cost spanning tree; Multi-criteria decision making; Quality; Cost sharing (search for similar items in EconPapers)
JEL-codes: C71 D63 D71 (search for similar items in EconPapers)
Pages: 27 pages
Date: 2019-05-15
New Economics Papers: this item is included in nep-bec, nep-gth and nep-ore
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
https://web.ua.es/es/dmcte/documentos/qmetwp1902.pdf Full text (application/pdf)

Related works:
Journal Article: Sharing the cost of maximum quality optimal spanning trees (2021)
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:ris:qmetal:2019_002

Access Statistics for this paper

More papers in QM&ET Working Papers from University of Alicante, D. Quantitative Methods and Economic Theory Contact information at EDIRC.
Bibliographic data for series maintained by Julio Carmona ().