Computer Science – Computer Science and Game Theory
Scientific paper
2010-11-14
Computer Science
Computer Science and Game Theory
Scientific paper
This short note exhibits a truthful-in-expectation $O(\frac {\log m} {\log
\log m})$-approximation mechanism for combinatorial auctions with subadditive
bidders that uses polynomial communication.
Dobzinski Shahar
Fu Hu
Kleinberg Robert
No associations
LandOfFree
Truthfulness via Proxies 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 Truthfulness via Proxies, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Truthfulness via Proxies will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-456318