Towards More Practical Linear Programming-based Techniques for Algorithmic Mechanism Design
Computer Science and Game Theory
2016-06-15 v4 Data Structures and Algorithms
Abstract
R. Lavy and C. Swamy (FOCS 2005, J. ACM 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
@article{arxiv.1408.1577,
title = {Towards More Practical Linear Programming-based Techniques for Algorithmic Mechanism Design},
author = {Khaled Elbassioni and Kurt Mehlhorn and Fahimeh Ramezani},
journal= {arXiv preprint arXiv:1408.1577},
year = {2016}
}