Dobzinski, Shahar Breaking the logarithmic barrier for truthful combinatorial auctions with submodular bidders. (English) Zbl 1467.91056 SIAM J. Comput. 50, No. 3, STOC16-1-STOC16-17 (2021). Reviewer: Nikolay Kyurkchiev (Plovdiv) MSC: 91B26 68Q17 91B03 PDFBibTeX XMLCite \textit{S. Dobzinski}, SIAM J. Comput. 50, No. 3, STOC16--1-STOC16--17 (2021; Zbl 1467.91056) Full Text: DOI arXiv
Dobzinski, Shahar; Mehta, Aranyak; Roughgarden, Tim; Sundararajan, Mukund Is Shapley cost sharing optimal? (English) Zbl 1400.91260 Games Econ. Behav. 108, 130-138 (2018). MSC: 91B32 91A12 PDFBibTeX XMLCite \textit{S. Dobzinski} et al., Games Econ. Behav. 108, 130--138 (2018; Zbl 1400.91260) Full Text: DOI Link
Dobzinski, Shahar; Nisan, Noam; Schapira, Michael Truthful randomized mechanisms for combinatorial auctions. (English) Zbl 1237.91114 J. Comput. Syst. Sci. 78, No. 1, 15-25 (2012). MSC: 91B26 91A46 68W25 PDFBibTeX XMLCite \textit{S. Dobzinski} et al., J. Comput. Syst. Sci. 78, No. 1, 15--25 (2012; Zbl 1237.91114) Full Text: DOI
Dobzinski, Shahar; Mehta, Aranyak; Roughgarden, Tim; Sundararajan, Mukund Is Shapley cost sharing optimal? (English) Zbl 1136.91496 Monien, Burkhard (ed.) et al., Algorithmic game theory. First international symposium, SAGT 2008, Paderborn, Germany, April 30–May 2, 2008. Proceedings. Berlin: Springer (ISBN 978-3-540-79308-3/pbk). Lecture Notes in Computer Science 4997, 327-336 (2008). MSC: 91B32 91A12 PDFBibTeX XMLCite \textit{S. Dobzinski} et al., Lect. Notes Comput. Sci. 4997, 327--336 (2008; Zbl 1136.91496) Full Text: DOI