An efficient and fair solution for communication graph games

C-Tier
Journal: Economics Letters
Year: 2012
Volume: 117
Issue: 3
Pages: 786-789

Score contribution per author:

0.335 = (α=2.01 / 3 authors) × 0.5x C-tier

α: calibrated so average coauthorship-adjusted count equals average raw count

Abstract

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.

Technical Details

RePEc Handle
repec:eee:ecolet:v:117:y:2012:i:3:p:786-789
Journal Field
General
Author Count
3
Added to Database
2026-01-29