{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,27]],"date-time":"2025-07-27T07:15:36Z","timestamp":1753600536449,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":24,"publisher":"ACM","license":[{"start":{"date-parts":[[2021,7,18]],"date-time":"2021-07-18T00:00:00Z","timestamp":1626566400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["2045347"],"award-info":[{"award-number":["2045347"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2021,7,18]]},"DOI":"10.1145\/3465456.3467635","type":"proceedings-article","created":{"date-parts":[[2021,7,18]],"date-time":"2021-07-18T10:28:45Z","timestamp":1626604125000},"page":"479-496","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["Efficient Competitions and Online Learning with Strategic Forecasters"],"prefix":"10.1145","author":[{"given":"Rafael","family":"Frongillo","sequence":"first","affiliation":[{"name":"University of Colorado Boulder, Boulder, CO, USA"}]},{"given":"Robert","family":"Gomez","sequence":"additional","affiliation":[{"name":"University of Colorado Boulder, Boulder, CO, USA"}]},{"given":"Anish","family":"Thilagar","sequence":"additional","affiliation":[{"name":"University of Colorado Boulder, Boulder, CO, USA"}]},{"given":"Bo","family":"Waggoner","sequence":"additional","affiliation":[{"name":"University of Colorado Boulder, Boulder, CO, USA"}]}],"member":"320","published-online":{"date-parts":[[2021,7,18]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Chansoo Lee, Audra McMillan, and Ambuj Tewari.","author":"Abernethy Jacob","year":"2017","unstructured":"Jacob Abernethy , Young Hun Jung , Chansoo Lee, Audra McMillan, and Ambuj Tewari. 2017 . Online learning via the differential privacy lens. arXiv preprint arXiv:1711.10019 (2017). Jacob Abernethy, Young Hun Jung, Chansoo Lee, Audra McMillan, and Ambuj Tewari. 2017. Online learning via the differential privacy lens. arXiv preprint arXiv:1711.10019 (2017)."},{"key":"e_1_3_2_1_2_1","volume-title":"A Prediction Tournament Paradox. The American Statistician","author":"Aldous David J","year":"2019","unstructured":"David J Aldous . 2019. A Prediction Tournament Paradox. The American Statistician ( 2019 ), 1--6. David J Aldous. 2019. A Prediction Tournament Paradox. The American Statistician (2019), 1--6."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1175\/1520-0493(1950)078<0001:VOFEIT>2.0.CO;2"},{"key":"e_1_3_2_1_4_1","unstructured":"Hybrid Forecasting Competition. 2019. https:\/\/www.hybridforecasting.com\/. Accessed: 6\/29\/2019.  Hybrid Forecasting Competition. 2019. https:\/\/www.hybridforecasting.com\/. Accessed: 6\/29\/2019."},{"key":"e_1_3_2_1_5_1","first-page":"3","article-title":"The algorithmic foundations of differential privacy","volume":"9","author":"Dwork Cynthia","year":"2014","unstructured":"Cynthia Dwork , Aaron Roth , 2014 . The algorithmic foundations of differential privacy . Foundations and Trends in Theoretical Computer Science , Vol. 9 , 3 -- 4 (2014), 211--407. Cynthia Dwork, Aaron Roth, et al. 2014. The algorithmic foundations of differential privacy. Foundations and Trends in Theoretical Computer Science, Vol. 9, 3--4 (2014), 211--407.","journal-title":"Foundations and Trends in Theoretical Computer Science"},{"key":"e_1_3_2_1_6_1","volume-title":"Proceedings of the 37th International Conference on Machine Learning (Proceedings of Machine Learning Research), Hal Daum\u00e9 III and Aarti Singh (Eds.)","volume":"119","author":"Freeman Rupert","year":"2020","unstructured":"Rupert Freeman , David Pennock , Chara Podimata , and Jennifer Wortman Vaughan . 2020 . No-Regret and Incentive-Compatible Online Learning . In Proceedings of the 37th International Conference on Machine Learning (Proceedings of Machine Learning Research), Hal Daum\u00e9 III and Aarti Singh (Eds.) , Vol. 119 . PMLR, 3270--3279. http:\/\/proceedings.mlr.press\/v119\/freeman20a.html Rupert Freeman, David Pennock, Chara Podimata, and Jennifer Wortman Vaughan. 2020. No-Regret and Incentive-Compatible Online Learning. In Proceedings of the 37th International Conference on Machine Learning (Proceedings of Machine Learning Research), Hal Daum\u00e9 III and Aarti Singh (Eds.), Vol. 119. PMLR, 3270--3279. http:\/\/proceedings.mlr.press\/v119\/freeman20a.html"},{"key":"e_1_3_2_1_7_1","volume-title":"Efficient Competitions and Online Learning with Strategic Forecasters. arXiv preprint arXiv:2102.08358","author":"Frongillo Rafael","year":"2021","unstructured":"Rafael Frongillo , Robert Gomez , Anish Thilagar , and Bo Waggoner . 2021. Efficient Competitions and Online Learning with Strategic Forecasters. arXiv preprint arXiv:2102.08358 ( 2021 ). Rafael Frongillo, Robert Gomez, Anish Thilagar, and Bo Waggoner. 2021. Efficient Competitions and Online Learning with Strategic Forecasters. arXiv preprint arXiv:2102.08358 (2021)."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1198\/016214506000001437"},{"key":"e_1_3_2_1_9_1","volume-title":"Introduction to online convex optimization. arXiv preprint arXiv:1909.05207","author":"Hazan Elad","year":"2019","unstructured":"Elad Hazan . 2019. Introduction to online convex optimization. arXiv preprint arXiv:1909.05207 ( 2019 ). Elad Hazan. 2019. Introduction to online convex optimization. arXiv preprint arXiv:1909.05207 (2019)."},{"key":"e_1_3_2_1_10_1","unstructured":"Kaggle. [n.d.]. https:\/\/www.kaggle.com\/ year=2021 note = Accessed: 2\/11\/2021 .  Kaggle. [n.d.]. https:\/\/www.kaggle.com\/ year=2021 note = Accessed: 2\/11\/2021 ."},{"volume-title":"1st Place Winner's Interview: Andrew Landgraf","key":"e_1_3_2_1_11_1","unstructured":"Kaggle. 2017. March Machine Learning Mania , 1st Place Winner's Interview: Andrew Landgraf . http:\/\/blog.kaggle.com\/2017\/05\/19\/march-machine-learning-mania-1st-place-winners-interview-andrew-landgraf\/. Accessed: 6\/29\/2019. Kaggle. 2017. March Machine Learning Mania, 1st Place Winner's Interview: Andrew Landgraf. http:\/\/blog.kaggle.com\/2017\/05\/19\/march-machine-learning-mania-1st-place-winners-interview-andrew-landgraf\/. Accessed: 6\/29\/2019."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2004.10.016"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/1386790.1386820"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.1070.0729"},{"key":"e_1_3_2_1_15_1","volume-title":"Constant regret, generalized mixability, and mirror descent. arXiv preprint arXiv:1802.06965","author":"Mhammedi Zakaria","year":"2018","unstructured":"Zakaria Mhammedi and Robert C Williamson . 2018. Constant regret, generalized mixability, and mirror descent. arXiv preprint arXiv:1802.06965 ( 2018 ). Zakaria Mhammedi and Robert C Williamson. 2018. Constant regret, generalized mixability, and mirror descent. arXiv preprint arXiv:1802.06965 (2018)."},{"volume-title":"Foundations of machine learning","author":"Mohri Mehryar","key":"e_1_3_2_1_16_1","unstructured":"Mehryar Mohri , Afshin Rostamizadeh , and Ameet Talwalkar . 2018. Foundations of machine learning . MIT press . Mehryar Mohri, Afshin Rostamizadeh, and Ameet Talwalkar. 2018. Foundations of machine learning .MIT press."},{"volume-title":"Convex functions and their applications","author":"Niculescu Constantin","key":"e_1_3_2_1_17_1","unstructured":"Constantin Niculescu and Lars-Erik Persson . 2006. Convex functions and their applications . Springer . Constantin Niculescu and Lars-Erik Persson. 2006. Convex functions and their applications .Springer."},{"key":"e_1_3_2_1_18_1","unstructured":"ProbabilitySports. 2019. http:\/\/www.probabilitysports.com\/. Accessed: 6\/29\/2019.  ProbabilitySports. 2019. http:\/\/www.probabilitysports.com\/. Accessed: 6\/29\/2019."},{"key":"e_1_3_2_1_19_1","unstructured":"Good Judgement Project. 2019. https:\/\/goodjudgment.com\/. Accessed: 6\/29\/2019.  Good Judgement Project. 2019. https:\/\/goodjudgment.com\/. Accessed: 6\/29\/2019."},{"volume-title":"Convex analysis","author":"Rockafeller R. Tyrrell","key":"e_1_3_2_1_20_1","unstructured":"R. Tyrrell Rockafeller . 1997. Convex analysis . Princeton University Press . R. Tyrrell Rockafeller. 1997. Convex analysis .Princeton University Press."},{"key":"e_1_3_2_1_21_1","volume-title":"Online prediction with selfish experts. arXiv preprint arXiv:1702.03615","author":"Roughgarden Tim","year":"2017","unstructured":"Tim Roughgarden and Okke Schrijvers . 2017. Online prediction with selfish experts. arXiv preprint arXiv:1702.03615 ( 2017 ). Tim Roughgarden and Okke Schrijvers. 2017. Online prediction with selfish experts. arXiv preprint arXiv:1702.03615 (2017)."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1561\/9781601985477"},{"key":"e_1_3_2_1_23_1","unstructured":"Jens Witkowski Rupert Freeman Jennifer Wortman Vaughan David M Pennock and Andreas Krause. [n.d.]. Incentive-Compatible Forecasting Competitions. arXiv preprint arXiv:2101.01816 ([n. d.]).  Jens Witkowski Rupert Freeman Jennifer Wortman Vaughan David M Pennock and Andreas Krause. [n.d.]. Incentive-Compatible Forecasting Competitions. arXiv preprint arXiv:2101.01816 ([n. d.])."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v32i1.11471"}],"event":{"name":"EC '21: The 22nd ACM Conference on Economics and Computation","sponsor":["SIGecom Special Interest Group on Economics and Computation"],"location":"Budapest Hungary","acronym":"EC '21"},"container-title":["Proceedings of the 22nd ACM Conference on Economics and Computation"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3465456.3467635","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3465456.3467635","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3465456.3467635","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T20:17:28Z","timestamp":1750191448000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3465456.3467635"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,7,18]]},"references-count":24,"alternative-id":["10.1145\/3465456.3467635","10.1145\/3465456"],"URL":"https:\/\/doi.org\/10.1145\/3465456.3467635","relation":{},"subject":[],"published":{"date-parts":[[2021,7,18]]},"assertion":[{"value":"2021-07-18","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}