A Note on the Power of Truthful Approximation Mechanisms

Details A Note on the Power of Truthful Approximation Mechanisms A Note on the Power of Truthful Approximation Mechanisms

2009-07-30

arxiv.org/abs/0907.5219v2

Computer Science

Computer Science and Game Theory

Scientific paper

We study the power of polynomial-time truthful mechanisms comparing to polynomial time (non-truthful) algorithms. We show that there is a setting in which deterministic polynomial-time truthful mechanisms cannot guarantee a bounded approximation ratio, but a non-truthful FPTAS exists. We also show that in the same setting there is a universally truthful mechanism that provides an approximation ratio of 2. This shows that the cost of truthfulness is unbounded. The proofs are almost standard in the field and follow from known results.

Affiliated with

Also associated with

No associations

Rating

A Note on the Power of Truthful Approximation Mechanisms 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 A Note on the Power of Truthful Approximation Mechanisms, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Note on the Power of Truthful Approximation Mechanisms will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-468450