Towards More Practical Linear Programming-based Techniques for Algorithmic Mechanism Design

3Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.
Get full text

Abstract

R. Lavi and C. Swamy (FOCS 2005, J. ACM 58(6), 25, 2011) introduced a general method for obtaining truthful-in-expectation mechanisms from linear programming based approximation algorithms. Due to the use of the Ellipsoid method, a direct implementation of the method is unlikely to be efficient in practice. We propose to use the much simpler and usually faster multiplicative weights update method instead. The simplification comes at the cost of slightly weaker approximation and truthfulness guarantees.

Cite

CITATION STYLE

APA

Elbassioni, K., Mehlhorn, K., & Ramezani, F. (2016). Towards More Practical Linear Programming-based Techniques for Algorithmic Mechanism Design. Theory of Computing Systems, 59(4), 641–663. https://doi.org/10.1007/s00224-016-9704-2

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free