{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:29:06Z","timestamp":1750220946972,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":27,"publisher":"ACM","license":[{"start":{"date-parts":[[2019,6,17]],"date-time":"2019-06-17T00:00:00Z","timestamp":1560729600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2019,6,17]]},"DOI":"10.1145\/3328526.3329586","type":"proceedings-article","created":{"date-parts":[[2019,6,21]],"date-time":"2019-06-21T12:45:07Z","timestamp":1561121107000},"page":"887-900","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":5,"title":["Optimal Budget-Feasible Mechanisms for Additive Valuations"],"prefix":"10.1145","author":[{"given":"Nick","family":"Gravin","sequence":"first","affiliation":[{"name":"Shanghai University of Finance and Economics, Shanghai, China"}]},{"given":"Yaonan","family":"Jin","sequence":"additional","affiliation":[{"name":"Columbia University, Hong Kong, Hong Kong"}]},{"given":"Pinyan","family":"Lu","sequence":"additional","affiliation":[{"name":"Shanghai University of Finance and Economics, Shanghai, China"}]},{"given":"Chenhao","family":"Zhang","sequence":"additional","affiliation":[{"name":"Northwestern University, Chicago, IL, USA"}]}],"member":"320","published-online":{"date-parts":[[2019,6,17]]},"reference":[{"key":"e_1_3_2_2_1_1","volume-title":"Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2006","author":"Aggarwal Gagan","year":"2006","unstructured":"Gagan Aggarwal and Jason D. Hartline . 2006. Knapsack auctions . In Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2006 , Miami, Florida, USA, January 22--26 , 2006 . 1083--1092. http:\/\/dl.acm.org\/citation.cfm?id=1109557.1109677 Gagan Aggarwal and Jason D. Hartline. 2006. Knapsack auctions. In Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2006, Miami, Florida, USA, January 22--26, 2006. 1083--1092. http:\/\/dl.acm.org\/citation.cfm?id=1109557.1109677"},{"key":"e_1_3_2_2_2_1","volume-title":"WINE 2016, Montreal, Canada, December 11--14, 2016, Proceedings. 414--428","author":"Amanatidis Georgios","year":"2016","unstructured":"Georgios Amanatidis , Georgios Birmpas , and Evangelos Markakis . 2016 . Coverage, Matching, and Beyond: New Results on Budgeted Mechanism Design. In Web and Internet Economics - 12th International Conference , WINE 2016, Montreal, Canada, December 11--14, 2016, Proceedings. 414--428 . Georgios Amanatidis, Georgios Birmpas, and Evangelos Markakis. 2016. Coverage, Matching, and Beyond: New Results on Budgeted Mechanism Design. In Web and Internet Economics - 12th International Conference, WINE 2016, Montreal, Canada, December 11--14, 2016, Proceedings. 414--428."},{"key":"e_1_3_2_2_3_1","volume-title":"WINE 2017, Bangalore, India, December 17--20, 2017, Proceedings. 1--15","author":"Amanatidis Georgios","year":"2017","unstructured":"Georgios Amanatidis , Georgios Birmpas , and Evangelos Markakis . 2017 . On Budget-Feasible Mechanism Design for Symmetric Submodular Objectives. In Web and Internet Economics - 13th International Conference , WINE 2017, Bangalore, India, December 17--20, 2017, Proceedings. 1--15 . Georgios Amanatidis, Georgios Birmpas, and Evangelos Markakis. 2017. On Budget-Feasible Mechanism Design for Symmetric Submodular Objectives. In Web and Internet Economics - 13th International Conference, WINE 2017, Bangalore, India, December 17--20, 2017, Proceedings. 1--15."},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2014.36"},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.5555\/545381.545509"},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/2229012.2229026"},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/2872427.2883032"},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/2764468.2764505"},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1137\/16M1067275"},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2010.77"},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973082.54"},{"key":"e_1_3_2_2_12_1","volume-title":"Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2007","author":"Chen Ning","year":"2007","unstructured":"Ning Chen and Anna R. Karlin . 2007. Cheap labor can be expensive . In Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2007 , New Orleans, Louisiana, USA, January 7--9 , 2007 . 707--715. http:\/\/dl.acm.org\/citation.cfm?id=1283383.1283459 Ning Chen and Anna R. Karlin. 2007. Cheap labor can be expensive. In Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2007, New Orleans, Louisiana, USA, January 7--9, 2007. 707--715. http:\/\/dl.acm.org\/citation.cfm?id=1283383.1283459"},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/1993574.1993615"},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/1250910.1250959"},{"key":"e_1_3_2_2_15_1","volume-title":"Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2004","author":"Elkind Edith","year":"2004","unstructured":"Edith Elkind , Amit Sahai , and Kenneth Steiglitz . 2004 . Frugality in path auctions . In Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2004 , New Orleans, Louisiana, USA, January 11--14 , 2004. 701--709. http:\/\/dl.acm.org\/citation.cfm?id=982792.982900 Edith Elkind, Amit Sahai, and Kenneth Steiglitz. 2004. Frugality in path auctions. In Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2004, New Orleans, Louisiana, USA, January 11--14, 2004. 701--709. http:\/\/dl.acm.org\/citation.cfm?id=982792.982900"},{"key":"e_1_3_2_2_16_1","volume-title":"Proceedings of the Seconf AAAI Conference on Human Computation and Crowdsourcing, HCOMP 2014","author":"Goel Gagan","year":"2014","unstructured":"Gagan Goel , Afshin Nikzad , and Adish Singla . 2014 . Mechanism Design for Crowdsourcing Markets with Heterogeneous Tasks . In Proceedings of the Seconf AAAI Conference on Human Computation and Crowdsourcing, HCOMP 2014 , November 2 --4 , 2014, Pittsburgh, Pennsylvania, USA. http:\/\/www.aaai.org\/ocs\/index.php\/HCOMP\/HCOMP14\/paper\/view\/8968 Gagan Goel, Afshin Nikzad, and Adish Singla. 2014. Mechanism Design for Crowdsourcing Markets with Heterogeneous Tasks. In Proceedings of the Seconf AAAI Conference on Human Computation and Crowdsourcing, HCOMP 2014, November 2--4, 2014, Pittsburgh, Pennsylvania, USA. http:\/\/www.aaai.org\/ocs\/index.php\/HCOMP\/HCOMP14\/paper\/view\/8968"},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/3219166.3219229"},{"volume-title":"Budget Feasible Mechanisms for Experimental Design. In LATIN 2014: Theoretical Informatics - 11th Latin American Symposium, Montevideo, Uruguay, March 31 - April 4, 2014. Proceedings. 719--730","author":"Horel Thibaut","key":"e_1_3_2_2_18_1","unstructured":"Thibaut Horel , Stratis Ioannidis , and S. Muthukrishnan . 2014 . Budget Feasible Mechanisms for Experimental Design. In LATIN 2014: Theoretical Informatics - 11th Latin American Symposium, Montevideo, Uruguay, March 31 - April 4, 2014. Proceedings. 719--730 . Thibaut Horel, Stratis Ioannidis, and S. Muthukrishnan. 2014. Budget Feasible Mechanisms for Experimental Design. In LATIN 2014: Theoretical Informatics - 11th Latin American Symposium, Montevideo, Uruguay, March 31 - April 4, 2014. Proceedings. 719--730."},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2005.25"},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2010.76"},{"key":"e_1_3_2_2_21_1","volume-title":"WINE 2018, Oxford, UK, December 15--17, 2018, Proceedings. 246--263","author":"Khalilabadi Pooya Jalaly","year":"2018","unstructured":"Pooya Jalaly Khalilabadi and \u00c9 va Tardos. 2018 . Simple and Efficient Budget Feasible Mechanisms for Monotone Submodular Valuations. In Web and Internet Economics - 14th International Conference , WINE 2018, Oxford, UK, December 15--17, 2018, Proceedings. 246--263 . Pooya Jalaly Khalilabadi and \u00c9 va Tardos. 2018. Simple and Efficient Budget Feasible Mechanisms for Monotone Submodular Valuations. In Web and Internet Economics - 14th International Conference, WINE 2018, Oxford, UK, December 15--17, 2018, Proceedings. 246--263."},{"key":"e_1_3_2_2_22_1","volume-title":"IPCO 2017, Waterloo, ON, Canada, June 26--28, 2017, Proceedings. 368--379","author":"Leonardi Stefano","year":"2017","unstructured":"Stefano Leonardi , Gianpiero Monaco , Piotr Sankowski , and Qiang Zhang . 2017 . Budget Feasible Mechanisms on Matroids. In Integer Programming and Combinatorial Optimization - 19th International Conference , IPCO 2017, Waterloo, ON, Canada, June 26--28, 2017, Proceedings. 368--379 . Stefano Leonardi, Gianpiero Monaco, Piotr Sankowski, and Qiang Zhang. 2017. Budget Feasible Mechanisms on Matroids. In Integer Programming and Combinatorial Optimization - 19th International Conference, IPCO 2017, Waterloo, ON, Canada, June 26--28, 2017, Proceedings. 368--379."},{"key":"e_1_3_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.1287\/moor.6.1.58"},{"key":"e_1_3_2_2_24_1","volume-title":"Budget Feasible Mechanisms. In 51th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2010","author":"Singer Yaron","year":"2010","unstructured":"Yaron Singer . 2010 . Budget Feasible Mechanisms. In 51th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2010 , October 23 --26 , 2010, Las Vegas, Nevada, USA. 765--774. Yaron Singer. 2010. Budget Feasible Mechanisms. In 51th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2010, October 23--26, 2010, Las Vegas, Nevada, USA. 765--774."},{"key":"e_1_3_2_2_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/2124295.2124381"},{"key":"e_1_3_2_2_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/2488388.2488489"},{"key":"e_1_3_2_2_27_1","volume-title":"STACS","author":"Talwar Kunal","year":"2003","unstructured":"Kunal Talwar . 2003. The Price of Truth: Frugality in Truthful Mechanisms . In STACS 2003 , 20th Annual Symposium on Theoretical Aspects of Computer Science, Berlin, Germany, February 27 - March 1, 2003, Proceedings . 608--619. Kunal Talwar. 2003. The Price of Truth: Frugality in Truthful Mechanisms. In STACS 2003, 20th Annual Symposium on Theoretical Aspects of Computer Science, Berlin, Germany, February 27 - March 1, 2003, Proceedings. 608--619."}],"event":{"name":"EC '19: ACM Conference on Economics and Computation","sponsor":["SIGecom Special Interest Group on Economics and Computation"],"location":"Phoenix AZ USA","acronym":"EC '19"},"container-title":["Proceedings of the 2019 ACM Conference on Economics and Computation"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3328526.3329586","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3328526.3329586","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T23:53:41Z","timestamp":1750204421000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3328526.3329586"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,6,17]]},"references-count":27,"alternative-id":["10.1145\/3328526.3329586","10.1145\/3328526"],"URL":"https:\/\/doi.org\/10.1145\/3328526.3329586","relation":{},"subject":[],"published":{"date-parts":[[2019,6,17]]},"assertion":[{"value":"2019-06-17","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}