{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,25]],"date-time":"2026-02-25T14:44:28Z","timestamp":1772030668185,"version":"3.50.1"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030649456","type":"print"},{"value":"9783030649463","type":"electronic"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-64946-3_10","type":"book-chapter","created":{"date-parts":[[2020,12,5]],"date-time":"2020-12-05T09:03:39Z","timestamp":1607159019000},"page":"133-146","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A Generic Truthful Mechanism for Combinatorial Auctions"],"prefix":"10.1007","author":[{"given":"Hanrui","family":"Zhang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,12,6]]},"reference":[{"key":"10_CR1","doi-asserted-by":"crossref","unstructured":"Assadi, S., Singla, S.: Improved truthful mechanisms for combinatorial auctions with submodular bidders. In: Proceedings of the IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS 2019), pp. 233\u2013248. IEEE (2019)","DOI":"10.1109\/FOCS.2019.00024"},{"key":"10_CR2","unstructured":"Chen, W., Teng, S.H., Zhang, H.: Capturing complementarity in set functions by going beyond submodularity\/subadditivity. In: Proceedings of the 10th Innovations in Theoretical Computer Science Conference (ITCS 2019). Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik (2019)"},{"key":"10_CR3","doi-asserted-by":"crossref","unstructured":"Devanur, N., Morgenstern, J., Syrgkanis, V., Weinberg, S.M.: Simple auctions with simple strategies. In: Proceedings of the Sixteenth ACM Conference on Economics and Computation, pp. 305\u2013322. ACM (2015)","DOI":"10.1145\/2764468.2764484"},{"key":"10_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1007\/978-3-540-74208-1_7","volume-title":"Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques","author":"S Dobzinski","year":"2007","unstructured":"Dobzinski, S.: Two randomized mechanisms for combinatorial auctions. In: Charikar, M., Jansen, K., Reingold, O., Rolim, J.D.P. (eds.) APPROX\/RANDOM -2007. LNCS, vol. 4627, pp. 89\u2013103. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-74208-1_7"},{"key":"10_CR5","doi-asserted-by":"crossref","unstructured":"Dobzinski, S.: An impossibility result for truthful combinatorial auctions with submodular valuations. In: Proceedings of the Forty-Third Annual ACM Symposium on Theory of Computing, pp. 139\u2013148. ACM (2011)","DOI":"10.1145\/1993636.1993656"},{"key":"10_CR6","doi-asserted-by":"crossref","unstructured":"Dobzinski, S.: Breaking the logarithmic barrier for truthful combinatorial auctions with submodular bidders. In: Proceedings of the Forty-Eighth Annual ACM Symposium on Theory of Computing, pp. 940\u2013948. ACM (2016)","DOI":"10.1145\/2897518.2897569"},{"key":"10_CR7","doi-asserted-by":"crossref","unstructured":"Dobzinski, S., Nisan, N., Schapira, M.: Approximation algorithms for combinatorial auctions with complement-free bidders. In: Proceedings of the Thirty-Seventh Annual ACM Symposium on Theory of Computing, pp. 610\u2013618. ACM (2005)","DOI":"10.1145\/1060590.1060681"},{"key":"10_CR8","doi-asserted-by":"crossref","unstructured":"Dobzinski, S., Nisan, N., Schapira, M.: Truthful randomized mechanisms for combinatorial auctions. In: Proceedings of the Thirty-Eighth Annual ACM Symposium on Theory of Computing, pp. 644\u2013652. ACM (2006)","DOI":"10.1145\/1132516.1132607"},{"key":"10_CR9","doi-asserted-by":"crossref","unstructured":"Dobzinski, S., Vondr\u00e1k, J.: The computational complexity of truthfulness in combinatorial auctions. In: Proceedings of the 13th ACM Conference on Electronic Commerce, pp. 405\u2013422. ACM (2012)","DOI":"10.1145\/2229012.2229044"},{"key":"10_CR10","doi-asserted-by":"crossref","unstructured":"D\u00fcetting, P., Feldman, M., Kesselheim, T., Lucier, B.: Prophet inequalities made easy: stochastic optimization by pricing non-stochastic inputs. In: IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS 2017), pp. 540\u2013551. IEEE (2017)","DOI":"10.1109\/FOCS.2017.56"},{"key":"10_CR11","doi-asserted-by":"crossref","unstructured":"Eden, A., Feldman, M., Friedler, O., Talgam-Cohen, I., Weinberg, S.M.: A simple and approximately optimal mechanism for a buyer with complements. In: Proceedings of the 2017 ACM Conference on Economics and Computation, p. 323 (2017)","DOI":"10.1145\/3033274.3085116"},{"issue":"1","key":"10_CR12","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1137\/070680977","volume":"39","author":"U Feige","year":"2009","unstructured":"Feige, U.: On maximizing welfare when utility functions are subadditive. SIAM J. Comput. 39(1), 122\u2013142 (2009)","journal-title":"SIAM J. Comput."},{"key":"10_CR13","doi-asserted-by":"crossref","unstructured":"Feige, U., Feldman, M., Immorlica, N., Izsak, R., Lucier, B., Syrgkanis, V.: A unifying hierarchy of valuations with complements and substitutes. In: Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence (2015)","DOI":"10.1609\/aaai.v29i1.9314"},{"key":"10_CR14","doi-asserted-by":"crossref","unstructured":"Feige, U., Izsak, R.: Welfare maximization and the supermodular degree. In: Proceedings of the 4th Conference on Innovations in Theoretical Computer Science, pp. 247\u2013256. ACM (2013)","DOI":"10.1145\/2422436.2422466"},{"key":"10_CR15","doi-asserted-by":"crossref","unstructured":"Feige, U., Vondrak, J.: Approximation algorithms for allocation problems: improving the factor of 1-1\/e, pp. 667\u2013676. IEEE (2006)","DOI":"10.1109\/FOCS.2006.14"},{"key":"10_CR16","doi-asserted-by":"crossref","unstructured":"Feldman, M., Friedler, O., Morgenstern, J., Reiner, G.: Simple mechanisms for agents with complements. In: Proceedings of the 2016 ACM Conference on Economics and Computation, pp. 251\u2013267. ACM (2016)","DOI":"10.1145\/2940716.2940735"},{"key":"10_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"636","DOI":"10.1007\/978-3-642-31585-5_56","volume-title":"Automata, Languages, and Programming","author":"P Krysta","year":"2012","unstructured":"Krysta, P., V\u00f6cking, B.: Online mechanism design (randomized rounding on the fly). In: Czumaj, A., Mehlhorn, K., Pitts, A., Wattenhofer, R. (eds.) ICALP 2012. LNCS, vol. 7392, pp. 636\u2013647. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-31585-5_56"},{"key":"10_CR18","doi-asserted-by":"crossref","unstructured":"Mirrokni, V., Schapira, M., Vondr\u00e1k, J.: Tight information-theoretic lower bounds for welfare maximization in combinatorial auctions. In: Proceedings of the 9th ACM Conference on Electronic Commerce, pp. 70\u201377. ACM (2008)","DOI":"10.1145\/1386790.1386805"},{"key":"10_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"868","DOI":"10.1007\/3-540-45465-9_74","volume-title":"Automata, Languages and Programming","author":"N Nisan","year":"2002","unstructured":"Nisan, N.: The communication complexity of approximate set packing and covering. In: Widmayer, P., Eidenbenz, S., Triguero, F., Morales, R., Conejo, R., Hennessy, M. (eds.) ICALP 2002. LNCS, vol. 2380, pp. 868\u2013875. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-45465-9_74"},{"key":"10_CR20","doi-asserted-by":"crossref","unstructured":"Vondr\u00e1k, J.: Optimal approximation for the submodular welfare problem in the value oracle model. In: Proceedings of the Fortieth Annual ACM Symposium on Theory of Computing, pp. 67\u201374. ACM (2008)","DOI":"10.1145\/1374376.1374389"}],"container-title":["Lecture Notes in Computer Science","Web and Internet Economics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-64946-3_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,2]],"date-time":"2022-12-02T16:47:06Z","timestamp":1669999626000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-64946-3_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030649456","9783030649463"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-64946-3_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"6 December 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WINE","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Web and Internet Economics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Beijing","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 December 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 December 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wine2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/econcs.pku.edu.cn\/wine2020\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"136","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"31","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"11","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"23% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"10","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}