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.
If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.
Volume (Year): 8 (2008)
Issue (Month): 1 (September)
Pages: 1-21
| Handle: | RePEc:bpj:bejtec:v:8:y:2008:i:1:n:19 |
| Contact details of provider: | Web page: http://www.degruyter.com
|
| Order Information: | Web: http://www.degruyter.com/view/j/bejte |
No references listed on IDEAS
You can help add them by filling out this form.
This item is not listed on Wikipedia, on a reading list or among the top items on IDEAS.
When requesting a correction, please mention this item's handle: RePEc:bpj:bejtec:v:8:y:2008:i:1:n:19. 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: (Peter Golla)
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If references are entirely missing, you can add them using this form.
If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.
Please note that corrections may take a couple of weeks to filter through the various RePEc services.