{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,15]],"date-time":"2024-09-15T14:08:10Z","timestamp":1726409290154},"publisher-location":"Cham","reference-count":22,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319411675"},{"type":"electronic","value":"9783319411682"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"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":[[2016]]},"DOI":"10.1007\/978-3-319-41168-2_1","type":"book-chapter","created":{"date-parts":[[2016,7,3]],"date-time":"2016-07-03T21:26:28Z","timestamp":1467581188000},"page":"1-13","source":"Crossref","is-referenced-by-count":0,"title":["Item Pricing for Combinatorial Public Projects"],"prefix":"10.1007","author":[{"given":"Evangelos","family":"Markakis","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Orestis","family":"Telelis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,7,5]]},"reference":[{"issue":"2","key":"1_CR1","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1016\/j.geb.2008.03.005","volume":"65","author":"N Andelman","year":"2009","unstructured":"Andelman, N., Feldman, M., Mansour, Y.: Strong price of anarchy. Games Econ. Behav. 65(2), 289\u2013317 (2009)","journal-title":"Games Econ. Behav."},{"key":"1_CR2","doi-asserted-by":"crossref","unstructured":"Aumann, R.: Acceptable points in general cooperative $$n$$ n -person games. In: Tucker, A.W., Luce, R.D. (eds.) Contributions to the Theory of Games, vol. 4. Princeton University Press (1959)","DOI":"10.1515\/9781400882168-018"},{"key":"1_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"218","DOI":"10.1007\/978-3-662-44803-8_19","volume-title":"Algorithmic Game Theory","author":"Y Bachrach","year":"2014","unstructured":"Bachrach, Y., Syrgkanis, V., Tardos, \u00c9., Vojnovi\u0107, M.: Strong price of anarchy, utility games and coalitional dynamics. In: Lavi, R. (ed.) SAGT 2014. LNCS, vol. 8768, pp. 218\u2013230. Springer, Heidelberg (2014)"},{"key":"1_CR4","doi-asserted-by":"crossref","unstructured":"Bhawalkar, K., Roughgarden, T.: Welfare guarantees for combinatorial auctions with item bidding. In: Proceedings of the ACM-SIAM Symposium on Disctrete Algorithms (SODA), pp. 700\u2013709 (2011)","DOI":"10.1137\/1.9781611973082.55"},{"key":"1_CR5","doi-asserted-by":"crossref","unstructured":"Buchfuhrer, D., Schapira, M., Singer, Y.: Computation and incentives in combinatorial public projects. In: Proceedings of the ACM Conference on Electronic Commerce (ACM EC), pp. 33\u201342 (2010)","DOI":"10.1145\/1807342.1807348"},{"key":"1_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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. 5125, pp. 820\u2013832. Springer, Heidelberg (2008)"},{"key":"1_CR7","doi-asserted-by":"crossref","unstructured":"Dughmi, S.: A truthful randomized mechanism for combinatorial public projects via convex optimization. In: Proceedings of the ACM Conference on Electronic Commerce (ACM EC), pp. 263\u2013272 (2011)","DOI":"10.1145\/1993574.1993614"},{"issue":"1","key":"1_CR8","doi-asserted-by":"crossref","first-page":"122","DOI":"10.1137\/070680977","volume":"39","author":"U Feige","year":"2009","unstructured":"Feige, U.: On maximizing welfare when utility functions are subadditive. SIAM J. Comput. 39(1), 122\u2013142 (2009)","journal-title":"SIAM J. Comput."},{"key":"1_CR9","doi-asserted-by":"crossref","unstructured":"Feldman, M., Fu, H., Gravin, N., Lucier, B.: Simultaneous auctions are (almost) efficient. In: Proceedings of the 45th ACM Symposium on the Theory of Computing (STOC 2013) (2013)","DOI":"10.1145\/2488608.2488634"},{"key":"1_CR10","doi-asserted-by":"crossref","unstructured":"Hassidim, A., Kaplan, H., Mansour, Y., Nisan, N.: Non-price equilibria in markets of discrete goods. In: Proceedings of the ACM Conference on Electronic Commerce (EC), pp. 295\u2013296 (2011)","DOI":"10.1145\/1993574.1993619"},{"key":"1_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1007\/978-3-642-40450-4_33","volume-title":"Algorithms \u2013 ESA 2013","author":"B Keijzer de","year":"2013","unstructured":"de Keijzer, B., Markakis, E., Sch\u00e4fer, G., Telelis, O.: Inefficiency of standard multi-unit auctions. In: Bodlaender, H.L., Italiano, G.F. (eds.) ESA 2013. LNCS, vol. 8125, pp. 385\u2013396. Springer, Heidelberg (2013)"},{"issue":"2","key":"1_CR12","doi-asserted-by":"crossref","first-page":"270","DOI":"10.1016\/j.geb.2005.02.006","volume":"55","author":"B Lehmann","year":"2006","unstructured":"Lehmann, B., Lehmann, D.J., Nisan, N.: Combinatorial auctions with decreasing marginal utilities. Games Econ. Behav. 55(2), 270\u2013296 (2006)","journal-title":"Games Econ. Behav."},{"key":"1_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1007\/978-3-642-45046-4_28","volume-title":"Web and Internet Economics","author":"B Lucier","year":"2013","unstructured":"Lucier, B., Singer, Y., Syrgkanis, V., Tardos, \u00c9.: Equilibrium in combinatorial public projects. In: Chen, Y., Immorlica, N. (eds.) WINE 2013. LNCS, vol. 8289, pp. 347\u2013360. Springer, Heidelberg (2013)"},{"key":"1_CR14","doi-asserted-by":"crossref","unstructured":"Markakis, E., Telelis, O.: Item bidding for combinatorial public projects. In: Proceedings of the 28th Coonference on Artificial Intelligence (AAAI 2014), pp. 749\u2013755 (2014)","DOI":"10.1609\/aaai.v28i1.8803"},{"key":"1_CR15","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1007\/BF01588971","volume":"14","author":"GL Nemhauser","year":"1978","unstructured":"Nemhauser, G.L., Woolsey, L.A., Fischer, M.L.: An analysis of approximation for maximizing submodular functions \u2013 I. Math. Program. 14, 265\u2013294 (1978)","journal-title":"Math. Program."},{"key":"1_CR16","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1613\/jair.2046","volume":"29","author":"N Nisan","year":"2007","unstructured":"Nisan, N., Ronen, A.: Computationally feasible VCG mechanisms. J. Artif. Intell. Res. 29, 19\u201347 (2007)","journal-title":"J. Artif. Intell. Res."},{"key":"1_CR17","doi-asserted-by":"crossref","unstructured":"Papadimitriou, C.H., Schapira, M., Singer, Y.: On the hardness of being truthful. In: Proceedings of the Annual IEEE Symposium on Foundations of Computer Science (IEEE FOCS), pp. 250\u2013259 (2008)","DOI":"10.1109\/FOCS.2008.54"},{"key":"1_CR18","doi-asserted-by":"crossref","unstructured":"Roughgarden, T.: Intrinsic robustness of the price of anarchy. In: Proceedings of the ACM Symposium on Theory of Computing (STOC), pp. 513\u2013522 (2009)","DOI":"10.1145\/1536414.1536485"},{"key":"1_CR19","doi-asserted-by":"crossref","unstructured":"Roughgarden, T.: The price of anarchy in games of incomplete information. In: Proceedings of the ACM Conference on Electronic Commerce (ACM EC), pp. 862\u2013879. ACM (2012)","DOI":"10.1145\/2229012.2229078"},{"key":"1_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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. 5385, pp. 351\u2013361. Springer, Heidelberg (2008)"},{"key":"1_CR21","unstructured":"Syrgkanis, V.: Bayesian Games and the Smoothness Framework. CoRR (ArXiv) abs\/1203.5155 (2012)"},{"key":"1_CR22","doi-asserted-by":"crossref","unstructured":"Syrgkanis, V., Tardos, E.: Composable and efficient mechanisms. In: Proceedings of the ACM Symposium on Theory of Computing (ACM STOC), pp. 211\u2013220. ACM (2013)","DOI":"10.1145\/2488608.2488635"}],"container-title":["Lecture Notes in Computer Science","Algorithmic Aspects in Information and Management"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-41168-2_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,2]],"date-time":"2022-07-02T11:55:58Z","timestamp":1656762958000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-41168-2_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319411675","9783319411682"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-41168-2_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}