{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T07:47:24Z","timestamp":1767340044835,"version":"3.40.3"},"publisher-location":"Cham","reference-count":22,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030946753"},{"type":"electronic","value":"9783030946760"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-030-94676-0_1","type":"book-chapter","created":{"date-parts":[[2022,1,20]],"date-time":"2022-01-20T16:03:08Z","timestamp":1642694588000},"page":"3-21","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Two-Way Greedy: Algorithms for\u00a0Imperfect Rationality"],"prefix":"10.1007","author":[{"given":"Diodato","family":"Ferraioli","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Paolo","family":"Penna","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Carmine","family":"Ventre","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,1,20]]},"reference":[{"issue":"5","key":"1_CR1","doi-asserted-by":"publisher","first-page":"1452","DOI":"10.1257\/0002828043052330","volume":"94","author":"LM Ausubel","year":"2004","unstructured":"Ausubel, L.M.: An efficient ascending-bid auction for multiple objects. AER 94(5), 1452\u20131475 (2004)","journal-title":"AER"},{"issue":"4","key":"1_CR2","doi-asserted-by":"publisher","first-page":"475","DOI":"10.1002\/net.3230130404","volume":"13","author":"D Avis","year":"1983","unstructured":"Avis, D.: A survey of heuristics for the weighted matching problem. Networks 13(4), 475\u2013493 (1983)","journal-title":"Networks"},{"key":"1_CR3","doi-asserted-by":"crossref","unstructured":"Bade, S., Gonczarowski, Y.: Gibbard-satterthwaite success stories and obvious strategyproofness. In: EC, p. 565 (2017)","DOI":"10.1145\/3033274.3085104"},{"key":"1_CR4","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1007\/s00453-003-1036-3","volume":"37","author":"A Borodin","year":"2003","unstructured":"Borodin, A., Nielsen, M.N., Rackoff, C.: (Incremental) priority algorithms. Algorithmica 37, 295\u2013326 (2003)","journal-title":"Algorithmica"},{"issue":"1","key":"1_CR5","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1016\/0020-0190(83)90007-8","volume":"16","author":"KL Clarkson","year":"1983","unstructured":"Clarkson, K.L.: A modification of the greedy algorithm for vertex cover. Inf. Process. Lett. 16(1), 23\u201325 (1983)","journal-title":"Inf. Process. Lett."},{"key":"1_CR6","unstructured":"de Keijzer, B., Kyropoulou, M., Ventre, C.: Obviously strategyproof single-minded combinatorial auctions. In: ICALP, pp. 71:1\u201371:17 (2020)"},{"issue":"4","key":"1_CR7","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":"1_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1007\/978-3-030-35389-6_13","volume-title":"Web and Internet Economics","author":"D Ferraioli","year":"2019","unstructured":"Ferraioli, D., Meier, A., Penna, P., Ventre, C.: Automated optimal OSP mechanisms for\u00a0set systems. In: Caragiannis, I., Mirrokni, V., Nikolova, E. (eds.) WINE 2019. LNCS, vol. 11920, pp. 171\u2013185. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-35389-6_13"},{"key":"1_CR9","unstructured":"Ferraioli, D., Meier, A., Penna, P., Ventre, C.: Obviously strategyproof mechanisms for machine scheduling. In: ESA, pp. 46:1\u201346:15 (2019)"},{"key":"1_CR10","doi-asserted-by":"crossref","unstructured":"Ferraioli, D., Ventre, C.: Probabilistic verification for obviously strategyproof mechanisms. In: IJCAI, pp. 240\u2013246 (2018)","DOI":"10.24963\/ijcai.2018\/33"},{"issue":"2","key":"1_CR11","doi-asserted-by":"publisher","first-page":"695","DOI":"10.1007\/s00453-020-00771-x","volume":"83","author":"D Ferraioli","year":"2021","unstructured":"Ferraioli, D., Ventre, C.: Approximation guarantee of OSP mechanisms: the case of machine scheduling and facility location. Algorithmica 83(2), 695\u2013725 (2021)","journal-title":"Algorithmica"},{"key":"1_CR12","doi-asserted-by":"crossref","unstructured":"Gkatzelis, V., Markakis, E., Roughgarden, T.: Deferred-acceptance auctions for multiple levels of service. In: EC (2017)","DOI":"10.1145\/3033274.3085142"},{"key":"1_CR13","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1007\/BFb0120891","volume-title":"Combinatorial Optimization","author":"D Hausmann","year":"1980","unstructured":"Hausmann, D., Korte, B., Jenkyns, T.A.: Worst case analysis of greedy type algorithms for independence systems. In: Padberg, M.W. (ed.) Combinatorial Optimization, pp. 120\u2013131. Springer, Heidelberg (1980). https:\/\/doi.org\/10.1007\/BFb0120891"},{"issue":"6","key":"1_CR14","doi-asserted-by":"publisher","first-page":"1275","DOI":"10.2307\/1913557","volume":"55","author":"JH Kagel","year":"1987","unstructured":"Kagel, J.H., Harstad, R.M., Levin, D.: Information impact and allocation rules in auctions with affiliated private values: a laboratory study. Econometrica 55(6), 1275\u20131304 (1987)","journal-title":"Econometrica"},{"issue":"1","key":"1_CR15","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1090\/S0002-9939-1956-0078686-7","volume":"7","author":"JB Kruskal","year":"1956","unstructured":"Kruskal, J.B.: On the shortest spanning subtree of a graph and the traveling salesman problem. Proc. Am. Math. Soc. 7(1), 48\u201350 (1956)","journal-title":"Proc. Am. Math. Soc."},{"key":"1_CR16","unstructured":"Kyropoulou, M., Ventre, C.: Obviously strategyproof mechanisms without money for scheduling. In: AAMAS, pp. 1574\u20131581 (2019)"},{"issue":"5","key":"1_CR17","doi-asserted-by":"publisher","first-page":"577","DOI":"10.1145\/585265.585266","volume":"49","author":"D Lehmann","year":"2002","unstructured":"Lehmann, D., O\u2019Callaghan, L., Shoham, Y.: Truth revelation in approximately efficient combinatorial auctions. J. ACM 49(5), 577\u2013602 (2002)","journal-title":"J. ACM"},{"issue":"11","key":"1_CR18","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. AER 107(11), 3257\u201387 (2017)","journal-title":"AER"},{"key":"1_CR19","doi-asserted-by":"publisher","first-page":"512","DOI":"10.1016\/j.geb.2020.09.010","volume":"124","author":"A Mackenzie","year":"2018","unstructured":"Mackenzie, A.: A revelation principle for obviously strategy-proof implementation. Games Econ. Behav. 124, 512\u2013533 (2018)","journal-title":"Games Econ. Behav."},{"issue":"1","key":"1_CR20","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1086\/704074","volume":"128","author":"P Milgrom","year":"2020","unstructured":"Milgrom, P., Segal, I.: Clock auctions and radio spectrum reallocation. J. Polit. Econ. 128(1), 1\u201331 (2020)","journal-title":"J. Polit. Econ."},{"key":"1_CR21","doi-asserted-by":"crossref","unstructured":"Nisan, N., Roughgarden, T., Tardos, E., Vazirani, V. (eds.) Algorithmic Game Theory. Cambridge University Press, Cambridge (2007)","DOI":"10.1017\/CBO9780511800481"},{"key":"1_CR22","doi-asserted-by":"crossref","unstructured":"Saks, M., Yu, L.: Weak monotonicity suffices for truthfulness on convex domains. In: EC (2005)","DOI":"10.1145\/1064009.1064040"}],"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-030-94676-0_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,28]],"date-time":"2022-04-28T21:24:59Z","timestamp":1651181099000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-94676-0_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783030946753","9783030946760"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-94676-0_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"20 January 2022","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":"Potsdam","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 December 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 December 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wine2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/hpi.de\/wine2021\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"146","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"41","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"11","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"28% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.07","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"7","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"The conference was held online due to the COVID-19 pandemic","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}