Weber Polyhedron And Weighted Shapley Values
In this paper, we consider the relationship between the Weber set and the Shapley set being the set of all weighted Shapley values of a TU-game. In particular, we propose a new proof for the fact that the Weber set always includes the Shapley set. It is shown that the inclusion mentioned follows directly from the representation theorem for the Weber set, established by Vasil'ev and van der Laan (2002), Siberian Adv. Math., V.12, N2, 97–125. Since the representation theorem applied is formulated in terms of the dividend sharing systems belonging to the so-called Weber polyhedron, we pay strong attention to some monotonicity properties of this polyhedron. Specifically, by making use of induction techniques, a new proof of the strong monotonicity of the Weber d-systems is obtained, and a simplified description of the Weber polyhedron is given.
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): 09 (2007)
Issue (Month): 01 ()
|Contact details of provider:|| Web page: http://www.worldscinet.com/igtr/igtr.shtml|
|Order Information:|| Email: |
When requesting a correction, please mention this item's handle: RePEc:wsi:igtrxx:v:09:y:2007:i:01:p:139-150. 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: (Tai Tone Lim)
If references are entirely missing, you can add them using this form.