Linking the Kar and Folk Solutions Through a Problem Separation Property
Minimum cost spanning tree problems connect agents efficiently to a source with the cost of using an edge fixed. We revisit the dispute between the Kar and folk solutions, two solution concepts to divide the common cost of connection based on the Shapley value. We introduce a property called Weak Problem Separation that allows, under conditions, to divide the problem in two: connecting an agent to the source and connecting agents to each other. It allows us to characterize the set of all affine combinations of the Kar and folk solutions.
|Date of creation:||Jan 2013|
|Date of revision:|
|Contact details of provider:|| Postal: |
Phone: (519) 253-4232 ext 2368
Fax: (519) 973-7096
Web page: http://www.uwindsor.ca/economics/Email:
More information through EDIRC
When requesting a correction, please mention this item's handle: RePEc:wis:wpaper:1301. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Christian Trudeau)
If references are entirely missing, you can add them using this form.