{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,13]],"date-time":"2025-11-13T18:25:18Z","timestamp":1763058318236,"version":"3.40.3"},"publisher-location":"Cham","reference-count":23,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030353889"},{"type":"electronic","value":"9783030353896"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-35389-6_13","type":"book-chapter","created":{"date-parts":[[2019,11,21]],"date-time":"2019-11-21T06:06:49Z","timestamp":1574316409000},"page":"171-185","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Automated Optimal OSP Mechanisms for\u00a0Set Systems"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7962-5200","authenticated-orcid":false,"given":"Diodato","family":"Ferraioli","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Adrian","family":"Meier","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Paolo","family":"Penna","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1464-1215","authenticated-orcid":false,"given":"Carmine","family":"Ventre","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,12,3]]},"reference":[{"key":"13_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-662-48995-6_1","volume-title":"Web and Internet Economics","author":"M Adamczyk","year":"2015","unstructured":"Adamczyk, M., Borodin, A., Ferraioli, D., de Keijzer, B., Leonardi, S.: Sequential posted price mechanisms with correlated valuations. In: Markakis, E., Sch\u00e4fer, G. (eds.) WINE 2015. LNCS, vol. 9470, pp. 1\u201315. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-48995-6_1"},{"key":"13_CR2","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1016\/j.jet.2018.07.001","volume":"177","author":"I Ashlagi","year":"2018","unstructured":"Ashlagi, I., Gonczarowski, Y.A.: Stable matching mechanisms are not obviously strategy-proof. J. Econ. Theory 177, 405\u2013425 (2018)","journal-title":"J. Econ. Theory"},{"key":"13_CR3","doi-asserted-by":"crossref","unstructured":"Babaioff, M., Immorlica, N., Lucier, B., Weinberg, S.M.: A simple and approximately optimal mechanism for an additive buyer. In: FOCS 2014, pp. 21\u201330 (2014)","DOI":"10.1109\/FOCS.2014.11"},{"key":"13_CR4","doi-asserted-by":"crossref","unstructured":"Bade, S., Gonczarowski, Y.A.: Gibbard-Satterthwaite success stories and obvious strategyproofness. In: EC 2017, p. 565 (2017)","DOI":"10.1145\/3033274.3085104"},{"key":"13_CR5","doi-asserted-by":"crossref","unstructured":"Chawla, S., Hartline, J., Malec, D., Sivan, B.: Multi-parameter mechanism design and sequential posted pricing. In: STOC 2010, pp. 311\u2013320 (2010)","DOI":"10.1145\/1807406.1807428"},{"issue":"4","key":"13_CR6","doi-asserted-by":"publisher","first-page":"897","DOI":"10.1287\/moor.2016.0835","volume":"42","author":"P D\u00fctting","year":"2017","unstructured":"D\u00fctting, P., Gkatzelis, V., Roughgarden, T.: The performance of deferred-acceptance auctions. Math. Oper. Res. 42(4), 897\u2013914 (2017)","journal-title":"Math. Oper. Res."},{"key":"13_CR7","doi-asserted-by":"crossref","unstructured":"Eden, A., Feldman, M., Friedler, O., Talgam-Cohen, I., Weinberg, S.M.: A simple and approximately optimal mechanism for a buyer with complements. In: EC 2017, p. 323 (2017)","DOI":"10.1145\/3033274.3085116"},{"key":"13_CR8","doi-asserted-by":"crossref","unstructured":"Feldman, M., Fiat, A., Roytman, A.: Makespan minimization via posted prices. In: EC 2017, pp. 405\u2013422 (2017)","DOI":"10.1145\/3033274.3085129"},{"key":"13_CR9","unstructured":"Ferraioli, D., Meier, A., Penna, P., Ventre, C.: Obviously strategyproof mechanisms for machine scheduling. In: ESA 2019 (2019)"},{"key":"13_CR10","doi-asserted-by":"crossref","unstructured":"Ferraioli, D., Ventre, C.: Obvious strategyproofness needs monitoring for good approximations. In: AAAI 2017, pp. 516\u2013522 (2017)","DOI":"10.1609\/aaai.v31i1.10588"},{"key":"13_CR11","doi-asserted-by":"crossref","unstructured":"Ferraioli, D., Ventre, C.: Probabilistic verification for obviously strategyproof mechanisms. In: IJCAI 2018 (2018)","DOI":"10.24963\/ijcai.2018\/33"},{"key":"13_CR12","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1007\/978-3-030-30473-7_6","volume-title":"Algorithmic Game Theory","author":"Diodato Ferraioli","year":"2019","unstructured":"Ferraioli, D., Ventre, C.: Obvious strategyproofness, bounded rationality and approximation: the case of machine scheduling. In: SAGT 2019 (2019)"},{"key":"13_CR13","doi-asserted-by":"crossref","unstructured":"Hartline, J., Roughgarden, T.: Simple versus optimal mechanisms. In: EC 2009, pp. 225\u2013234 (2009)","DOI":"10.1145\/1566374.1566407"},{"key":"13_CR14","doi-asserted-by":"publisher","first-page":"1275","DOI":"10.2307\/1913557","volume":"55","author":"J Kagel","year":"1987","unstructured":"Kagel, J., Harstad, R., Levin, D.: Information impact and allocation rules in auctions with affiliated private values: a laboratory study. Econometrica 55, 1275\u20131304 (1987)","journal-title":"Econometrica"},{"key":"13_CR15","unstructured":"Kyropoulou, M., Ventre, C.: Obviously strategyproof mechanisms without money for scheduling. In: AAMAS 2019 (2019)"},{"issue":"11","key":"13_CR16","doi-asserted-by":"publisher","first-page":"3257","DOI":"10.1257\/aer.20160425","volume":"107","author":"S Li","year":"2017","unstructured":"Li, S.: Obviously strategy-proof mechanisms. Am. Econ. Rev. 107(11), 3257\u20133287 (2017)","journal-title":"Am. Econ. Rev."},{"key":"13_CR17","unstructured":"Mackenzie, A.: A revelation principle for obviously strategy-proof implementation. Research Memorandum 014 (GSBE) (2017)"},{"key":"13_CR18","doi-asserted-by":"crossref","unstructured":"Milgrom, P., Segal, I.: Deferred-acceptance auctions and radio spectrum reallocation. In: EC 2014 (2014)","DOI":"10.1145\/2600057.2602834"},{"key":"13_CR19","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1006\/game.1999.0790","volume":"35","author":"N Nisan","year":"2001","unstructured":"Nisan, N., Ronen, A.: Algorithmic mechanism design. Games Econ. Behav. 35, 166\u2013196 (2001)","journal-title":"Games Econ. Behav."},{"key":"13_CR20","doi-asserted-by":"publisher","first-page":"491","DOI":"10.1016\/j.geb.2012.09.002","volume":"86","author":"P Penna","year":"2014","unstructured":"Penna, P., Ventre, C.: Optimal collusion-resistant mechanisms with verification. Games Econ. Behav. 86, 491\u2013509 (2014)","journal-title":"Games Econ. Behav."},{"issue":"2","key":"13_CR21","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1016\/0304-4068(85)90015-1","volume":"14","author":"JC Rochet","year":"1985","unstructured":"Rochet, J.C.: The taxation principle and multitime Hamilton-Jacobi equations. J. Math. Econ. 14(2), 113\u2013128 (1985)","journal-title":"J. Math. Econ."},{"key":"13_CR22","doi-asserted-by":"crossref","unstructured":"Saks, M., Yu, L.: Weak monotonicity suffices for truthfulness on convex domains. In: EC 2005, pp. 286\u2013293 (2005)","DOI":"10.1145\/1064009.1064040"},{"key":"13_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1007\/978-3-540-45193-8_2","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2003","author":"T Sandholm","year":"2003","unstructured":"Sandholm, T.: Automated mechanism design: a new application area for search algorithms. In: Rossi, F. (ed.) CP 2003. LNCS, vol. 2833, pp. 19\u201336. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/978-3-540-45193-8_2"}],"container-title":["Lecture Notes in Computer Science","Web and Internet Economics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-35389-6_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,10,6]],"date-time":"2022-10-06T15:09:06Z","timestamp":1665068946000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-35389-6_13"}},"subtitle":["The Case of Small Domains"],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030353889","9783030353896"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-35389-6_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"3 December 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WINE","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Web and Internet Economics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"New York City, NY","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 December 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 December 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wine0","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/wine2019.cs.columbia.edu\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}