Reducing truth-telling online mechanisms to online optimization
From MaRDI portal
Publication:3581276
DOI10.1145/780542.780616zbMath1192.68272OpenAlexW2081931751MaRDI QIDQ3581276
Adam Meyerson, Baruch Awerbuch, Yossi Azar
Publication date: 16 August 2010
Published in: Proceedings of the thirty-fifth annual ACM symposium on Theory of computing (Search for Journal in Brave)
Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.298.2105
Related Items (6)
Fault tolerant mechanism design ⋮ Dynamic pricing of servers on trees ⋮ Reducing mechanism design to algorithm design via machine learning ⋮ Online random sampling for budgeted settings ⋮ Obtaining online approximation algorithms for facility dispersion from offline algorithms ⋮ Incentive compatible mulit-unit combinatorial auctions: a primal dual approach
This page was built for publication: Reducing truth-telling online mechanisms to online optimization
