{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T18:31:47Z","timestamp":1780338707362,"version":"3.54.1"},"reference-count":53,"publisher":"Association for Computing Machinery (ACM)","issue":"5","license":[{"start":{"date-parts":[[2020,9,29]],"date-time":"2020-09-29T00:00:00Z","timestamp":1601337600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["IIS-1755781"],"award-info":[{"award-number":["IIS-1755781"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100004332","name":"JPMorgan Chase and Company","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100004332","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["J. ACM"],"published-print":{"date-parts":[[2020,10,31]]},"abstract":"<jats:p>We consider the design of computationally efficient online learning algorithms in an adversarial setting in which the learner has access to an offline optimization oracle. We present an algorithm called Generalized Follow-the-Perturbed-Leader and provide conditions under which it is oracle-efficient while achieving vanishing regret. Our results make significant progress on an open problem raised by Hazan and Koren [31], who showed that oracle-efficient algorithms do not exist in general\u00a0[30] and asked whether one can identify properties under which oracle-efficient online learning may be possible.<\/jats:p>\n          <jats:p>Our auction-design framework considers an auctioneer learning an optimal auction for a sequence of adversarially selected valuations with the goal of achieving revenue that is almost as good as the optimal auction in hindsight, among a class of auctions. We give oracle-efficient learning results for: (1) VCG auctions with bidder-specific reserves in single-parameter settings, (2) envy-free item pricing in multi-item auctions, and (3) s-level auctions of Morgenstern and Roughgarden [43] for single-item settings. The last result leads to an approximation of the overall optimal Myerson auction when bidders\u2019 valuations are drawn according to a fast-mixing Markov process, extending prior work that only gave such guarantees for the i.i.d. setting.<\/jats:p>\n          <jats:p>Finally, we derive various extensions, including: (1) oracle-efficient algorithms for the contextual learning setting in which the learner has access to side information (such as bidder demographics), (2) learning with approximate oracles such as those based on Maximal-in-Range algorithms, and (3) no-regret bidding in simultaneous auctions, resolving an open problem of Daskalakis and Syrgkanis [14].<\/jats:p>","DOI":"10.1145\/3402203","type":"journal-article","created":{"date-parts":[[2020,9,29]],"date-time":"2020-09-29T17:00:44Z","timestamp":1601398844000},"page":"1-57","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":7,"title":["Oracle-efficient Online Learning and Auction Design"],"prefix":"10.1145","volume":"67","author":[{"given":"Miroslav","family":"Dud\u00edk","sequence":"first","affiliation":[{"name":"Microsoft Research, New York City"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Nika","family":"Haghtalab","sequence":"additional","affiliation":[{"name":"Cornell University, Ithaca, NY"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Haipeng","family":"Luo","sequence":"additional","affiliation":[{"name":"University of Southern California, Los Angeles, CA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Robert E.","family":"Schapire","sequence":"additional","affiliation":[{"name":"Microsoft Research, New York City"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Vasilis","family":"Syrgkanis","sequence":"additional","affiliation":[{"name":"Microsoft Research, New England, Cambridge, MA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jennifer Wortman","family":"Vaughan","sequence":"additional","affiliation":[{"name":"Microsoft Research, New York City"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2020,9,29]]},"reference":[{"key":"e_1_2_1_1_1","volume-title":"Proceedings of the 31st International Conference on Machine Learning (ICML\u201914)","author":"Agarwal Alekh","year":"2014","unstructured":"Alekh Agarwal , Daniel Hsu , Satyen Kale , John Langford , Lihong Li , and Robert Schapire . 2014 . Taming the monster: A fast and simple algorithm for contextual bandits . In Proceedings of the 31st International Conference on Machine Learning (ICML\u201914) . 1638--1646. Alekh Agarwal, Daniel Hsu, Satyen Kale, John Langford, Lihong Li, and Robert Schapire. 2014. Taming the monster: A fast and simple algorithm for contextual bandits. In Proceedings of the 31st International Conference on Machine Learning (ICML\u201914). 1638--1646."},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2007.04.016"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/1134707.1134711"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973082.55"},{"key":"e_1_2_1_5_1","volume-title":"Hartline","author":"Blum Avrim","year":"2005","unstructured":"Avrim Blum and Jason D . Hartline . 2005 . Near-optimal online auctions. In Proceedings of the 16th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA\u201905). SIAM , 1156--1163. Avrim Blum and Jason D. Hartline. 2005. Near-optimal online auctions. In Proceedings of the 16th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA\u201905). SIAM, 1156--1163."},{"key":"e_1_2_1_6_1","volume-title":"Learning, regret minimization, and equilibria","author":"Blum Avrim","unstructured":"Avrim Blum and Yishay Mansour . 2007. Learning, regret minimization, and equilibria . In Algorithmic Game Theory, Noam Nisan, Tim Roughgarden, Eva Tardos, and Vijay Vazirani (Eds.). Cambridge University Press. Avrim Blum and Yishay Mansour. 2007. Learning, regret minimization, and equilibria. In Algorithmic Game Theory, Noam Nisan, Tim Roughgarden, Eva Tardos, and Vijay Vazirani (Eds.). Cambridge University Press."},{"key":"e_1_2_1_7_1","first-page":"1","article-title":"Multi-scale online learning: Theory and applications to online auctions and pricing","volume":"20","author":"Bubeck S\u00e9bastien","year":"2019","unstructured":"S\u00e9bastien Bubeck , Nikhil R. Devanur , Zhiyi Huang , and Rad Niazadeh . 2019 . Multi-scale online learning: Theory and applications to online auctions and pricing . J. Mach. Learn. Res. 20 , 62 (2019), 1 -- 37 . S\u00e9bastien Bubeck, Nikhil R. Devanur, Zhiyi Huang, and Rad Niazadeh. 2019. Multi-scale online learning: Theory and applications to online auctions and pricing. J. Mach. Learn. Res. 20, 62 (2019), 1--37.","journal-title":"J. Mach. Learn. Res."},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.833339"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973105.86"},{"key":"e_1_2_1_10_1","volume-title":"Proceedings of the 25th Annual Conference on Neural Information Processing Systems (NeurIPS\u201911)","author":"Cesa-Bianchi Nicolo","year":"2011","unstructured":"Nicolo Cesa-Bianchi and Ohad Shamir . 2011 . Efficient online learning via randomized rounding . In Proceedings of the 25th Annual Conference on Neural Information Processing Systems (NeurIPS\u201911) . 343--351. Nicolo Cesa-Bianchi and Ohad Shamir. 2011. Efficient online learning via randomized rounding. In Proceedings of the 25th Annual Conference on Neural Information Processing Systems (NeurIPS\u201911). 343--351."},{"key":"e_1_2_1_11_1","volume-title":"Proceedings of the Princeton Conference in Honor of Professor S. Bochner. 195--199","author":"Cheeger Jeff","year":"1969","unstructured":"Jeff Cheeger . 1969 . A lower bound for the smallest eigenvalue of the Laplacian . In Proceedings of the Princeton Conference in Honor of Professor S. Bochner. 195--199 . Jeff Cheeger. 1969. A lower bound for the smallest eigenvalue of the Laplacian. In Proceedings of the Princeton Conference in Honor of Professor S. Bochner. 195--199."},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-70575-8_67"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/2591796.2591867"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2016.31"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/3328526.3329594"},{"key":"e_1_2_1_16_1","volume-title":"The sample complexity of auctions with side information. CoRR abs\/1511.02296v4","author":"Devanur Nikhil R.","year":"2017","unstructured":"Nikhil R. Devanur , Zhiyi Huang , and Christos-Alexandros Psomas . 2017. The sample complexity of auctions with side information. CoRR abs\/1511.02296v4 ( 2017 ). Nikhil R. Devanur, Zhiyi Huang, and Christos-Alexandros Psomas. 2017. The sample complexity of auctions with side information. CoRR abs\/1511.02296v4 (2017)."},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/2897518.2897553"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.geb.2014.03.011"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/1250910.1250960"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2017.55"},{"key":"e_1_2_1_21_1","volume-title":"Proceedings of the Annual Conference on Uncertainty in Artificial Intelligence (UAI\u201911)","author":"Dudik Miroslav","year":"2011","unstructured":"Miroslav Dudik , Daniel Hsu , Satyen Kale , Nikos Karampatziakis , John Langford , Lev Reyzin , and Tong Zhang . 2011 . Efficient optimal learning for contextual bandits . In Proceedings of the Annual Conference on Uncertainty in Artificial Intelligence (UAI\u201911) . 169--178. Miroslav Dudik, Daniel Hsu, Satyen Kale, Nikos Karampatziakis, John Langford, Lev Reyzin, and Tong Zhang. 2011. Efficient optimal learning for contextual bandits. In Proceedings of the Annual Conference on Uncertainty in Artificial Intelligence (UAI\u201911). 169--178."},{"key":"e_1_2_1_22_1","volume-title":"Proceedings of the 8th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA\u201907)","author":"Elkind Edith","year":"2007","unstructured":"Edith Elkind . 2007 . Designing and learning optimal finite support auctions . In Proceedings of the 8th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA\u201907) . Society for Industrial and Applied Mathematics, 736--745. Edith Elkind. 2007. Designing and learning optimal finite support auctions. In Proceedings of the 8th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA\u201907). Society for Industrial and Applied Mathematics, 736--745."},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/2488608.2488634"},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.1997.1504"},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1137\/0222047"},{"key":"e_1_2_1_26_1","volume-title":"Proceedings of the 16th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA\u201905)","author":"Guruswami Venkatesan","year":"2005","unstructured":"Venkatesan Guruswami , Jason D. Hartline , Anna R. Karlin , David Kempe , Claire Kenyon , and Frank McSherry . 2005 . On profit-maximizing envy-free pricing . In Proceedings of the 16th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA\u201905) . SIAM, 1164--1173. Venkatesan Guruswami, Jason D. Hartline, Anna R. Karlin, David Kempe, Claire Kenyon, and Frank McSherry. 2005. On profit-maximizing envy-free pricing. In Proceedings of the 16th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA\u201905). SIAM, 1164--1173."},{"key":"e_1_2_1_27_1","first-page":"97","article-title":"Approximation to Bayes risk in repeated play","volume":"3","author":"Hannan James","year":"1957","unstructured":"James Hannan . 1957 . Approximation to Bayes risk in repeated play . Contrib. Theor. Games 3 (1957), 97 -- 139 . James Hannan. 1957. Approximation to Bayes risk in repeated play. Contrib. Theor. Games 3 (1957), 97--139.","journal-title":"Contrib. Theor. Games"},{"key":"e_1_2_1_28_1","volume-title":"Proceedings of the 10th ACM Conference on Economics and Computation (EC\u201909)","author":"Jason","unstructured":"Jason D. Hartline and Tim Roughgarden. 2009. Simple versus optimal mechanisms . In Proceedings of the 10th ACM Conference on Economics and Computation (EC\u201909) . ACM, 225--234. Jason D. Hartline and Tim Roughgarden. 2009. Simple versus optimal mechanisms. In Proceedings of the 10th ACM Conference on Economics and Computation (EC\u201909). ACM, 225--234."},{"key":"e_1_2_1_29_1","first-page":"2903","article-title":"Online submodular minimization","author":"Hazan Elad","year":"2012","unstructured":"Elad Hazan and Satyen Kale . 2012 . Online submodular minimization . J. Mach. Learn. Res. 13 , Oct. (2012), 2903 -- 2922 . Elad Hazan and Satyen Kale. 2012. Online submodular minimization. J. Mach. Learn. Res. 13, Oct. (2012), 2903--2922.","journal-title":"J. Mach. Learn. Res. 13"},{"key":"e_1_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/2897518.2897536"},{"key":"e_1_2_1_31_1","unstructured":"Elad Hazan and Tomer Koren. 2016. Learning in Games with Best-response Oracles (Presentation). Retrieved from https:\/\/simons.berkeley.edu\/sites\/default\/files\/docs\/5595\/koren.pdf.  Elad Hazan and Tomer Koren. 2016. Learning in Games with Best-response Oracles (Presentation). Retrieved from https:\/\/simons.berkeley.edu\/sites\/default\/files\/docs\/5595\/koren.pdf."},{"key":"e_1_2_1_32_1","volume-title":"Proceedings of the 29th Conference on Learning Theory (COLT\u201916)","author":"Hazan Elad","year":"2016","unstructured":"Elad Hazan , Tomer Koren , Roi Livni , and Yishay Mansour . 2016 . Online learning with low rank experts . In Proceedings of the 29th Conference on Learning Theory (COLT\u201916) . 1096--1114. Elad Hazan, Tomer Koren, Roi Livni, and Yishay Mansour. 2016. Online learning with low rank experts. In Proceedings of the 29th Conference on Learning Theory (COLT\u201916). 1096--1114."},{"key":"e_1_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1137\/16M1065719"},{"key":"e_1_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.5555\/1046920.1088694"},{"key":"e_1_2_1_35_1","volume-title":"Proceedings of the 18th Annual Conference on Neural Information Processing Systems (NeurIPS\u201905)","author":"Kakade Sham","year":"2005","unstructured":"Sham Kakade and Adam Tauman Kalai . 2005 . From batch to transductive online learning . In Proceedings of the 18th Annual Conference on Neural Information Processing Systems (NeurIPS\u201905) . 611--618. Sham Kakade and Adam Tauman Kalai. 2005. From batch to transductive online learning. In Proceedings of the 18th Annual Conference on Neural Information Processing Systems (NeurIPS\u201905). 611--618."},{"key":"e_1_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1137\/070701704"},{"key":"e_1_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2004.10.016"},{"key":"e_1_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1006\/inco.1996.2612"},{"key":"e_1_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2003.1238232"},{"key":"e_1_2_1_40_1","volume-title":"Proceedings of the 22nd Annual Conference on Neural Information Processing Systems (NeurIPS\u201908)","author":"Langford John","year":"2008","unstructured":"John Langford and Tong Zhang . 2008 . The epoch-greedy algorithm for multi-armed bandits with side information . In Proceedings of the 22nd Annual Conference on Neural Information Processing Systems (NeurIPS\u201908) . 817--824. John Langford and Tong Zhang. 2008. The epoch-greedy algorithm for multi-armed bandits with side information. In Proceedings of the 22nd Annual Conference on Neural Information Processing Systems (NeurIPS\u201908). 817--824."},{"key":"e_1_2_1_42_1","volume-title":"Proceedings of the 30th Annual IEEE Symposium on Foundations of Computer Science (FOCS\u201989)","author":"Littlestone Nick","unstructured":"Nick Littlestone and Manfred K. Warmuth . 1989. The weighted majority algorithm . In Proceedings of the 30th Annual IEEE Symposium on Foundations of Computer Science (FOCS\u201989) . IEEE, 256--261. Nick Littlestone and Manfred K. Warmuth. 1989. The weighted majority algorithm. In Proceedings of the 30th Annual IEEE Symposium on Foundations of Computer Science (FOCS\u201989). IEEE, 256--261."},{"key":"e_1_2_1_43_1","volume-title":"Proceedings of the 29th Annual Conference on Neural Information Processing Systems (NeurIPS\u201915)","author":"Jamie","unstructured":"Jamie H. Morgenstern and Tim Roughgarden. 2015. On the pseudo-dimension of nearly optimal auctions . In Proceedings of the 29th Annual Conference on Neural Information Processing Systems (NeurIPS\u201915) . 136--144. Jamie H. Morgenstern and Tim Roughgarden. 2015. On the pseudo-dimension of nearly optimal auctions. In Proceedings of the 29th Annual Conference on Neural Information Processing Systems (NeurIPS\u201915). 136--144."},{"key":"e_1_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1287\/moor.6.1.58"},{"key":"e_1_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1613\/jair.2046"},{"key":"e_1_2_1_46_1","volume-title":"Concentration inequalities for Markov chains by Marton couplings and spectral methods. Electron. J. Probab. 20","author":"Paulin Daniel","year":"2015","unstructured":"Daniel Paulin . 2015. Concentration inequalities for Markov chains by Marton couplings and spectral methods. Electron. J. Probab. 20 ( 2015 ). Daniel Paulin. 2015. Concentration inequalities for Markov chains by Marton couplings and spectral methods. Electron. J. Probab. 20 (2015)."},{"key":"e_1_2_1_47_1","volume-title":"Convergence of Stochastic Processes","author":"Pollard David","unstructured":"David Pollard . 2012. Convergence of Stochastic Processes . Springer Science 8 Business Media. David Pollard. 2012. Convergence of Stochastic Processes. Springer Science 8 Business Media."},{"key":"e_1_2_1_48_1","volume-title":"Proceedings of the 33rd International Conference on Machine Learning (ICML\u201916)","author":"Rakhlin Alexander","year":"2016","unstructured":"Alexander Rakhlin and Karthik Sridharan . 2016 . BISTRO: An efficient relaxation-based method for contextual bandits . In Proceedings of the 33rd International Conference on Machine Learning (ICML\u201916) . 1977--1985. Alexander Rakhlin and Karthik Sridharan. 2016. BISTRO: An efficient relaxation-based method for contextual bandits. In Proceedings of the 33rd International Conference on Machine Learning (ICML\u201916). 1977--1985."},{"key":"e_1_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.1145\/2940716.2940723"},{"key":"e_1_2_1_50_1","volume-title":"Proceedings of the 17th ACM Conference on Economics and Computation (EC\u201916)","author":"Roughgarden Tim","unstructured":"Tim Roughgarden and Joshua R. Wang . 2016. Minimizing regret with multiple reserves . In Proceedings of the 17th ACM Conference on Economics and Computation (EC\u201916) . ACM, 601--616. Tim Roughgarden and Joshua R. Wang. 2016. Minimizing regret with multiple reserves. In Proceedings of the 17th ACM Conference on Economics and Computation (EC\u201916). ACM, 601--616."},{"key":"e_1_2_1_51_1","volume-title":"Proceedings of the 20th AAAI Conference on Artificial Intelligence (AAAI\u201905)","author":"Sandholm Tuomas","year":"2005","unstructured":"Tuomas Sandholm , Andrew Gilpin , and Vincent Conitzer . 2005 . Mixed-integer programming methods for finding Nash equilibria . In Proceedings of the 20th AAAI Conference on Artificial Intelligence (AAAI\u201905) . 495--501. Tuomas Sandholm, Andrew Gilpin, and Vincent Conitzer. 2005. Mixed-integer programming methods for finding Nash equilibria. In Proceedings of the 20th AAAI Conference on Artificial Intelligence (AAAI\u201905). 495--501."},{"key":"e_1_2_1_52_1","doi-asserted-by":"publisher","DOI":"10.1145\/544741.544760"},{"key":"e_1_2_1_53_1","volume-title":"Proceedings of the 33rd International Conference on Machine Learning (ICML\u201916)","author":"Syrgkanis Vasilis","unstructured":"Vasilis Syrgkanis , Akshay Krishnamurthy , and Robert E. Schapire . 2016. Efficient algorithms for adversarial contextual learning . In Proceedings of the 33rd International Conference on Machine Learning (ICML\u201916) . 2159--2168. Vasilis Syrgkanis, Akshay Krishnamurthy, and Robert E. Schapire. 2016. Efficient algorithms for adversarial contextual learning. In Proceedings of the 33rd International Conference on Machine Learning (ICML\u201916). 2159--2168."},{"key":"e_1_2_1_54_1","volume-title":"Proceedings of the 30th Annual Conference on Neural Information Processing Systems (NeurIPS\u201916)","author":"Syrgkanis Vasilis","unstructured":"Vasilis Syrgkanis , Haipeng Luo , Akshay Krishnamurthy , and Robert E. Schapire . 2016. Improved regret bounds for oracle-based adversarial contextual bandits . In Proceedings of the 30th Annual Conference on Neural Information Processing Systems (NeurIPS\u201916) . 3135--3143. Vasilis Syrgkanis, Haipeng Luo, Akshay Krishnamurthy, and Robert E. Schapire. 2016. Improved regret bounds for oracle-based adversarial contextual bandits. In Proceedings of the 30th Annual Conference on Neural Information Processing Systems (NeurIPS\u201916). 3135--3143."}],"container-title":["Journal of the ACM"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3402203","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3402203","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3402203","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T22:41:34Z","timestamp":1750200094000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3402203"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,9,29]]},"references-count":53,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2020,10,31]]}},"alternative-id":["10.1145\/3402203"],"URL":"https:\/\/doi.org\/10.1145\/3402203","relation":{},"ISSN":["0004-5411","1557-735X"],"issn-type":[{"value":"0004-5411","type":"print"},{"value":"1557-735X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,9,29]]},"assertion":[{"value":"2019-05-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2020-05-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2020-09-29","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}