Arbeitspapier
Defining Rules in Cost Spanning Tree Problems Through the Canonical Form
We define the canonical form of a cost spanning tree problem. The canonical form has the property that reducing the cost of any arc, the minimal cost of connecting agents to the source is also reduced. We argue that the canonical form is a relevant concept in this kind of problems and study a rule using it. This rule satisfies much more interesting properties than other rules in the literature. Furthermore we provide two characterizations. Finally, we present several approaches to this rule without using the canonical form.
- Language
-
Englisch
- Bibliographic citation
-
Series: Nota di Lavoro ; No. 97.2004
- Classification
-
Wirtschaft
Cooperative Games
Analysis of Collective Decision-Making: General
Network Formation and Analysis: Theory
- Subject
-
Cost spanning tree
Rules
Canonical form
Kosten
Spieltheorie
- Event
-
Geistige Schöpfung
- (who)
-
Vidal-Puga, Juan J.
Bergantiños, Gustavo
- Event
-
Veröffentlichung
- (who)
-
Fondazione Eni Enrico Mattei (FEEM)
- (where)
-
Milano
- (when)
-
2004
- Handle
- Last update
- 10.03.2025, 11:41 AM CET
Data provider
This object is provided by:
ZBW - Deutsche Zentralbibliothek für Wirtschaftswissenschaften - Leibniz-Informationszentrum Wirtschaft. If you have any questions about the object, please contact the data provider.
ZBW - Deutsche Zentralbibliothek für Wirtschaftswissenschaften - Leibniz-Informationszentrum Wirtschaft. If you have any questions about the object, please contact the data provider.
Object type
- Arbeitspapier
Associated
- Vidal-Puga, Juan J.
- Bergantiños, Gustavo
- Fondazione Eni Enrico Mattei (FEEM)
Time of origin
- 2004
Other Objects (12)
Bounded degree spanning trees
Chain-constrained spanning trees
Erweiterung des Spanning Tree Simulators
Comparative Study of SWST (Simple Weighted Spanning Tree) and EAST (Energy Aware Spanning Tree)
Weight-Constrained Minimum Spanning Tree Problem
On spanning tree problems with multiple objectives
Diameter Constrained Fuzzy Minimum Spanning Tree Problem
Implementierung des Spanning-Tree-Algorithmus IEEE 802.1D
Connectivity Maintenance through Unlabeled Spanning Tree Matching
Ranking and ordering problems of spanning trees
Geometric Spanning Trees Minimizing the Wiener Index
On the Optimal Communication Spanning Tree Problem
Bounded degree spanning trees
Chain-constrained spanning trees
Erweiterung des Spanning Tree Simulators
Comparative Study of SWST (Simple Weighted Spanning Tree) and EAST (Energy Aware Spanning Tree)
Weight-Constrained Minimum Spanning Tree Problem
On spanning tree problems with multiple objectives
Diameter Constrained Fuzzy Minimum Spanning Tree Problem
Implementierung des Spanning-Tree-Algorithmus IEEE 802.1D
Connectivity Maintenance through Unlabeled Spanning Tree Matching
Ranking and ordering problems of spanning trees
Geometric Spanning Trees Minimizing the Wiener Index
On the Optimal Communication Spanning Tree Problem
Bounded degree spanning trees
Chain-constrained spanning trees
Erweiterung des Spanning Tree Simulators
Comparative Study of SWST (Simple Weighted Spanning Tree) and EAST (Energy Aware Spanning Tree)
Weight-Constrained Minimum Spanning Tree Problem
On spanning tree problems with multiple objectives
Diameter Constrained Fuzzy Minimum Spanning Tree Problem
Implementierung des Spanning-Tree-Algorithmus IEEE 802.1D
Connectivity Maintenance through Unlabeled Spanning Tree Matching
Ranking and ordering problems of spanning trees
Geometric Spanning Trees Minimizing the Wiener Index