{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T07:40:27Z","timestamp":1725522027956},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540921844"},{"type":"electronic","value":"9783540921851"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"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":[[2008]]},"DOI":"10.1007\/978-3-540-92185-1_41","type":"book-chapter","created":{"date-parts":[[2008,12,10]],"date-time":"2008-12-10T16:44:33Z","timestamp":1228927473000},"page":"351-361","source":"Crossref","is-referenced-by-count":8,"title":["Inapproximability of Combinatorial Public Projects"],"prefix":"10.1007","author":[{"given":"Michael","family":"Schapira","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yaron","family":"Singer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1","key":"41_CR1","first-page":"137","volume":"58","author":"N. Alon","year":"1999","unstructured":"Alon, N., Matias, Y., Szegedy, M.: Jounal of computer and system sciences. The space complexity of approximating the frequency moment\u00a058(1), 137\u2013137 (1999)","journal-title":"The space complexity of approximating the frequency moment"},{"key":"41_CR2","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1145\/502034.502048","volume-title":"SOSP 2001: Proceedings of the eighteenth ACM symposium on Operating systems principles","author":"D. Andersen","year":"2001","unstructured":"Andersen, D., Balakrishnan, H., Kaashoek, F., Morris, R.: Resilient overlay networks. In: SOSP 2001: Proceedings of the eighteenth ACM symposium on Operating systems principles, pp. 131\u2013145. ACM, New York (2001)"},{"key":"41_CR3","unstructured":"Chun, B.-G., Fonseca, R., Stoica, I., Kubiatowicz, J.: Characterizing selfishly constructed overlay routing networks. In: INFOCOM (2004)"},{"key":"41_CR4","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/BF01726210","volume":"11","author":"E.H. Clarke","year":"1971","unstructured":"Clarke, E.H.: Multipart pricing of public goods. Public Choice\u00a011, 17\u201333 (1971)","journal-title":"Public Choice"},{"key":"41_CR5","doi-asserted-by":"crossref","unstructured":"Dobzinski, S., Nisan, N., Schapira, M.: Approximation algorithms for combinatorial auctions with complement-free bidders. In: STOC (2005)","DOI":"10.1145\/1060590.1060681"},{"key":"41_CR6","doi-asserted-by":"crossref","unstructured":"Dobzinski, S., Nisan, N.: Limitations of VCG-based mechanisms. In: STOC (2007)","DOI":"10.1145\/1250790.1250842"},{"key":"41_CR7","doi-asserted-by":"crossref","unstructured":"Dobzinski, S., Schapira, M.: An improved approximation algorithm for combinatorial auctions with submodular bidders. In: SODA 2006 (2006)","DOI":"10.1145\/1109557.1109675"},{"key":"41_CR8","doi-asserted-by":"crossref","unstructured":"Feige, U.: On maximizing welfare when the utility functions are subadditive. In: STOC 2006 (2006)","DOI":"10.1145\/1132516.1132523"},{"issue":"1","key":"41_CR9","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/s00446-005-0122-y","volume":"18","author":"J. Feigenbaum","year":"2005","unstructured":"Feigenbaum, J., Papadimitriou, C.H., Sami, R., Shenker, S.: A BGP-based mechanism for lowest-cost routing. Distributed Computing\u00a018(1), 61\u201372 (2005)","journal-title":"Distributed Computing"},{"key":"41_CR10","doi-asserted-by":"crossref","unstructured":"Feigenbaum, J., Sami, R., Shenker, S.: Mechanism design for policy routing. In: PODC, pp. 11\u201320 (2004)","DOI":"10.1145\/1011767.1011770"},{"key":"41_CR11","doi-asserted-by":"crossref","unstructured":"Groves, T.: Incentives in teams. Econometrica, 617\u2013631 (1973)","DOI":"10.2307\/1914085"},{"key":"41_CR12","doi-asserted-by":"publisher","DOI":"10.1016\/S0065-2458(08)60342-3","volume-title":"Communication Complexity","author":"E. Kushilevitz","year":"1997","unstructured":"Kushilevitz, E., Nisan, N.: Communication Complexity. Cambridge University Press, Cambridge (1997)"},{"key":"41_CR13","doi-asserted-by":"crossref","unstructured":"Lehmann, B., Lehmann, D., Nisan, N.: Combinatorial auctions with decreasing marginal utilities. In: ACM conference on electronic commerce (2001)","DOI":"10.1145\/501158.501161"},{"key":"41_CR14","doi-asserted-by":"crossref","unstructured":"Levin, H., Schapira, M., Zohar, A.: Interdomain routing and games. In: Proceedings of STOC 2008 (2008)","DOI":"10.1145\/1374376.1374388"},{"key":"41_CR15","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1007\/BFb0121195","volume":"8","author":"G.L. Nemhauser","year":"1978","unstructured":"Nemhauser, G.L., Wolsey, L.A., Fisher, M.L.: An analysis of approximations for maximizing submodular set functions ii. Math. Programming Study\u00a08, 73\u201387 (1978)","journal-title":"Math. Programming Study"},{"key":"41_CR16","series-title":"Lecture Notes in Computer Science","volume-title":"Automata, Languages and Programming","author":"N. Nisan","year":"2002","unstructured":"Nisan, N.: The communication complexity of approximate set packing and covering. In: Widmayer, P., Triguero, F., Morales, R., Hennessy, M., Eidenbenz, S., Conejo, R. (eds.) ICALP 2002. LNCS, vol.\u00a02380. Springer, Heidelberg (2002)"},{"key":"41_CR17","doi-asserted-by":"crossref","unstructured":"Nisan, N.: Bidding and allocation in combinatorial auctions. In: ACM Conference on Electronic Commerce (2000)","DOI":"10.1145\/352871.352872"},{"key":"41_CR18","doi-asserted-by":"crossref","unstructured":"Papadimitriou, C.H., Schaira, M., Singer, Y.: On the hardness of being truthful. In: FOCS (2008)","DOI":"10.1109\/FOCS.2008.54"},{"key":"41_CR19","doi-asserted-by":"crossref","unstructured":"Vickrey, W.: Counterspeculation, auctions and competitive sealed tenders. Journal of Finance, 8\u201337 (1961)","DOI":"10.1111\/j.1540-6261.1961.tb02789.x"},{"key":"41_CR20","doi-asserted-by":"crossref","unstructured":"Yao, A.C.-C.: Some complexity questions related to distributive computing. In: ACM Symposium on Theory of Computing (STOC), pp. 209\u2013213 (1979)","DOI":"10.1145\/800135.804414"}],"container-title":["Lecture Notes in Computer Science","Internet and Network Economics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-92185-1_41","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,16]],"date-time":"2019-05-16T04:21:29Z","timestamp":1557980489000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-92185-1_41"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540921844","9783540921851"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-92185-1_41","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}