Additivity in cost spanning tree problems

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.

MoreLess

Year of publication:	2004-05-04
Authors:	Bergantiños, Gustavo ; Vidal-Puga, Juan
Institutions:	EconWPA
Keywords:	cost spanning tree problems additivity characterization

freely available

Full text |

More access options

Check Google Scholar

In German libraries (KVK)

I need help

More details

Extent:	application/pdf
Series:	Game Theory and Information.
Type of publication:	Book / Working Paper
Notes:	Type of Document - pdf; pages: 22 22 pages
Classification:	C71 - Cooperative Games ; D70 - Analysis of Collective Decision-Making. General
Source:	RePEc - Research Papers in Economics

Persistent link: https://www.econbiz.de/10005062345