@inproceedings{aaad7372ff204b60b713f64e006d0c38,
title = "Towards more practical linear programming-based techniques for algorithmic mechanism design",
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.",
author = "Khaled Elbassioni and Kurt Mehlhorn and Fahimeh Ramezani",
note = "Publisher Copyright: {\textcopyright} Springer-Verlag Berlin Heidelberg 2015.; 8th International Symposium on Algorithmic Game Theory, SAGT 2015 ; Conference date: 28-09-2015 Through 30-09-2015",
year = "2015",
doi = "10.1007/978-3-662-48433-3_8",
language = "British English",
isbn = "9783662484326",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "98--109",
editor = "Martin Hoefer and Martin Hoefer",
booktitle = "Algorithmic Game Theory - 8th International Symposium, SAGT 2015",
address = "Germany",
}