An efficient and fair solution for communication graph games
We introduce an efficient solution for games with communication graph structures and show that it is characterized by efficiency, fairness and a new axiom called fair distribution of the surplus.
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.
References listed on IDEAS
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- Béal, Sylvain & Rémila, Eric & Solal, Philippe, 2012.
"Fairness and fairness for neighbors: The difference between the Myerson value and component-wise egalitarian solutions,"
Elsevier, vol. 117(1), pages 263-267.
- Béal, Sylvain & Rémila, Eric & Solal, Philippe, 2012. "Fairness and fairness for neighbors: the difference between the Myerson value and component-wise egalitarian solutions," MPRA Paper 36857, University Library of Munich, Germany.
When requesting a correction, please mention this item's handle: RePEc:eee:ecolet:v:117:y:2012:i:3:p:786-789. 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: (Zhang, Lei)
If references are entirely missing, you can add them using this form.