Additivity in cost spanning tree problems

1. Bergantiños Cid, Gustavo
2. Vidal Puga, Juan José

Exportar

Exportar

×

MLA

modern-language-association

APA

apa

Chicago

chicago-fullnote-bibliography

Harvard

harvard-cite-them-right

Vancouver

vancouver-author-date

---

RIS BibTex

Exportar

×

Non se pode exportar o documento porque pertence a outro portal.

Texto completo

lock_openTexto completo externo

DIALNET GOOGLE SCHOLAR lock_openAcceso aberto editor

Resumo

We characterize a rule in cost spanning tree problems using an additiv- ity property and some basic properties. If the set of possible agents has at least three agents, these basic properties are symmetry and separability. If the set of possible agents has two agents, we must add positivity. In both characterizations we can replace separability by population monotonicity.

Fonte de datos: Dialnet