{"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":1778496642105,"version":"3.51.4"},"publisher-location":"New York, NY, USA","reference-count":39,"publisher":"ACM","license":[{"start":{"date-parts":[[2012,5,19]],"date-time":"2012-05-19T00:00:00Z","timestamp":1337385600000},"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":[[2012,5,19]]},"DOI":"10.1145\/2213977.2214020","type":"proceedings-article","created":{"date-parts":[[2012,5,21]],"date-time":"2012-05-21T15:20:35Z","timestamp":1337613635000},"page":"449-458","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":41,"title":["Budget feasible mechanism design"],"prefix":"10.1145","author":[{"given":"Xiaohui","family":"Bei","sequence":"first","affiliation":[{"name":"Tsinghua University, Beijing, China"}]},{"given":"Ning","family":"Chen","sequence":"additional","affiliation":[{"name":"Nanyang Technological University, Singapore, Singapore"}]},{"given":"Nick","family":"Gravin","sequence":"additional","affiliation":[{"name":"Nanyang Technological University, Singapore, Singapore"}]},{"given":"Pinyan","family":"Lu","sequence":"additional","affiliation":[{"name":"Microsoft Research Asia, Beijing, China"}]}],"member":"320","published-online":{"date-parts":[[2012,5,19]]},"reference":[{"key":"e_1_3_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.5555\/1109557.1109677"},{"key":"e_1_3_2_2_2_1","volume-title":"SODA","author":"Dinitz M.","year":"2009","unstructured":"Babaioff, M. Dinitz , A. Gupta , N. Immorlica , K. Talwar : Secretary Problems: Weights and Discounts , SODA 2009 , 1245--1254. Babaioff, M. Dinitz, A. Gupta, N. Immorlica, K. Talwar: Secretary Problems: Weights and Discounts, SODA 2009, 1245--1254."},{"key":"e_1_3_2_2_3_1","volume-title":"SODA","author":"Immorlica N.","year":"2007","unstructured":"Babaioff, N. Immorlica , R. Kleinberg , Matroids, Secretary Problems , and Online Mechanisms , SODA 2007 , 434--443. Babaioff, N. Immorlica, R. Kleinberg, Matroids, Secretary Problems, and Online Mechanisms, SODA 2007, 434--443."},{"key":"e_1_3_2_2_4_1","unstructured":"Badanidiyuru S. Dobzinski S. Oren Optimization with Demand Oracles arXiv.org\/abs\/1107.2869.  Badanidiyuru S. Dobzinski S. Oren Optimization with Demand Oracles arXiv.org\/abs\/1107.2869."},{"key":"e_1_3_2_2_5_1","volume-title":"SODA","author":"Huang Z.","year":"2011","unstructured":". Bei, Z. Huang , Bayesian Incentive Compatibility via Fractional Assignments , SODA 2011 , 720--733. . Bei, Z. Huang, Bayesian Incentive Compatibility via Fractional Assignments, SODA 2011, 720--733."},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-009-0307-4"},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/1806689.1806743"},{"key":"e_1_3_2_2_8_1","volume-title":"SODA","author":"Roughgarden T.","year":"2011","unstructured":"Bhawalkar, T. Roughgarden , Welfare Guarantees for Combinatorial Auctions with Item Bidding , SODA 2011 , 700--709. Bhawalkar, T. Roughgarden, Welfare Guarantees for Combinatorial Auctions with Item Bidding, SODA 2011, 700--709."},{"key":"e_1_3_2_2_9_1","first-page":"119","volume":"10","author":"Linear Some Applications","year":"1963","unstructured":"Bondareva, Some Applications of Linear Programming to Cooperative Games , Problemy Kibernetiki, V . 10 , 119 -- 139 , 1963 . Bondareva, Some Applications of Linear Programming to Cooperative Games, Problemy Kibernetiki, V.10, 119--139, 1963.","journal-title":"Problemy Kibernetiki, V"},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1214\/aop\/1055425791"},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/1806689.1806733"},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/1993574.1993613"},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/1807342.1807366"},{"key":"e_1_3_2_2_14_1","volume-title":"SODA","author":"Gravin N.","year":"2011","unstructured":"Chen, N. Gravin , P. Lu , On the Approximability of Budget Feasible Mechanisms , SODA 2011 , 685--699. Chen, N. Gravin, P. Lu, On the Approximability of Budget Feasible Mechanisms, SODA 2011, 685--699."},{"key":"e_1_3_2_2_15_1","unstructured":"Chen N. Gravin P. Lu Mechanism Design without Money via Stable Matching arxiv.org\/abs\/1104.2872.  Chen N. Gravin P. Lu Mechanism Design without Money via Stable Matching arxiv.org\/abs\/1104.2872."},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01726210"},{"key":"e_1_3_2_2_17_1","unstructured":"Devanur J. Hartline A. Karlin T. Nguyen A Prior-Independent Mechanism for Profit Maximization in Unit-demand Combinatorial Auctions WINE 201  Devanur J. Hartline A. Karlin T. Nguyen A Prior-Independent Mechanism for Profit Maximization in Unit-demand Combinatorial Auctions WINE 201"},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/1807342.1807364"},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-74208-1_7"},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/1993574.1993615"},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1137\/070680977"},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/1993574.1993605"},{"key":"e_1_3_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.geb.2006.02.003"},{"key":"e_1_3_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.2307\/1914085"},{"key":"e_1_3_2_2_25_1","volume-title":"SODA","author":"Kleinberg R.","year":"2011","unstructured":". Hartline, R. Kleinberg , A. Malekian , Bayesian Incentive Compatibility via Matchings , SODA 2011 , 734--747. . Hartline, R. Kleinberg, A. Malekian, Bayesian Incentive Compatibility via Matchings, SODA 2011, 734--747."},{"key":"e_1_3_2_2_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/1806689.1806732"},{"key":"e_1_3_2_2_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/1374376.1374390"},{"key":"e_1_3_2_2_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/1566374.1566407"},{"key":"e_1_3_2_2_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/501158.501161"},{"key":"e_1_3_2_2_30_1","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511813825","volume-title":"Putting Auction Theory to Work","author":"Milgrom","year":"2004","unstructured":"Milgrom , Putting Auction Theory to Work , Cambridge University Press , 2004 . Milgrom, Putting Auction Theory to Work, Cambridge University Press, 2004."},{"key":"e_1_3_2_2_31_1","volume-title":"Mathematics of Operations Research, V.6(1)","author":"Myerson","year":"1981","unstructured":"Myerson , Optimal Auction Design , Mathematics of Operations Research, V.6(1) , 1981 . Myerson, Optimal Auction Design, Mathematics of Operations Research, V.6(1), 1981."},{"key":"e_1_3_2_2_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/301250.301287"},{"key":"e_1_3_2_2_33_1","volume-title":"Algorithmic Game Theory","author":"Roughgarden T.","year":"2007","unstructured":"Nisan, T. Roughgarden , E. Tardos , V. Vazirani , Algorithmic Game Theory , Cambridge University Press , 2007 . Nisan, T. Roughgarden, E. Tardos, V. Vazirani, Algorithmic Game Theory, Cambridge University Press, 2007."},{"key":"e_1_3_2_2_34_1","doi-asserted-by":"publisher","DOI":"10.1002\/nav.3800140404"},{"key":"e_1_3_2_2_35_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2010.78"},{"key":"e_1_3_2_2_36_1","volume-title":"A Course in Probability and Statistics","author":"Stone","year":"1995","unstructured":"Stone , A Course in Probability and Statistics , Duxbury Press , 1995 . Stone, A Course in Probability and Statistics, Duxbury Press, 1995."},{"key":"e_1_3_2_2_37_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-6377(03)00062-2"},{"key":"e_1_3_2_2_38_1","doi-asserted-by":"publisher","DOI":"10.1111\/j.1540-6261.1961.tb02789.x"},{"key":"e_1_3_2_2_39_1","unstructured":"Vondrak A Note on Concentration of Submodular Functions arxiv.org\/abs\/1005.2791.  Vondrak A Note on Concentration of Submodular Functions arxiv.org\/abs\/1005.2791."}],"event":{"name":"STOC'12: Symposium on Theory of Computing","location":"New York New York USA","acronym":"STOC'12","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the forty-fourth annual ACM symposium on Theory of computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2213977.2214020","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2213977.2214020","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T09:20:54Z","timestamp":1750238454000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2213977.2214020"}},"subtitle":["from prior-free to bayesian"],"short-title":[],"issued":{"date-parts":[[2012,5,19]]},"references-count":39,"alternative-id":["10.1145\/2213977.2214020","10.1145\/2213977"],"URL":"https:\/\/doi.org\/10.1145\/2213977.2214020","relation":{},"subject":[],"published":{"date-parts":[[2012,5,19]]},"assertion":[{"value":"2012-05-19","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}