No advantageous merging in minimum cost spanning tree problems

1. Gómez Rúa, María
2. Vidal Puga, Juan José

Export

Export

×

MLA

modern-language-association

APA

apa

Chicago

chicago-fullnote-bibliography

Harvard

harvard-cite-them-right

Vancouver

vancouver-author-date

---

RIS BibTex

Export

×

This document cannot be exported because it belongs to another portal.

Full text

lock_openFull text externo

DIALNET GOOGLE SCHOLAR lock_openOpen access editor

Abstract

In the context of cost sharing in minimum cost spanning tree problems, we introduce a property called No Advantageous Merging. This property implies that no group of agents can be better o.. claiming to be a single node. We show that the sharing rule that assigns to each agent his own connection cost (the Bird rule) satisfies this property. Moreover, we provide a characterization of the Bird rule using No Advantageous Merging.

Data source: Dialnet