×

Found 4 Documents (Results 1–4)

An impossibility result for truthful combinatorial auctions with submodular valuations. (English) Zbl 1288.91081

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). 139-148 (2011).
PDFBibTeX XMLCite
Full Text: DOI arXiv

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).
PDFBibTeX XMLCite
Full Text: DOI arXiv

Truthful randomized mechanisms for combinatorial auctions. (English) Zbl 1300.91033

Kleinberg, Jon M. (ed.), Proceedings of the 38th annual ACM symposium on theory of computing, STOC 2006. Seattle, WA, USA, May 21–23, 2006. New York, NY: ACM Press (ISBN 1-59593-134-1). 644-652 (2006).
MSC:  91B26 91A46 68W25
PDFBibTeX XMLCite
Full Text: DOI Link

Filter Results by …

Document Type

Year of Publication

Main Field