{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T16:09:28Z","timestamp":1743005368176,"version":"3.40.3"},"publisher-location":"Cham","reference-count":13,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030859466"},{"type":"electronic","value":"9783030859473"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"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":[[2021]]},"DOI":"10.1007\/978-3-030-85947-3_1","type":"book-chapter","created":{"date-parts":[[2021,9,14]],"date-time":"2021-09-14T00:45:22Z","timestamp":1631580322000},"page":"3-17","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Improved Two Sample Revenue Guarantees via Mixed-Integer Linear Programming"],"prefix":"10.1007","author":[{"given":"Mete \u015eeref","family":"Ahunbay","sequence":"first","affiliation":[]},{"given":"Adrian","family":"Vetta","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,9,14]]},"reference":[{"unstructured":"Alon, N., Babaioff, M., Gonczarowski, Y.A., Mansour, Y., Moran, S., Yehudayoff, A.: Submultiplicative Glivenko-Cantelli and uniform convergence of revenues. In: Proceedings of the 31st International Conference on Neural Information Processing Systems, NIPS 2017, pp. 1655\u20131664 (2017)","key":"1_CR1"},{"doi-asserted-by":"crossref","unstructured":"Babaioff, M., Gonczarowski, Y.A., Mansour, Y., Moran, S.: Are two (samples) really better than one? In: Proceedings of the 2018 ACM Conference on Economics and Computation, EC 2018, p. 175 (2018)","key":"1_CR2","DOI":"10.1145\/3219166.3219187"},{"doi-asserted-by":"crossref","unstructured":"Cole, R., Roughgarden, T.: The sample complexity of revenue maximization. In: Proceedings of the 46th Annual ACM Symposium on Theory of Computing, STOC 2014, pp. 243\u2013252 (2014)","key":"1_CR3","DOI":"10.1145\/2591796.2591867"},{"doi-asserted-by":"crossref","unstructured":"Daskalakis, C., Zampetakis, M.: More revenue from two samples via factor revealing SDPs. In: Proceedings of the 21st ACM Conference on Economics and Computation, EC 2020, pp. 257\u2013272 (2020)","key":"1_CR4","DOI":"10.1145\/3391403.3399543"},{"doi-asserted-by":"crossref","unstructured":"Devanur, N.R., Huang, Z., Psomas, C.A.: The sample complexity of auctions with side information. In: Proceedings of the 48th Annual ACM Symposium on Theory of Computing, STOC 2016, pp. 426\u2013439 (2016)","key":"1_CR5","DOI":"10.1145\/2897518.2897553"},{"doi-asserted-by":"crossref","unstructured":"Dhangwatnotai, P., Roughgarden, T., Yan, Q.: Revenue maximization with a single sample. In: Proceedings of the 11th ACM Conference on Electronic Commerce, EC 2010, pp. 129\u2013138 (2010)","key":"1_CR6","DOI":"10.1145\/1807342.1807364"},{"doi-asserted-by":"crossref","unstructured":"Fu, H., Immorlica, N., Lucier, B., Strack, P.: Randomization beats second price as a prior-independent auction. In: Proceedings of the 16th ACM Conference on Economics and Computation, EC 2015, p. 323 (2015)","key":"1_CR7","DOI":"10.1145\/2764468.2764489"},{"doi-asserted-by":"crossref","unstructured":"Gonczarowski, Y.A., Nisan, N.: Efficient empirical revenue maximization in single-parameter auction environments. In: Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2017, pp. 856\u2013868 (2017)","key":"1_CR8","DOI":"10.1145\/3055399.3055427"},{"doi-asserted-by":"crossref","unstructured":"Gonczarowski, Y.A., Weinberg, S.M.: The sample complexity of up-to-$$\\epsilon $$ multi-dimensional revenue maximization. In: IEEE 59th Annual Symposium on Foundations of Computer Science, FOCS 2018, pp. 416\u2013426 (2018)","key":"1_CR9","DOI":"10.1109\/FOCS.2018.00047"},{"doi-asserted-by":"crossref","unstructured":"Guo, C., Huang, Z., Zhang, X.: Settling the sample complexity of single-parameter revenue maximization. In: Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, STOC 2019, pp. 662\u2013673 (2019)","key":"1_CR10","DOI":"10.1145\/3313276.3316325"},{"doi-asserted-by":"crossref","unstructured":"Huang, Z., Mansour, Y., Roughgarden, T.: Making the most of your samples. In: Proceedings of the 16th ACM Conference on Economics and Computation, EC 2015, pp. 45\u201360 (2015)","key":"1_CR11","DOI":"10.1145\/2764468.2764475"},{"issue":"1","key":"1_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1287\/moor.6.1.58","volume":"6","author":"RB Myerson","year":"1981","unstructured":"Myerson, R.B.: Optimal auction design. Math. Oper. Res. 6(1), 1\u2013158 (1981)","journal-title":"Math. Oper. Res."},{"doi-asserted-by":"crossref","unstructured":"Roughgarden, T., Schrijvers, O.: Ironing in the dark. In: Proceedings of the 2016 ACM Conference on Economics and Computation, EC 2016, pp. 1\u201318 (2016)","key":"1_CR13","DOI":"10.1145\/2940716.2940723"}],"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-85947-3_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T14:09:59Z","timestamp":1641996599000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-85947-3_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030859466","9783030859473"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-85947-3_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"14 September 2021","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":"Aarhus","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Denmark","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":"21 September 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 September 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sagt2021","order":10,"name":"conference_id","label":"Conference ID","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":"73","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":"36% - 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.5","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":"4 abstracts of presented papers are also included.","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)"}}]}}