{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,7]],"date-time":"2025-10-07T14:31:53Z","timestamp":1759847513996},"publisher-location":"Berlin, Heidelberg","reference-count":30,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642544224"},{"type":"electronic","value":"9783642544231"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-642-54423-1_62","type":"book-chapter","created":{"date-parts":[[2014,3,25]],"date-time":"2014-03-25T03:02:27Z","timestamp":1395716547000},"page":"719-730","source":"Crossref","is-referenced-by-count":14,"title":["Budget Feasible Mechanisms for Experimental Design"],"prefix":"10.1007","author":[{"given":"Thibaut","family":"Horel","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stratis","family":"Ioannidis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S.","family":"Muthukrishnan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"3","key":"62_CR1","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1023\/B:JOCO.0000038913.96607.c2","volume":"8","author":"A.A. Ageev","year":"2004","unstructured":"Ageev, A.A., Sviridenko, M.: Pipage rounding: A new method of constructing algorithms with proven performance guarantee. J. Comb. Optim.\u00a08(3), 307\u2013328 (2004)","journal-title":"J. Comb. Optim."},{"issue":"2","key":"62_CR2","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1080\/15427951.2004.10129086","volume":"1","author":"A. Archer","year":"2004","unstructured":"Archer, A., Papadimitriou, C., Talwar, K., Tardos, E.: An approximate truthful mechanism for combinatorial auctions with single parameter agents. Internet Mathematics\u00a01(2), 129\u2013150 (2004)","journal-title":"Internet Mathematics"},{"key":"62_CR3","doi-asserted-by":"crossref","DOI":"10.1093\/oso\/9780199296590.001.0001","volume-title":"Optimum experimental designs, with SAS","author":"A. Atkinson","year":"2007","unstructured":"Atkinson, A., Donev, A., Tobias, R.: Optimum experimental designs, with SAS. Oxford University Press, Oxford (2007)"},{"key":"62_CR4","doi-asserted-by":"crossref","unstructured":"Badanidiyuru, A., Kleinberg, R., Singer, Y.: Learning on a budget: posted price mechanisms for online procurement. In: EC (2012)","DOI":"10.1145\/2229012.2229026"},{"key":"62_CR5","doi-asserted-by":"crossref","unstructured":"Bei, X., Chen, N., Gravin, N., Lu, P.: Budget feasible mechanism design: from prior-free to bayesian. In: STOC (2012)","DOI":"10.1145\/2213977.2214020"},{"key":"62_CR6","doi-asserted-by":"crossref","unstructured":"Boyd, S., Vandenberghe, L.: Convex Optimization. Cambridge University Press (2004)","DOI":"10.1017\/CBO9780511804441"},{"key":"62_CR7","doi-asserted-by":"crossref","unstructured":"Briest, P., Krysta, P., V\u00f6cking, B.: Approximation techniques for utilitarian mechanism design. In: ACM STOC (2005)","DOI":"10.1145\/1060590.1060597"},{"key":"62_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1007\/978-3-540-72792-7_15","volume-title":"Integer Programming and Combinatorial Optimization","author":"G. Calinescu","year":"2007","unstructured":"Calinescu, G., Chekuri, C., P\u00e1l, M., Vondr\u00e1k, J.: Maximizing a submodular set function subject to a matroid constraint (Extended abstract). In: Fischetti, M., Williamson, D.P. (eds.) IPCO 2007. LNCS, vol.\u00a04513, pp. 182\u2013196. Springer, Heidelberg (2007)"},{"key":"62_CR9","doi-asserted-by":"crossref","unstructured":"Chaloner, K., Verdinelli, I.: Bayesian experimental design: A review. Statistical Science, 273\u2013304 (1995)","DOI":"10.1214\/ss\/1177009939"},{"key":"62_CR10","doi-asserted-by":"crossref","unstructured":"Chen, N., Gravin, N., Lu, P.: On the approximability of budget feasible mechanisms. In: SODA (2011)","DOI":"10.1137\/1.9781611973082.54"},{"key":"62_CR11","doi-asserted-by":"crossref","unstructured":"Dobzinski, S., Papadimitriou, C.H., Singer, Y.: Mechanisms for complement-free procurement. In: ACM EC (2011)","DOI":"10.1145\/1993574.1993615"},{"key":"62_CR12","doi-asserted-by":"crossref","unstructured":"Dughmi, S.: A truthful randomized mechanism for combinatorial public projects via convex optimization. In: EC (2011)","DOI":"10.1145\/1993574.1993614"},{"key":"62_CR13","doi-asserted-by":"crossref","unstructured":"Dughmi, S., Roughgarden, T., Yan, Q.: From convex optimization to randomized mechanisms: toward optimal combinatorial auctions. In: STOC (2011)","DOI":"10.1145\/1993636.1993657"},{"key":"62_CR14","doi-asserted-by":"crossref","unstructured":"Friedman, J., Hastie, T., Tibshirani, R.: The elements of statistical learning. Springer Series in Statistics, vol.\u00a01 (2001)","DOI":"10.1007\/978-0-387-21606-5_1"},{"issue":"1","key":"62_CR15","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1214\/07-BA207","volume":"2","author":"J. Ginebra","year":"2007","unstructured":"Ginebra, J.: On the measure of the information in a statistical experiment. Bayesian Analysis\u00a02(1), 167\u2013211 (2007)","journal-title":"Bayesian Analysis"},{"key":"62_CR16","unstructured":"Horel, T., Ioannidis, S., Muthukrishnan, S.: Budget feasible mechanisms for experimental design (2013), http:\/\/arxiv.org\/abs\/1302.5724"},{"key":"62_CR17","unstructured":"Kearns, M., Pai, M.M., Roth, A., Ullman, J.: Private equilibrium release, large games, and no-regret learning (2012), http:\/\/arxiv.org\/abs\/1207.4084v1"},{"key":"62_CR18","unstructured":"Krause, A., Guestrin, C.: A note on the budgeted maximization of submodular functions. Tech. Rep. CMU-CALD-05-103, CMU (2005)"},{"issue":"6","key":"62_CR19","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1145\/2049697.2049699","volume":"58","author":"R. Lavi","year":"2011","unstructured":"Lavi, R., Swamy, C.: Truthful and near-optimal mechanism design via linear programming. Journal of the ACM\u00a058(6), 25 (2011)","journal-title":"Journal of the ACM"},{"key":"62_CR20","doi-asserted-by":"crossref","unstructured":"Le Cam, L.: Comparison of experiments: a short review. Lecture Notes-Monograph Series, pp. 127\u2013138 (1996)","DOI":"10.1214\/lnms\/1215453569"},{"key":"62_CR21","doi-asserted-by":"crossref","unstructured":"McSherry, F., Talwar, K.: Mechanism design via differential privacy. In: FOCS (2007)","DOI":"10.1109\/FOCS.2007.66"},{"issue":"1","key":"62_CR22","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1287\/moor.6.1.58","volume":"6","author":"R. Myerson","year":"1981","unstructured":"Myerson, R.: Optimal auction design. Mathematics of Operations Research\u00a06(1), 58\u201373 (1981)","journal-title":"Mathematics of Operations Research"},{"key":"62_CR23","doi-asserted-by":"crossref","unstructured":"Nissim, K., Smorodinsky, R., Tennenholtz, M.: Approximately optimal mechanism design via differential privacy. In: ITCS (2012)","DOI":"10.2139\/ssrn.2017224"},{"key":"62_CR24","doi-asserted-by":"crossref","unstructured":"Pai, M., Roth, A.: Privacy and mechanism design. SIGecom Exchanges (2013)","DOI":"10.1145\/2509013.2509016"},{"key":"62_CR25","doi-asserted-by":"crossref","unstructured":"Pukelsheim, F.: Optimal design of experiments. Society for Industrial Mathematics, vol.\u00a050 (2006)","DOI":"10.1137\/1.9780898719109"},{"key":"62_CR26","doi-asserted-by":"crossref","unstructured":"Singer, Y.: Budget feasible mechanisms. In: FOCS (2010)","DOI":"10.1109\/FOCS.2010.78"},{"key":"62_CR27","doi-asserted-by":"crossref","unstructured":"Singer, Y.: How to win friends and influence people, truthfully: influence maximization mechanisms for social networks. In: WSDM (2012)","DOI":"10.1145\/2124295.2124381"},{"issue":"1","key":"62_CR28","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.\u00a032(1), 41\u201343 (2004)","journal-title":"Oper. Res. Lett."},{"issue":"2","key":"62_CR29","doi-asserted-by":"publisher","first-page":"499","DOI":"10.1137\/S0895479896303430","volume":"19","author":"L. Vandenberghe","year":"1998","unstructured":"Vandenberghe, L., Boyd, S., Wu, S.: Determinant maximization with linear matrix inequality constraints. SIAM Journal on Matrix Analysis and Applications\u00a019(2), 499\u2013533 (1998)","journal-title":"SIAM Journal on Matrix Analysis and Applications"},{"key":"62_CR30","doi-asserted-by":"crossref","unstructured":"Vondrak, J.: Optimal approximation for the submodular welfare problem in the value oracle model. In: ACM STOC (2008)","DOI":"10.1145\/1374376.1374389"}],"container-title":["Lecture Notes in Computer Science","LATIN 2014: Theoretical Informatics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-54423-1_62","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,25]],"date-time":"2024-05-25T09:31:54Z","timestamp":1716629514000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-54423-1_62"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783642544224","9783642544231"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-54423-1_62","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}