{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:26:03Z","timestamp":1742912763925,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662541098"},{"type":"electronic","value":"9783662541104"}],"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-662-54110-4_21","type":"book-chapter","created":{"date-parts":[[2016,12,10]],"date-time":"2016-12-10T13:48:58Z","timestamp":1481377738000},"page":"294-308","source":"Crossref","is-referenced-by-count":1,"title":["Smoothness for Simultaneous Composition of Mechanisms with Admission"],"prefix":"10.1007","author":[{"given":"Martin","family":"Hoefer","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Thomas","family":"Kesselheim","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bojana","family":"Kodric","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,12,11]]},"reference":[{"key":"21_CR1","unstructured":"Agrawal, S.: Optimization under uncertainty: bounding the correlation gap. Ph.D. thesis, Stanford University (2011)"},{"key":"21_CR2","doi-asserted-by":"crossref","unstructured":"Agrawal, S., Ding, Y., Saberi, A., Ye, Y.: Correlation robust stochastic optimization. In: Proceedings of 21st Symposium on Discrete Algorithms (SODA), pp. 1087\u20131096 (2010)","DOI":"10.1137\/1.9781611973075.88"},{"key":"21_CR3","doi-asserted-by":"crossref","unstructured":"Bhawalkar, K., Roughgarden, T.: Welfare guarantees for combinatorial auctions with item bidding. In: Proceedings of 22nd Symposium on Discrete Algorithms (SODA), pp. 700\u2013709 (2011)","DOI":"10.1137\/1.9781611973082.55"},{"key":"21_CR4","doi-asserted-by":"crossref","unstructured":"Blum, A., Mansour, Y.: Learning, regret minimization, and equilibria. In: Nisan, N., Tardos, \u00c9., Roughgarden, T., Vazirani, V. (eds.), Algorithmic Game Theory, chapter 4. Cambridge University Press (2007)","DOI":"10.1017\/CBO9780511800481.006"},{"key":"21_CR5","doi-asserted-by":"crossref","unstructured":"Cai, Y., Papadimitriou, C.: Simultaneous Bayesian auctions and computational complexity. In Proceedings of the 15th ACM Conference on Economics and Computation (EC 2014), pp. 895\u2013910 (2014)","DOI":"10.1145\/2600057.2602877"},{"key":"21_CR6","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1016\/j.jet.2014.04.010","volume":"156","author":"I Caragiannis","year":"2015","unstructured":"Caragiannis, I., Kaklamanis, C., Kanellopoulos, P., Kyropoulou, M., Lucier, B., Leme, R.P., Tardos, \u00c9.: On the efficiency of equilibria in generalized second price auctions. J. Econom. Theory 156, 343\u2013388 (2015)","journal-title":"J. Econom. Theory"},{"key":"21_CR7","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. LNCS, vol. 5125, pp. 820\u2013832. Springer, Heidelberg (2008). doi: 10.1007\/978-3-540-70575-8_67"},{"issue":"2","key":"21_CR8","first-page":"9","volume":"4","author":"G Christodoulou","year":"2016","unstructured":"Christodoulou, G., Kov\u00e1cs, A., Sgouritsa, A., Tang, B.: Tight bounds for the price of anarchy of simultaneous first price auctions. ACM Trans. Econom. Comput. 4(2), 9 (2016)","journal-title":"ACM Trans. Econom. Comput."},{"key":"21_CR9","doi-asserted-by":"crossref","unstructured":"Daskalakis, C., Syrgkanis, V.: Learning in auctions: regret is hard, envy is easy. In: Proceedings of 57th Symposium on Foundations of Computer Science (FOCS) (2016, to appear)","DOI":"10.1109\/FOCS.2016.31"},{"key":"21_CR10","doi-asserted-by":"crossref","unstructured":"Devanur, N., Morgenstern, J., Syrgkanis, V., Weinberg, M.: Simple auctions with simple strategies. In: Proceedings of the 16th ACM Conference on Economics and Computation (EC 2015), pp. 305\u2013322 (2015)","DOI":"10.1145\/2764468.2764484"},{"key":"21_CR11","doi-asserted-by":"crossref","unstructured":"Dobzinski, S., Fu, H., Kleinberg, R.D.: On the complexity of computing an equilibrium in combinatorial auctions. In: Proceedings of 26th Symposium on Discrete Algorithms (SODA), pp. 110\u2013122 (2015)","DOI":"10.1137\/1.9781611973730.9"},{"key":"21_CR12","doi-asserted-by":"crossref","unstructured":"Feldman, M., Fu, H., Gravin, N., Lucier, B.: Simultaneous auctions are (almost) efficient. In: Proceedings of 45th Symposium on Theory of Computing (STOC), pp. 201\u2013210 (2013)","DOI":"10.1145\/2488608.2488634"},{"key":"21_CR13","unstructured":"Hartline, J.D., Syrgkanis, V., Tardos, \u00c9.: No-regret learning in repeated Bayesian games. In: Proceedings of 28th Conference on Advanced Neural Information Processing Systems (NIPS), pp. 3043\u20133051 (2015)"},{"key":"21_CR14","doi-asserted-by":"crossref","unstructured":"Hassidim, A., Kaplan, H., Mansour, Y., Nisan, N.: Non-price equilibria in markets of discrete goods. In Proceedings of 12th Conference on Electronic Commerce (EC), pp. 295\u2013296 (2011)","DOI":"10.1145\/1993574.1993619"},{"key":"21_CR15","doi-asserted-by":"crossref","unstructured":"Hoefer, M., Kesselheim, T., Kodric, B.: Smoothness for simultaneous composition of mechanisms with admission. CoRR, abs\/1509.00337 (2015)","DOI":"10.1007\/978-3-662-54110-4_21"},{"key":"21_CR16","doi-asserted-by":"crossref","unstructured":"Lucier, B., Borodin, A.: Price of anarchy for greedy auctions. In: Proceedings of 21st Symposium Discrete Algorithms (SODA), pp. 537\u2013553 (2010)","DOI":"10.1137\/1.9781611973075.46"},{"key":"21_CR17","doi-asserted-by":"crossref","unstructured":"Lykouris, T., Syrgkanis, V., Tardos, \u00c9.: Learning and efficiency in games with dynamic population. In Proceedings of 27th Symposium Discrete Algorithms (SODA), pp. 120\u2013129 (2016)","DOI":"10.1137\/1.9781611974331.ch9"},{"key":"21_CR18","doi-asserted-by":"crossref","unstructured":"Paes Leme, R., Tardos, \u00c9.: Pure and Bayes-Nash price of anarchy for generalized second price auction. In: Proceedings of 51st Symposium Foundations of Computer Science (FOCS), pp. 735\u2013744 (2010)","DOI":"10.1109\/FOCS.2010.75"},{"issue":"7","key":"21_CR19","doi-asserted-by":"crossref","first-page":"116","DOI":"10.1145\/2209249.2209274","volume":"55","author":"T Roughgarden","year":"2012","unstructured":"Roughgarden, T.: Intrinsic robustness of the price of anarchy. Comm. ACM 55(7), 116\u2013123 (2012)","journal-title":"Comm. ACM"},{"key":"21_CR20","doi-asserted-by":"crossref","unstructured":"Roughgarden, T.: The price of anarchy in games of incomplete information. In: Proceedings of 13th Conference on Electronic Commerce (EC), pp. 862\u2013879 (2012)","DOI":"10.1145\/2229012.2229078"},{"key":"21_CR21","doi-asserted-by":"crossref","unstructured":"Roughgarden, T.: Barriers to near-optimal equilibria. In: Proceedings of 55th Symposium on Foundations of Computer Science (FOCS), pp. 71\u201380 (2014)","DOI":"10.1109\/FOCS.2014.16"},{"key":"21_CR22","doi-asserted-by":"crossref","unstructured":"Syrgkanis, V., Tardos, \u00c9.: Composable and efficient mechanisms. In: Proceedings of 45th Symposium Theory of Computing (STOC), pp. 211\u2013220 (2013)","DOI":"10.1145\/2488608.2488635"},{"key":"21_CR23","doi-asserted-by":"crossref","unstructured":"Yan, Q.: Mechanism design via correlation gap. In: Proceedings of 22nd Symposium Discrete Algorithms (SODA), pp. 710\u2013719 (2011)","DOI":"10.1137\/1.9781611973082.56"}],"container-title":["Lecture Notes in Computer Science","Web and Internet Economics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-54110-4_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,16]],"date-time":"2022-07-16T21:15:08Z","timestamp":1658006108000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-54110-4_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783662541098","9783662541104"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-54110-4_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}