{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,11]],"date-time":"2026-05-11T10:50:42Z","timestamp":1778496642692,"version":"3.51.4"},"publisher-location":"Cham","reference-count":13,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030046118","type":"print"},{"value":"9783030046125","type":"electronic"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"tdm","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":[[2018]]},"DOI":"10.1007\/978-3-030-04612-5_17","type":"book-chapter","created":{"date-parts":[[2018,11,20]],"date-time":"2018-11-20T15:09:45Z","timestamp":1542726585000},"page":"246-263","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Simple and Efficient Budget Feasible Mechanisms for Monotone Submodular Valuations"],"prefix":"10.1007","author":[{"given":"Pooya","family":"Jalaly Khalilabadi","sequence":"first","affiliation":[]},{"given":"\u00c9va","family":"Tardos","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,11,21]]},"reference":[{"key":"17_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"414","DOI":"10.1007\/978-3-662-54110-4_29","volume-title":"Web and Internet Economics","author":"G Amanatidis","year":"2016","unstructured":"Amanatidis, G., Birmpas, G., Markakis, E.: Coverage, matching, and beyond: new results on budgeted mechanism design. In: Cai, Y., Vetta, A. (eds.) WINE 2016. LNCS, vol. 10123, pp. 414\u2013428. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-54110-4_29"},{"key":"17_CR2","first-page":"1","volume-title":"Web and Internet Economics","author":"Georgios Amanatidis","year":"2017","unstructured":"Amanatidis, G., Birmpas, G., Markakis, E.: 2017. On Budget-feasible mechanism design for symmetric submodular objectives. CoRR abs\/1704.06901 (2017). http:\/\/arxiv.org\/abs\/1704.06901"},{"key":"17_CR3","doi-asserted-by":"crossref","unstructured":"Anari, N., Goel, G., Nikzad, A.: Mechanism design for crowdsourcing: an optimal 1\u20131\/e competitive budget-feasible mechanism for large markets. In: 2014 IEEE 55th Annual Symposium on Foundations of Computer Science (FOCS), pp. 266\u2013275. IEEE (2014)","DOI":"10.1109\/FOCS.2014.36"},{"key":"17_CR4","doi-asserted-by":"crossref","unstructured":"Balkanski, E., Hartline, J.D.: Bayesian budget feasibility with posted pricing. In: Proceedings of the 25th International Conference on World Wide Web, International World Wide Web Conferences Steering Committee, pp. 189\u2013203 (2016)","DOI":"10.1145\/2872427.2883032"},{"key":"17_CR5","doi-asserted-by":"crossref","unstructured":"Bei, X., Chen, N., Gravin, N., Lu, P.: Budget feasible mechanism design: from prior-free to Bayesian. In: Proceedings of the Forty-fourth Annual ACM Symposium on Theory of Computing, pp. 449\u2013458. ACM(2012)","DOI":"10.1145\/2213977.2214020"},{"key":"17_CR6","doi-asserted-by":"publisher","first-page":"685","DOI":"10.1137\/1.9781611973082.54","volume-title":"Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms","author":"Ning Chen","year":"2011","unstructured":"Chen, N., Gravin, N., Lu, P.: On the approximability of budget feasible mechanisms. In: Proceedings of the Twenty-second Annual ACM-SIAM Symposium on Discrete Algorithms, SIAM, pp. 685\u2013699 (2011)"},{"key":"17_CR7","doi-asserted-by":"crossref","unstructured":"Dobzinski, S., Christos, H.P., Yaron, S.: Mechanisms for complement-free procurement. In: Proceedings of the 12th ACM Conference on Electronic Commerce, pp. 273\u2013282. ACM (2011)","DOI":"10.1145\/1993574.1993615"},{"key":"17_CR8","doi-asserted-by":"crossref","unstructured":"Goel, G., Nikzad, A., Singla, A.: Mechanism design for crowdsourcing markets with heterogeneous tasks. In: Second AAAI Conference on Human Computation and Crowdsourcing (2014)","DOI":"10.1609\/hcomp.v2i1.13158"},{"key":"17_CR9","unstructured":"Jalaly, P., Tardos, \u00c9.: 2017. Simple and Efficient Budget Feasible Mechanisms for Monotone Submodular Valuations. CoRR abs\/1703.10681 (2017). http:\/\/arxiv.org\/abs\/1703.10681"},{"issue":"1","key":"17_CR10","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1016\/S0020-0190(99)00031-9","volume":"70","author":"S Khuller","year":"1999","unstructured":"Khuller, S., Moss, A., Naor, J.S.: The budgeted maximum coverage problem. Inform. Process. Lett. 70(1), 39\u201345 (1999)","journal-title":"Inform. Process. Lett."},{"key":"17_CR11","doi-asserted-by":"crossref","unstructured":"Singer, Y.: Budget feasible mechanisms. In: 2010 51st Annual IEEE Symposium on Foundations of Computer Science (FOCS), pp. 765\u2013774. IEEE (2010)","DOI":"10.1109\/FOCS.2010.78"},{"key":"17_CR12","doi-asserted-by":"crossref","unstructured":"Singla, A., Krause, A.: Incentives for privacy tradeoff in community sensing. In: First AAAI Conference on Human Computation and Crowdsourcing (2013)","DOI":"10.1609\/hcomp.v1i1.13068"},{"issue":"1","key":"17_CR13","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1016\/S0167-6377(03)00062-2","volume":"32","author":"M Sviridenko","year":"2004","unstructured":"Sviridenko, M.: A note on maximizing a submodular set function subject to a knapsack constraint. Oper. Res. Lett. 32(1), 41\u201343 (2004)","journal-title":"Oper. Res. Lett."}],"container-title":["Lecture Notes in Computer Science","Web and Internet Economics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-04612-5_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T15:35:09Z","timestamp":1709825709000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-04612-5_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783030046118","9783030046125"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-04612-5_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"21 November 2018","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":"Oxford","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"United Kingdom","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 December 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 December 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wine2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.cs.ox.ac.uk\/conferences\/wine2018\/","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":"Easy Chiar","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"119","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":"28","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":"8","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":"24% - 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)"}}]}}