{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T08:05:43Z","timestamp":1743062743238,"version":"3.40.3"},"publisher-location":"Cham","reference-count":11,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031157134"},{"type":"electronic","value":"9783031157141"}],"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-031-15714-1_4","type":"book-chapter","created":{"date-parts":[[2022,9,13]],"date-time":"2022-09-13T17:26:44Z","timestamp":1663090004000},"page":"60-77","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Lookahead Auctions with\u00a0Pooling"],"prefix":"10.1007","author":[{"given":"Michal","family":"Feldman","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nick","family":"Gravin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhihao Gavin","family":"Tang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Almog","family":"Wald","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,9,14]]},"reference":[{"key":"4_CR1","doi-asserted-by":"crossref","unstructured":"Bei, X., Gravin, N., Lu, P., Tang, Z.G.: Correlation-robust analysis of single item auction. In: SODA, pp. 193\u2013208. SIAM (2019)","DOI":"10.1137\/1.9781611975482.13"},{"key":"4_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/978-3-642-25510-6_6","volume-title":"Internet and Network Economics","author":"X Chen","year":"2011","unstructured":"Chen, X., Hu, G., Lu, P., Wang, L.: On the approximation ratio of k-lookahead auction. In: Chen, N., Elkind, E., Koutsoupias, E. (eds.) WINE 2011. LNCS, vol. 7090, pp. 61\u201371. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-25510-6_6"},{"key":"4_CR3","doi-asserted-by":"crossref","unstructured":"Cr\u00e9mer, J., McLean, R.P.: Full extraction of the surplus in Bayesian and dominant strategy auctions. Econometrica 56(6), 1247\u20131257 (1988). http:\/\/www.jstor.org\/stable\/1913096","DOI":"10.2307\/1913096"},{"key":"4_CR4","doi-asserted-by":"crossref","unstructured":"Deb, R., Pai, M.M.: Discrimination via symmetric auctions. Am. Econ. J. Microecon. 9(1), 275\u2013314 (2017). http:\/\/www.jstor.org\/stable\/26157031","DOI":"10.1257\/mic.20150121"},{"key":"4_CR5","doi-asserted-by":"publisher","unstructured":"Dobzinski, S., Fu, H., Kleinberg, R.D.: Optimal auctions with correlated bidders are easy. In: Fortnow, L., Vadhan, S.P. (eds.) Proceedings of the 43rd ACM Symposium on Theory of Computing, STOC 2011, San Jose, CA, USA, 6\u20138 June 2011, pp. 129\u2013138. ACM (2011). https:\/\/doi.org\/10.1145\/1993636.1993655","DOI":"10.1145\/1993636.1993655"},{"key":"4_CR6","doi-asserted-by":"crossref","unstructured":"Dobzinski, S., Uziely, N.: Revenue loss in shrinking markets. In: EC, pp. 431\u2013442. ACM (2018)","DOI":"10.1145\/3219166.3219196"},{"key":"4_CR7","unstructured":"Hartline, J.: Mechanism design and approximation. http:\/\/jasonhartline.com\/MDnA\/. Accessed 7 May 2020"},{"key":"4_CR8","doi-asserted-by":"publisher","unstructured":"Hartline, J.D., Roughgarden, T.: Simple versus optimal mechanisms. In: Chuang, J., Fortnow, L., Pu, P. (eds.) Proceedings 10th ACM Conference on Electronic Commerce (EC-2009), Stanford, CA, USA, 6\u201310 July 2009, pp. 225\u2013234. ACM (2009). https:\/\/doi.org\/10.1145\/1566374.1566407","DOI":"10.1145\/1566374.1566407"},{"issue":"1","key":"4_CR9","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1287\/moor.6.1.58","volume":"6","author":"R Myerson","year":"1981","unstructured":"Myerson, R.: Optimal auction design. Math. Oper. Res. 6(1), 58\u201373 (1981)","journal-title":"Math. Oper. Res."},{"key":"4_CR10","doi-asserted-by":"crossref","unstructured":"Papadimitriou, C.H., Pierrakos, G.: On optimal single-item auctions. In: STOC, pp. 119\u2013128. ACM (2011)","DOI":"10.1145\/1993636.1993654"},{"key":"4_CR11","doi-asserted-by":"publisher","unstructured":"Ronen, A.: On approximating optimal auctions. In: Wellman, M.P., Shoham, Y. (eds.) Proceedings 3rd ACM Conference on Electronic Commerce (EC-2001), Tampa, FL, USA, 14\u201317 October 2001, pp. 11\u201317. ACM (2001). https:\/\/doi.org\/10.1145\/501158.501160","DOI":"10.1145\/501158.501160"}],"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-031-15714-1_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,13]],"date-time":"2022-09-13T17:26:56Z","timestamp":1663090016000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-15714-1_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031157134","9783031157141"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-15714-1_4","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":"14 September 2022","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":"Colchester","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"United Kingdom","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 September 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 September 2022","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":"sagt2022","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":"83","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":"34","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":"41% - 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.01","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":"6.9","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)"}}]}}