Connectivity and Allocation Rule in a Directed Network
We introduce a new notion of connectivity, what we call weak connectivity, in a directed network where communication is one-way, and show that weak connectivity is equivalent to the usual concept of connectivity if the outdegree of each node is at most one, referred as the [DC] condition. Based on weak connectivity, we define an allocation rule in a directed network by applying the Shapley value type of consideration. We show that the allocation rule is the unique allocation rule satisfying component efficiency and equal bargaining power under the [DC] condition. If the [DC] condition does not hold, it fails to satisfy component efficiency, but can be shown to be the only allocation rule that satisfies equal bargaining power and quasi-component efficiency which is a weaker property.
Year of publication: |
2008
|
---|---|
Authors: | Jeong-Yoo, Kim ; Tackseung, Jun |
Published in: |
The B.E. Journal of Theoretical Economics. - De Gruyter, ISSN 1935-1704. - Vol. 8.2008, 1, p. 1-21
|
Publisher: |
De Gruyter |
Saved in:
Online Resource
Saved in favorites
Similar items by person
-
Designing the Efficient Information-Processing Organization
Tackseung, Jun, (2010)
-
Endogenous Internet Structure and Bargaining Power in Interconnection Agreements
Tackseung, Jun, (2010)
-
Signal Jamming in Games with Multiple Senders
Jeong-Yoo, Kim, (2003)
- More ...