{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,15]],"date-time":"2026-04-15T15:54:53Z","timestamp":1776268493476,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":30,"publisher":"ACM","license":[{"start":{"date-parts":[[2019,7,25]],"date-time":"2019-07-25T00:00:00Z","timestamp":1564012800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000879","name":"Alfred P. Sloan Foundation","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100000879","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100006785","name":"Google","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100006785","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","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":[[2019,7,25]]},"DOI":"10.1145\/3292500.3330899","type":"proceedings-article","created":{"date-parts":[[2019,7,26]],"date-time":"2019-07-26T13:17:26Z","timestamp":1564147046000},"page":"1247-1257","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":31,"title":["Paper Matching with Local Fairness Constraints"],"prefix":"10.1145","author":[{"given":"Ari","family":"Kobren","sequence":"first","affiliation":[{"name":"University of Massachusetts Amherst, Amherst, MA, USA"}]},{"given":"Barna","family":"Saha","sequence":"additional","affiliation":[{"name":"University of Massachusetts Amherst, Amherst, MA, USA"}]},{"given":"Andrew","family":"McCallum","sequence":"additional","affiliation":[{"name":"University of Massachusetts Amherst, Amherst, MA, USA"}]}],"member":"320","published-online":{"date-parts":[[2019,7,25]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"C. F. Camerer and E. J. Johnson. 1997. 10 The process-performance paradox in expert judgment: How can experts know so much and predict so badly? Research on judgment and decision making: Currents connections and controversies (1997).  C. F. Camerer and E. J. Johnson. 1997. 10 The process-performance paradox in expert judgment: How can experts know so much and predict so badly? Research on judgment and decision making: Currents connections and controversies (1997)."},{"key":"e_1_3_2_1_2_1","unstructured":"L. Charlin and R. S. Zemel. 2013. The Toronto paper matching system: an automated paper-reviewer assignment system. In ICML .  L. Charlin and R. S. Zemel. 2013. The Toronto paper matching system: an automated paper-reviewer assignment system. In ICML ."},{"key":"e_1_3_2_1_3_1","volume-title":"A framework for optimizing paper matching. arXiv preprint arXiv:1202.3706","author":"Charlin Laurent","year":"2012"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1639714.1639787"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/133160.133205"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2007.02.056"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"crossref","unstructured":"N. Garg T. Kavitha A. Kumar K. Mehlhorn and J. Mestre. 2010. Assigning papers to referees. Algorithmica (2010).  N. Garg T. Kavitha A. Kumar K. Mehlhorn and J. Mestre. 2010. Assigning papers to referees. Algorithmica (2010).","DOI":"10.1007\/s00453-009-9386-0"},{"key":"e_1_3_2_1_8_1","volume-title":"The AI conference paper assignment problem. In AAAI Workshop on Preference Handling for Artificial Intelligence, Vancouver .","author":"Goldsmith J."},{"key":"e_1_3_2_1_9_1","volume-title":"Gurobi Optimization","author":"Inc.","year":"2015"},{"key":"e_1_3_2_1_10_1","volume-title":"The conference paper-reviewer assignment problem. Decision Sciences","author":"Hartvigsen D.","year":"1999"},{"key":"e_1_3_2_1_11_1","volume-title":"Expertise and decision under uncertainty: Performance and process. The nature of expertise","author":"Johnson Eric J","year":"1988"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"crossref","unstructured":"P. E. Johnson F. Hassebrock A. S. Dur\u00e1n and J. H. Moller. 1982. Multimethod study of clinical judgment. Organizational behavior and human performance .  P. E. Johnson F. Hassebrock A. S. Dur\u00e1n and J. H. Moller. 1982. Multimethod study of clinical judgment. Organizational behavior and human performance .","DOI":"10.1016\/0030-5073(82)90218-5"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/1645953.1646207"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/2723372.2723727"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.14778\/2824032.2824084"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"crossref","unstructured":"X. Li and T. Watanabe. 2013. Automatic paper-to-reviewer assignment based on the matching degree of the reviewers. Procedia Computer Science (2013).  X. Li and T. Watanabe. 2013. Automatic paper-to-reviewer assignment based on the matching degree of the reviewers. Procedia Computer Science (2013).","DOI":"10.1016\/j.procs.2013.09.144"},{"key":"e_1_3_2_1_17_1","volume-title":"The conference paper assignment problem: Using order weighted averages to assign indivisible goods. In AAAI Conference on Artificial Intelligence .","author":"Lian J. W."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/2645710.2645749"},{"key":"e_1_3_2_1_19_1","volume-title":"On Good and Fair Paper-Reviewer Assignment. In International Conference on Data Mining .","author":"Long C."},{"key":"e_1_3_2_1_20_1","volume-title":"Conference paper assignment using a combined greedy\/evolutionary algorithm. In International Conference on Parallel Problem Solving from Nature .","author":"Merelo-Guerv\u00f3s J. J."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/1281192.1281247"},{"key":"e_1_3_2_1_22_1","unstructured":"R. O'Dell M. Wattenhofer and R. Wattenhofer. 2005. The paper assignment problem. Technical report\/Swiss Federal Institute of Technology Zurich Department of Computer Science (2005).  R. O'Dell M. Wattenhofer and R. Wattenhofer. 2005. The paper assignment problem. Technical report\/Swiss Federal Institute of Technology Zurich Department of Computer Science (2005)."},{"key":"e_1_3_2_1_23_1","unstructured":"Eric Price. 2014. The NIPS Experiment. http:\/\/blog.mrtz.org\/2014\/12\/15\/the-nips-experiment.html. Guest Post.  Eric Price. 2014. The NIPS Experiment. http:\/\/blog.mrtz.org\/2014\/12\/15\/the-nips-experiment.html. Guest Post."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/1458082.1458127"},{"key":"e_1_3_2_1_25_1","first-page":"9","article-title":"2000. Reproducibility of peer review in clinical neuroscience","volume":"123","author":"Rothwell P. M.","year":"2000","journal-title":"Brain"},{"key":"e_1_3_2_1_26_1","unstructured":"I. Stelmakh N. B. Shah and A. Singh. 2018. PeerReview4All: Fair and Accurate Reviewer Assignment in Peer Review. arXiv:1806.06237 (2018).  I. Stelmakh N. B. Shah and A. Singh. 2018. PeerReview4All: Fair and Accurate Reviewer Assignment in Peer Review. arXiv:1806.06237 (2018)."},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1109\/WI-IAT.2010.133"},{"key":"e_1_3_2_1_28_1","volume-title":"On the Optimal Assignment of Conference Papers to Reviewers . Technical Report.","author":"Taylor C. J.","year":"2008"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"crossref","volume-title":"Approximation algorithms","author":"Vazirani V. V.","DOI":"10.1007\/978-3-662-04565-7"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-69052-8_75"}],"event":{"name":"KDD '19: The 25th ACM SIGKDD Conference on Knowledge Discovery and Data Mining","location":"Anchorage AK USA","acronym":"KDD '19","sponsor":["SIGMOD ACM Special Interest Group on Management of Data","SIGKDD ACM Special Interest Group on Knowledge Discovery in Data"]},"container-title":["Proceedings of the 25th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3292500.3330899","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3292500.3330899","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3292500.3330899","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T00:26:03Z","timestamp":1750206363000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3292500.3330899"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,7,25]]},"references-count":30,"alternative-id":["10.1145\/3292500.3330899","10.1145\/3292500"],"URL":"https:\/\/doi.org\/10.1145\/3292500.3330899","relation":{},"subject":[],"published":{"date-parts":[[2019,7,25]]},"assertion":[{"value":"2019-07-25","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}