On the approximation guarantee of obviously strategyproof mechanisms
share
The concept of obviously strategyproof (OSP) mechanisms has the merit to extend the relevance of incentive-compatibility issues to agents who are not perfectly rational. The majority of the literature in the area has either highlighted the shortcomings of OSP or focused on the "right" definition rather than on the construction of mechanisms. We here give the first set of tight results on the approximation guarantee of OSP mechanisms for two canonical problems, scheduling related machines and set system problems. By extending the well-known cycle monotonicity technique, we are able to concentrate on the algorithmic component of OSP mechanisms and provide some novel paradigms for their design.
READ FULL TEXT