Additivity in cost spanning tree problems
Gustavo Bergantiños and
Game Theory and Information from EconWPA
We characterize a rule in cost spanning tree problems using an additivity 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.
Keywords: cost; spanning; tree; problems; additivity; characterization (search for similar items in EconPapers)
JEL-codes: C71 D70 (search for similar items in EconPapers)
New Economics Papers: this item is included in nep-mic
Note: Type of Document - pdf; pages: 22
References: View references in EconPapers View complete reference list from CitEc
Citations View citations in EconPapers (2) Track citations by RSS feed
Downloads: (external link)
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
Persistent link: https://EconPapers.repec.org/RePEc:wpa:wuwpga:0405001
Access Statistics for this paper
More papers in Game Theory and Information from EconWPA
Series data maintained by EconWPA ().