From convex optimization to randomized mechanisms

DOI10.1145/1993636.1993657zbMath1288.91103MaRDI QIDQ5419084

Qiqi Yan, Tim Roughgarden, Shaddin Dughmi

Publication date: 5 June 2014

Published in: Proceedings of the forty-third annual ACM symposium on Theory of computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1993636.1993657

zbMATH Keywords

algorithmic mechanism design; combinatorial auctions

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

90C05: Linear programming

91B26: Auctions, bargaining, bidding and selling, and other market models

68W25: Approximation algorithms

91B15: Welfare economics