The optimistic TU game in minimum cost spanning tree problems

1. Gustavo Bergantiños
2. Juan J. Vidal-Puga

Exportieren

Exportieren

×

MLA

modern-language-association

APA

apa

Chicago

chicago-fullnote-bibliography

Harvard

harvard-cite-them-right

Vancouver

vancouver-author-date

---

RIS BibTex

Exportieren

×

Das Dokument kann nicht exportiert werden, da es zu einem anderen Portal gehört.

Volltext

lock_openVolltext externo

DIALNET GOOGLE SCHOLAR lock_openOpen Access editor

Zusammenfassung

We associate an optimistic TU game with each minimum cost spanning tree problem.We define the worth of a coalition S as the cost of connecting agents in S to the source assuming that agents in N\S are already connected to the source, and agents in S can connect through agents in N\S. We study the Shapley value of this new game.

Fuente de los datos: Dialnet