Computer Science – Computer Science and Game Theory
Scientific paper
2011-12-06
Computer Science
Computer Science and Game Theory
Scientific paper
We study single-good auctions in a setting where each player knows his own valuation only within a constant multiplicative factor \delta{} in (0,1), and the mechanism designer knows \delta. The classical notions of implementation in dominant strategies and implementation in undominated strategies are naturally extended to this setting, but their power is vastly different. On the negative side, we prove that no dominant-strategy mechanism can guarantee social welfare that is significantly better than that achievable by assigning the good to a random player. On the positive side, we provide tight upper and lower bounds for the fraction of the maximum social welfare achievable in undominated strategies, whether deterministically or probabilistically.
Chiesa Alessandro
Micali Silvio
Zhu Zeyuan Allen
No associations
LandOfFree
Knightian Auctions 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 Knightian Auctions, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Knightian Auctions will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-380257