Publications
Detailed Information
The Shapley value for two-source minimum cost spanning tree problems : 소스가 두 개인 최소신장가지문제에서의 사플리 밸류
Cited 0 time in
Web of Science
Cited 0 time in Scopus
- Authors
- Advisor
- 전영섭
- Major
- 사회과학대학 경제학부
- Issue Date
- 2014-02
- Publisher
- 서울대학교 대학원
- Keywords
- Minimum cost spanning tree problems ; Boruvka algorithm ; Irreducible form ; Cost allocation ; Shapley value
- Description
- 학위논문 (석사)-- 서울대학교 대학원 : 경제학부, 2014. 2. 전영섭.
- Abstract
- We study two-source minimum cost spanning tree problem. Agents need to connect to the sources either directly or through other agents. For each connection there is an associated cost, and the total cost of connecting all agents must be shared among them. We introduce a cost allocation rule that is defined based on the Boruvka algorithm and show that this rule coincides with a widely used rule, the Shapley value, in the irreducible form of the problem.
- Language
- English
- Files in This Item:
- Appears in Collections:
Item View & Download Count
Items in S-Space are protected by copyright, with all rights reserved, unless otherwise indicated.