Dobzinski, Shahar; Fu, Hu; Kleinberg, Robert D. Optimal auctions with correlated bidders are easy. (English) Zbl 1288.91102 Proceedings of the 43rd annual ACM symposium on theory of computing, STOC ’11. San Jose, CA, USA, June 6–8, 2011. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-4503-0691-1). 129-138 (2011). Cited in 2 ReviewsCited in 10 Documents MSC: 91B26 Auctions, bargaining, bidding and selling, and other market models 68Q25 Analysis of algorithms and problem complexity 90C05 Linear programming 90C27 Combinatorial optimization 90C29 Multi-objective and goal programming 68W25 Approximation algorithms 68R05 Combinatorics in computer science Keywords:combinatorial auctions; incentive compatibility PDF BibTeX XML Cite \textit{S. Dobzinski} et al., in: Proceedings of the 43rd annual ACM symposium on theory of computing, STOC '11. San Jose, CA, USA, June 6--8, 2011. New York, NY: Association for Computing Machinery (ACM). 129--138 (2011; Zbl 1288.91102) Full Text: DOI