{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,13]],"date-time":"2025-11-13T18:24:55Z","timestamp":1763058295311,"version":"3.40.3"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030304720"},{"type":"electronic","value":"9783030304737"}],"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-30473-7_6","type":"book-chapter","created":{"date-parts":[[2019,9,15]],"date-time":"2019-09-15T23:02:36Z","timestamp":1568588556000},"page":"77-91","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Obvious Strategyproofness, Bounded Rationality and Approximation"],"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"}]},{"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,9,16]]},"reference":[{"key":"6_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":"6_CR2","doi-asserted-by":"crossref","unstructured":"Archer, A., Tardos, \u00c9.: Truthful mechanisms for one-parameter agents. In: FOCS 2001, pp. 482\u2013491 (2001)","DOI":"10.1109\/SFCS.2001.959924"},{"key":"6_CR3","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. Theor. 177, 405\u2013425 (2018)","journal-title":"J. Econ. Theor."},{"issue":"5","key":"6_CR4","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. Am. Econ. Rev. 94(5), 1452\u20131475 (2004)","journal-title":"Am. Econ. Rev."},{"key":"6_CR5","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":"6_CR6","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":"6_CR7","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"},{"key":"6_CR8","doi-asserted-by":"crossref","unstructured":"Correa, J., Foncea, P., Hoeksma, R., Oosterwijk, T., Vredeveld, T.: Posted price mechanisms for a random stream of customers. In: EC 2017, pp. 169\u2013186 (2017)","DOI":"10.1145\/3033274.3085137"},{"key":"6_CR9","volume-title":"Thought and Choice in Chess","author":"A De Groot","year":"1978","unstructured":"De Groot, A.: Thought and Choice in Chess. Mouton, Oxford (1978)"},{"key":"6_CR10","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, pp. 323\u2013323 (2017)","DOI":"10.1145\/3033274.3085116"},{"key":"6_CR11","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":"6_CR12","unstructured":"Ferraioli, D., Meier, A., Penna, P., Ventre, C.: Obviously strategyproof mechanisms for machine scheduling. In: ESA 2019 (2019)"},{"key":"6_CR13","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":"6_CR14","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":"6_CR15","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. In: AAMAS 2019 (2019)"},{"key":"6_CR16","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":"6_CR17","unstructured":"Kyropoulou, M., Ventre, C.: Obviously strategyproof mechanisms without money for scheduling. In: AAMAS 2019 (2019)"},{"issue":"11","key":"6_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. Am. Econ. Rev. 107(11), 3257\u201387 (2017)","journal-title":"Am. Econ. Rev."},{"key":"6_CR19","unstructured":"Mackenzie, A.: A revelation principle for obviously strategy-proof implementation. Research Memorandum 014, (GSBE) (2017)"},{"key":"6_CR20","volume-title":"Heuristics: Intelligent Search Strategies for Computer Problem Solving","author":"J Pearl","year":"1984","unstructured":"Pearl, J.: Heuristics: Intelligent Search Strategies for Computer Problem Solving. Addison-Wesley, Reading (1984)"},{"key":"6_CR21","doi-asserted-by":"crossref","unstructured":"Pycia, M., Troyan, P.: Obvious dominance and random priority. In: EC 2019 (2019)","DOI":"10.1145\/3328526.3329613"},{"key":"6_CR22","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1007\/978-3-540-25947-3_5","volume-title":"Agent-Mediated Electronic Commerce V. Designing Mechanisms and Systems","author":"T Sandholm","year":"2004","unstructured":"Sandholm, T., Gilpin, A.: Sequences of take-it-or-leave-it offers: near-optimal auctions without full valuation revelation. In: Faratin, P., Parkes, D.C., Rodr\u00edguez-Aguilar, J.A., Walsh, W.E. (eds.) AMEC 2003. LNCS (LNAI), vol. 3048, pp. 73\u201391. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-25947-3_5"},{"issue":"314","key":"6_CR23","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1080\/14786445008521796","volume":"41","author":"C Shannon","year":"1950","unstructured":"Shannon, C.: Programming a computer for playing chess. Philos. Mag. 41(314), 256\u2013275 (1950)","journal-title":"Philos. Mag."},{"issue":"5","key":"6_CR24","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1257\/aer.p20171030","volume":"107","author":"L Zhang","year":"2017","unstructured":"Zhang, L., Levin, D.: Bounded rationality and robust mechanism design: an axiomatic approach. Am. Econ. Rev. 107(5), 235\u201339 (2017)","journal-title":"Am. Econ. Rev."}],"container-title":["Lecture Notes in Computer Science","Algorithmic Game Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-30473-7_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T11:32:56Z","timestamp":1709811176000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-30473-7_6"}},"subtitle":["The Case of Machine Scheduling"],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030304720","9783030304737"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-30473-7_6","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":"16 September 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SAGT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Algorithmic Game Theory","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Athens","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Greece","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":"30 September 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 October 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sagt2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/corelab.ntua.gr\/sagt2019\/","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":"55","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":"26","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":"0","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":"47% - 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","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)"}}]}}