{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,2]],"date-time":"2025-07-02T19:10:48Z","timestamp":1751483448411},"publisher-location":"Cham","reference-count":18,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319592497"},{"type":"electronic","value":"9783319592503"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-59250-3_30","type":"book-chapter","created":{"date-parts":[[2017,5,23]],"date-time":"2017-05-23T13:04:39Z","timestamp":1495544679000},"page":"368-379","source":"Crossref","is-referenced-by-count":8,"title":["Budget Feasible Mechanisms on Matroids"],"prefix":"10.1007","author":[{"given":"Stefano","family":"Leonardi","sequence":"first","affiliation":[]},{"given":"Gianpiero","family":"Monaco","sequence":"additional","affiliation":[]},{"given":"Piotr","family":"Sankowski","sequence":"additional","affiliation":[]},{"given":"Qiang","family":"Zhang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,5,24]]},"reference":[{"key":"30_CR1","doi-asserted-by":"crossref","unstructured":"Anari, N., Goel, G., Nikzad, A.: Mechanism design for crowdsourcing: an optimal 1-1\/e competitive budget-feasible mechanism for large markets. In: 55th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pp. 266\u2013275. IEEE (2014)","DOI":"10.1109\/FOCS.2014.36"},{"key":"30_CR2","doi-asserted-by":"crossref","first-page":"1452","DOI":"10.1257\/0002828043052330","volume":"94","author":"LM Ausubel","year":"2004","unstructured":"Ausubel, L.M.: An efficient ascending-bid auction for multiple objects. Am. Econ. Rev. 94, 1452\u20131475 (2004)","journal-title":"Am. Econ. Rev."},{"key":"30_CR3","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 (STOC), pp. 449\u2013458. ACM (2012)","DOI":"10.1145\/2213977.2214020"},{"issue":"2","key":"30_CR4","doi-asserted-by":"crossref","first-page":"400","DOI":"10.1287\/opre.1100.0888","volume":"59","author":"S Bikhchandani","year":"2011","unstructured":"Bikhchandani, S., de Vries, S., Schummer, J., Vohra, R.V.: An ascending vickrey auction for selling bases of a matroid. Oper. Res. 59(2), 400\u2013413 (2011)","journal-title":"Oper. Res."},{"key":"30_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1007\/978-3-319-13129-0_7","volume-title":"Web and Internet Economics","author":"H Chan","year":"2014","unstructured":"Chan, H., Chen, J.: Truthful multi-unit procurements with budgets. In: Liu, T.-Y., Qi, Q., Ye, Y. (eds.) WINE 2014. LNCS, vol. 8877, pp. 89\u2013105. Springer, Cham (2014). doi:\n10.1007\/978-3-319-13129-0_7"},{"key":"30_CR6","doi-asserted-by":"crossref","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 (SODA), pp. 685\u2013699. SIAM (2011)","DOI":"10.1137\/1.9781611973082.54"},{"issue":"1","key":"30_CR7","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1007\/BF01726210","volume":"11","author":"EH Clarke","year":"1971","unstructured":"Clarke, E.H.: Multipart pricing of public goods. Public choice 11(1), 17\u201333 (1971)","journal-title":"Public choice"},{"key":"30_CR8","doi-asserted-by":"crossref","first-page":"863","DOI":"10.1086\/261411","volume":"94","author":"G Demange","year":"1986","unstructured":"Demange, G., Gale, D., Sotomayor, M.: Multi-item auctions. J. Polit. Econ. 94, 863\u2013872 (1986)","journal-title":"J. Polit. Econ."},{"issue":"3","key":"30_CR9","doi-asserted-by":"crossref","first-page":"18","DOI":"10.1145\/2757277","volume":"62","author":"G Goel","year":"2015","unstructured":"Goel, G., Mirrokni, V., Leme, R.P.: Polyhedral clinching auctions and the adwords polytope. J. ACM (JACM) 62(3), 18 (2015)","journal-title":"J. ACM (JACM)"},{"key":"30_CR10","doi-asserted-by":"crossref","unstructured":"Goel, G., Nikzad, A., Singla, A.: Allocating tasks to workers with matching constraints: truthful mechanisms for crowdsourcing markets. In: Proceedings of the Companion Publication of the 23rd International Conference on World Wide Web Companion, pp. 279\u2013280 (2014)","DOI":"10.1145\/2567948.2577311"},{"key":"30_CR11","doi-asserted-by":"crossref","first-page":"617","DOI":"10.2307\/1914085","volume":"41","author":"T Groves","year":"1973","unstructured":"Groves, T.: Incentives in teams. Econometrica: J. Econometric Soc. 41, 617\u2013631 (1973)","journal-title":"Econometrica: J. Econometric Soc."},{"key":"30_CR12","doi-asserted-by":"crossref","unstructured":"Karlin, A.R., Kempe, D.: Beyond VCG: frugality of truthful mechanisms. In: 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pp. 615\u2013624. IEEE (2005)","DOI":"10.1109\/SFCS.2005.25"},{"key":"30_CR13","doi-asserted-by":"crossref","unstructured":"Kleinberg, R., Weinberg, S.M.: Matroid prophet inequalities. In: Proceedings of the Forty-Fourth Annual ACM Symposium on Theory of Computing, pp. 123\u2013136. ACM (2012)","DOI":"10.1145\/2213977.2213991"},{"key":"30_CR14","unstructured":"Krysta, P., Zhang, J.: House markets with matroid and knapsack constraints. In: Proceedings of The 43rd International Colloquium on Automata, Languages and Programming (ICALP) (2016)"},{"key":"30_CR15","series-title":"Algorithms and Combinatorics","volume-title":"Combinatorial Optimization","author":"A Schrijver","year":"2003","unstructured":"Schrijver, A.: Combinatorial Optimization. Algorithms and Combinatorics, vol. 24. Springer, Berlin (2003)"},{"key":"30_CR16","doi-asserted-by":"crossref","unstructured":"Singer, Y.: Budget feasible mechanisms. In: 51st Annual IEEE Symposium on Foundations of Computer Science (FOCS), pp. 765\u2013774 (2010)","DOI":"10.1109\/FOCS.2010.78"},{"issue":"7","key":"30_CR17","doi-asserted-by":"crossref","first-page":"2796","DOI":"10.1109\/18.737513","volume":"44","author":"DNC Tse","year":"1998","unstructured":"Tse, D.N.C., Hanly, S.V.: Multiaccess fading channels. I. Polymatroid structure, optimal resource allocation and throughput capacities. IEEE Trans. Inf. Theor. 44(7), 2796\u20132815 (1998)","journal-title":"IEEE Trans. Inf. Theor."},{"issue":"1","key":"30_CR18","doi-asserted-by":"crossref","first-page":"8","DOI":"10.1111\/j.1540-6261.1961.tb02789.x","volume":"16","author":"W Vickrey","year":"1961","unstructured":"Vickrey, W.: Counterspeculation, auctions, and competitive sealed tenders. J. Financ. 16(1), 8\u201337 (1961)","journal-title":"J. Financ."}],"container-title":["Lecture Notes in Computer Science","Integer Programming and Combinatorial Optimization"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-59250-3_30","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,5,23]],"date-time":"2017-05-23T13:13:04Z","timestamp":1495545184000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-59250-3_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319592497","9783319592503"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-59250-3_30","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}