{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T02:23:01Z","timestamp":1743128581566,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642450457"},{"type":"electronic","value":"9783642450464"}],"license":[{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-45046-4_28","type":"book-chapter","created":{"date-parts":[[2013,12,9]],"date-time":"2013-12-09T12:53:01Z","timestamp":1386593581000},"page":"347-360","source":"Crossref","is-referenced-by-count":3,"title":["Equilibrium in Combinatorial Public Projects"],"prefix":"10.1007","author":[{"given":"Brendan","family":"Lucier","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yaron","family":"Singer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vasilis","family":"Syrgkanis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"\u00c9va","family":"Tardos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"28_CR1","doi-asserted-by":"crossref","unstructured":"Bhawalkar, K., Roughgarden, T.: Welfare Guarantees for Combinatorial Auctions with Item Bidding. In: SODA 2011 (2011)","DOI":"10.1137\/1.9781611973082.55"},{"key":"28_CR2","doi-asserted-by":"crossref","unstructured":"Blum, A., Mansour, Y.: Learning, regret minimization, and equilibria. In: Nisan, N., Roughgarden, T., Tardos, E., Vazirani, V. (eds.) Algorithmic Game Theory, ch.\u00a04, pp. 4\u201330. Cambridge University Press (2007)","DOI":"10.1017\/CBO9780511800481.006"},{"key":"28_CR3","doi-asserted-by":"crossref","unstructured":"Buchfuhrer, D., Schapira, M., Singer, Y.: Computation and incentives in combinatorial public projects. In: ACM Conference on Electronic Commerce, pp. 33\u201342 (2010)","DOI":"10.1145\/1807342.1807348"},{"key":"28_CR4","doi-asserted-by":"crossref","unstructured":"Caragiannis, I., Kaklamanis, C., Kanellopoulos, P., Kyropoulou, M.: On the Efficiency of Equilibria in Generalized Second Price Auctions. In: EC (2011)","DOI":"10.1145\/1993574.1993588"},{"key":"28_CR5","first-page":"311","volume-title":"Proceedings of the 42nd ACM Symposium on Theory of Computing, STOC 2010","author":"S. Chawla","year":"2010","unstructured":"Chawla, S., Hartline, J.D., Malec, D.L., Sivan, B.: Multi-parameter mechanism design and sequential posted pricing. In: Proceedings of the 42nd ACM Symposium on Theory of Computing, STOC 2010, pp. 311\u2013320. ACM, New York (2010)"},{"key":"28_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"820","DOI":"10.1007\/978-3-540-70575-8_67","volume-title":"Automata, Languages and Programming","author":"G. Christodoulou","year":"2008","unstructured":"Christodoulou, G., Kov\u00e1cs, A., Schapira, M.: Bayesian combinatorial auctions. In: Aceto, L., Damg\u00e5rd, I., Goldberg, L.A., Halld\u00f3rsson, M.M., Ing\u00f3lfsd\u00f3ttir, A., Walukiewicz, I. (eds.) ICALP 2008, Part I. LNCS, vol.\u00a05125, pp. 820\u2013832. Springer, Heidelberg (2008)"},{"key":"28_CR7","doi-asserted-by":"crossref","unstructured":"Dobzinski, S.: An impossibility result for truthful combinatorial auctions with submodular valuations. In: STOC, pp. 139\u2013148 (2011)","DOI":"10.1145\/1993636.1993656"},{"key":"28_CR8","doi-asserted-by":"crossref","unstructured":"Dughmi, S.: A truthful randomized mechanism for combinatorial public projects via convex optimization. In: ACM Conference on Electronic Commerce, pp. 263\u2013272 (2011)","DOI":"10.1145\/1993574.1993614"},{"key":"28_CR9","doi-asserted-by":"crossref","unstructured":"Feige, U.: On maximizing welfare when utility functions are subadditive. In: STOC (2006)","DOI":"10.1145\/1132516.1132523"},{"key":"28_CR10","doi-asserted-by":"crossref","unstructured":"Feldman, M., Fu, H., Gravin, N., Lucier, B.: Simultaneous auctions are (almost) efficient. In: STOC (2013)","DOI":"10.1145\/2488608.2488634"},{"key":"28_CR11","unstructured":"Fudenberg, D., Tirole, J.: Game Theory. MIT Press (1991)"},{"key":"28_CR12","doi-asserted-by":"crossref","unstructured":"Gupta, A., Ligett, K., McSherry, F., Roth, A., Talwar, K.: Differentially private combinatorial optimization. In: SODA, pp. 1106\u20131125 (2010)","DOI":"10.1137\/1.9781611973075.90"},{"key":"28_CR13","first-page":"295","volume-title":"EC 2011","author":"A. Hassidim","year":"2011","unstructured":"Hassidim, A., Kaplan, H., Mansour, Y., Nisan, N.: Non-price equilibria in markets of discrete goods. In: EC 2011, p. 295. ACM Press, New York (2011)"},{"key":"28_CR14","doi-asserted-by":"crossref","unstructured":"Huang, Z., Kannan, S.: The exponential mechanism for social welfare: Private, truthful, and nearly optimal. In: FOCS, pp. 140\u2013149 (2012)","DOI":"10.1109\/FOCS.2012.36"},{"key":"28_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"404","DOI":"10.1007\/3-540-49116-3_38","volume-title":"STACS 99","author":"E. Koutsoupias","year":"1999","unstructured":"Koutsoupias, E., Papadimitriou, C.: Worst-case equilibria. In: Meinel, C., Tison, S. (eds.) STACS 1999. LNCS, vol.\u00a01563, pp. 404\u2013413. Springer, Heidelberg (1999)"},{"key":"28_CR16","doi-asserted-by":"crossref","unstructured":"Lucier, B., Borodin, A.: Price of anarchy for greedy auctions. In: SODA 2010, p. 20 (2010)","DOI":"10.1137\/1.9781611973075.46"},{"key":"28_CR17","doi-asserted-by":"crossref","unstructured":"Lucier, B., Leme, R.: GSP auctions with correlated types. In: EC 2011 (2011)","DOI":"10.1145\/1993574.1993587"},{"key":"28_CR18","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":"28_CR19","doi-asserted-by":"crossref","unstructured":"Paes Leme, R., Syrgkanis, V., Tardos, E.: The curse of simultaneity. In: ITCS (2012)","DOI":"10.1145\/2090236.2090242"},{"key":"28_CR20","doi-asserted-by":"crossref","unstructured":"Paes Leme, R., Tardos, E.: Pure and Bayes-Nash price of anarchy for generalized second price auction. In: FOCS (2010)","DOI":"10.1109\/FOCS.2010.75"},{"key":"28_CR21","doi-asserted-by":"crossref","unstructured":"Papadimitriou, C.H., Schapira, M., Singer, Y.: On the hardness of being truthful. In: FOCS, pp. 250\u2013259 (2008)","DOI":"10.1109\/FOCS.2008.54"},{"key":"28_CR22","doi-asserted-by":"crossref","unstructured":"Roughgarden, T.: Intrinsic robustness of the price of anarchy. In: STOC 2009 (2009)","DOI":"10.1145\/1536414.1536485"},{"key":"28_CR23","doi-asserted-by":"crossref","unstructured":"Roughgarden, T.: The price of anarchy in games of incomplete information. In: Proceedings of the 13th ACM Conference on Electronic Commerce, EC 2012, pp. 862\u2013879. ACM, New York (2012)","DOI":"10.1145\/2229012.2229078"},{"key":"28_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1007\/978-3-540-92185-1_41","volume-title":"Internet and Network Economics","author":"M. Schapira","year":"2008","unstructured":"Schapira, M., Singer, Y.: Inapproximability of combinatorial public projects. In: Papadimitriou, C., Zhang, S. (eds.) WINE 2008. LNCS, vol.\u00a05385, pp. 351\u2013361. Springer, Heidelberg (2008)"},{"key":"28_CR25","unstructured":"Syrgkanis, V.: Bayesian games and the smoothness framework. CoRR, abs\/1203.5155 (2012)"},{"key":"28_CR26","doi-asserted-by":"crossref","unstructured":"Syrgkanis, V., Tardos, E.: Composable and efficient mechanisms. In: STOC (2013)","DOI":"10.1145\/2488608.2488635"}],"container-title":["Lecture Notes in Computer Science","Web and Internet Economics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-45046-4_28","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,14]],"date-time":"2023-02-14T09:19:28Z","timestamp":1676366368000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-642-45046-4_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642450457","9783642450464"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-45046-4_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}