{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,23]],"date-time":"2025-08-23T05:24:26Z","timestamp":1755926666072,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":46,"publisher":"ACM","license":[{"start":{"date-parts":[[2022,4,25]],"date-time":"2022-04-25T00:00:00Z","timestamp":1650844800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2022,4,25]]},"DOI":"10.1145\/3485447.3512061","type":"proceedings-article","created":{"date-parts":[[2022,4,25]],"date-time":"2022-04-25T05:13:07Z","timestamp":1650863587000},"page":"162-172","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":6,"title":["The Parity Ray Regularizer for Pacing in Auction Markets"],"prefix":"10.1145","author":[{"given":"Andrea","family":"Celli","sequence":"first","affiliation":[{"name":"Bocconi University, Italy"}]},{"given":"Riccardo","family":"Colini-Baldeschi","sequence":"additional","affiliation":[{"name":"Core Data Science, Meta, United Kingdom"}]},{"given":"Christian","family":"Kroer","sequence":"additional","affiliation":[{"name":"Columbia University, USA"}]},{"given":"Eric","family":"Sodomka","sequence":"additional","affiliation":[{"name":"Core Data Science, Meta, United Kingdom"}]}],"member":"320","published-online":{"date-parts":[[2022,4,25]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/2623330.2623366"},{"key":"e_1_3_2_1_2_1","volume-title":"Proceedings of the twenty-sixth annual ACM-SIAM symposium on Discrete algorithms. SIAM, 1405\u20131424","author":"Agrawal Shipra","year":"2014","unstructured":"Shipra Agrawal and Nikhil\u00a0R Devanur. 2014. Fast algorithms for online stochastic convex programming. In Proceedings of the twenty-sixth annual ACM-SIAM symposium on Discrete algorithms. SIAM, 1405\u20131424."},{"key":"e_1_3_2_1_3_1","volume-title":"Conference on Learning Theory. PMLR, 4\u201318","author":"Agrawal Shipra","year":"2016","unstructured":"Shipra Agrawal, Nikhil\u00a0R Devanur, and Lihong Li. 2016. An efficient algorithm for contextual bandits with knapsacks, and an extension to concave objectives. In Conference on Learning Theory. PMLR, 4\u201318."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.2014.1289"},{"key":"e_1_3_2_1_5_1","unstructured":"Kareem Amin Michael Kearns Peter Key and Anton Schwaighofer. 2012. Budget optimization for sponsored search: Censored learning in mdps. arXiv preprint arXiv:1210.4847(2012)."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1287\/stsy.2018.0028"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"crossref","unstructured":"Vashist Avadhanula Riccardo Colini-Baldeschi Stefano Leonardi Karthik\u00a0Abinav Sankararaman and Okke Schrijvers. 2021. Stochastic Bandits for Multi-platform Budget Optimization in Online Advertising. arXiv preprint arXiv:2103.10246(2021).","DOI":"10.1145\/3442381.3450074"},{"key":"e_1_3_2_1_8_1","volume-title":"Conference on Learning Theory. PMLR, 1109\u20131134","author":"Badanidiyuru Ashwinkumar","year":"2014","unstructured":"Ashwinkumar Badanidiyuru, John Langford, and Aleksandrs Slivkins. 2014. Resourceful contextual bandits. In Conference on Learning Theory. PMLR, 1109\u20131134."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/3038912.3052682"},{"key":"e_1_3_2_1_10_1","unstructured":"Santiago Balseiro Haihao Lu and Vahab Mirrokni. 2020. The Best of Many Worlds: Dual Mirror Descent for Online Allocation Problems. arXiv preprint arXiv:2011.10124(2020)."},{"key":"e_1_3_2_1_11_1","volume-title":"Dual Mirror Descent for Online Allocation Problems. In International Conference on Machine Learning. PMLR, 613\u2013628","author":"Balseiro Santiago","year":"2020","unstructured":"Santiago Balseiro, Haihao Lu, and Vahab Mirrokni. 2020. Dual Mirror Descent for Online Allocation Problems. In International Conference on Machine Learning. PMLR, 613\u2013628."},{"key":"e_1_3_2_1_12_1","unstructured":"Santiago Balseiro Haihao Lu and Vahab Mirrokni. 2020. Regularized Online Allocation Problems: Fairness and Beyond. arXiv preprint arXiv:2007.00514(2020)."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.2014.2022"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.2018.3174"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/1242572.1242644"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-9859-3"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/3328526.3329600"},{"key":"e_1_3_2_1_18_1","unstructured":"Vincent Conitzer Christian Kroer Eric Sodomka and Nicolas\u00a0E. Stier-Moses. 2021. Multiplicative Pacing Equilibria in Auction Markets. Operations Research (to appear)(2021). https:\/\/arxiv.org\/abs\/1706.07151"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/1566374.1566384"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/3284177"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/2229012.2229043"},{"key":"e_1_3_2_1_22_1","volume-title":"Internet advertising and the generalized second-price auction: Selling billions of dollars worth of keywords. American economic review 97, 1","author":"Edelman Benjamin","year":"2007","unstructured":"Benjamin Edelman, Michael Ostrovsky, and Michael Schwarz. 2007. Internet advertising and the generalized second-price auction: Selling billions of dollars worth of keywords. American economic review 97, 1 (2007), 242\u2013259."},{"volume-title":"eMarketer US Digital Ad Spending Update Q2","year":"2020","key":"e_1_3_2_1_23_1","unstructured":"eMarketer. 2020. eMarketer US Digital Ad Spending Update Q2 2020. https:\/\/www.emarketer.com\/content\/us-digital-ad-spending-update-q2-2020. Accessed: 2020-02-03."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-10841-9_34"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2009.72"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/1250910.1250917"},{"key":"e_1_3_2_1_27_1","unstructured":"FICO. 2021. Xpress optimization suite. https:\/\/www.fico.com\/en\/products\/fico-xpress-optimization"},{"key":"e_1_3_2_1_28_1","unstructured":"Lodewijk Gelauff Ashish Goel Kamesh Munagala and Sravya Yandamuri. 2020. Advertising for Demographically Fair Outcomes. arXiv preprint arXiv:2006.03983(2020)."},{"key":"e_1_3_2_1_29_1","unstructured":"Gagan Goel and Aranyak Mehta. 2008. Online budgeted matching in random input models with applications to Adwords.. In SODA Vol.\u00a08. 982\u2013991."},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"crossref","unstructured":"Ramki Gummadi Peter Key and Alexandre Proutiere. 2013. Optimal bidding strategies and equilibria in dynamic auctions with budget constraints. Available at SSRN 2066175(2013).","DOI":"10.2139\/ssrn.2066175"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/1386790.1386794"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.5555\/3215559.3215572"},{"key":"e_1_3_2_1_33_1","unstructured":"Xiaocheng Li Chunlin Sun and Yinyu Ye. 2020. Simple and fast algorithm for binary integer and online linear programming. arXiv preprint arXiv:2003.02513(2020)."},{"key":"e_1_3_2_1_34_1","unstructured":"Xiaocheng Li and Yinyu Ye. 2019. Online linear programming: Dual convergence new algorithms and regret bounds. arXiv preprint arXiv:1909.05499(2019)."},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/2071379.2071381"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/1284320.1284321"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973099.134"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/3351095.3375783"},{"key":"e_1_3_2_1_39_1","unstructured":"Francesco Orabona. 2019. A modern introduction to online learning. arXiv preprint arXiv:1912.13213(2019)."},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"crossref","unstructured":"Hal\u00a0R Varian. 2007. Position auctions. International Journal of industrial Organization 25 6(2007) 1163\u20131178.","DOI":"10.1016\/j.ijindorg.2006.10.002"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/3269206.3271748"},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1145\/2783258.2788615"},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1145\/2835776.2835843"},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1145\/2623330.2623633"},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1145\/2339530.2339716"},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-92185-1_63"}],"event":{"name":"WWW '22: The ACM Web Conference 2022","sponsor":["SIGWEB ACM Special Interest Group on Hypertext, Hypermedia, and Web"],"location":"Virtual Event, Lyon France","acronym":"WWW '22"},"container-title":["Proceedings of the ACM Web Conference 2022"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3485447.3512061","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3485447.3512061","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T19:30:07Z","timestamp":1750188607000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3485447.3512061"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,4,25]]},"references-count":46,"alternative-id":["10.1145\/3485447.3512061","10.1145\/3485447"],"URL":"https:\/\/doi.org\/10.1145\/3485447.3512061","relation":{},"subject":[],"published":{"date-parts":[[2022,4,25]]},"assertion":[{"value":"2022-04-25","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}