Computer Science – Computer Science and Game Theory
Scientific paper
2012-03-20
Computer Science
Computer Science and Game Theory
Scientific paper
We study the problem of designing mechanisms to allocate a heterogeneous set of divisible goods among a set of agents in a fair manner. We consider the well known solution concept of proportional fairness that has found applications in many real-world scenarios. Although finding a proportionally fair solution is computationally tractable, it cannot be implemented in a truthful manner. To overcome this, in this paper, we give mechanisms which are truthful and achieve proportional fairness in an approximate manner. We use a strong notion of approximation, requiring the mechanism to give each agent a good approximation of its proportionally fair utility. A motivating example is provided by the massive privatization auction in the Czech republic in the early 90s.
Cole Richard
Gkatzelis Vasilis
Goel Gagan
No associations
LandOfFree
Truthful Mechanisms for Proportionally Fair Allocations does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Truthful Mechanisms for Proportionally Fair Allocations, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Truthful Mechanisms for Proportionally Fair Allocations will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-487826