{"about":{"site":"https://codewithpapers.app","non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page"},"url":"/paper/i-will-have-order-optimizing-orders-for-fair","title":"I Will Have Order! Optimizing Orders for Fair Reviewer Assignment","arxiv_id":"2108.02126","date":"2021-08-04","proceeding":null,"authors":["Justin Payan","Yair Zick"],"abstract":"We present fast, fair, flexible, and welfare efficient algorithms for assigning reviewers to submitted conference papers. Our approaches extend picking sequence mechanisms, standard tools from the fair allocation literature to ensure approximate envy-freeness (typically envy-freeness up to one item, or EF1). However, fairness often comes at the cost of decreased efficiency. To overcome this challenge, we carefully select approximately optimal picking sequence orders. Applying a relaxation of submodularity, $\\gamma$-weak submodularity, we show our Greedy Reviewer Round Robin (GRRR) approach is EF1 and yields a ${(1+\\gamma)}$-approximation to the maximum welfare attainable by a round-robin picking sequence mechanism under any order. We present a weighted picking sequence mechanism called FairSequence that targets the Weighted EF1 criterion to offer fairness in a more general setting. Using data from three conferences, we show that FairSequence runs an order of magnitude faster and provides approximate envy-freeness guarantees that are violated by existing approaches. Its simple design also makes it very flexible to new assignment constraints. FairSequence is available in the OpenReview conference management platform, giving conference organizers access to faster reviewer assignment with high welfare and envy-freeness guarantees.","url_abs":"https://arxiv.org/abs/2108.02126v2","url_pdf":"https://arxiv.org/pdf/2108.02126v2.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"links_only","authors_date_abstract":"arXiv metadata, CC0 1.0 (https://info.arxiv.org/help/license), from the Kaggle arXiv metadata snapshot of 2026-09-12"},"code_links":[{"paper_slug":"i-will-have-order-optimizing-orders-for-fair","repo_url":"https://github.com/justinpayan/ReviewerAssignmentCode","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"none","reach":null},{"paper_slug":"i-will-have-order-optimizing-orders-for-fair","repo_url":"https://github.com/openreview/openreview-matcher","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"none","reach":{"status":"ok"}}],"tasks":[],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"atlas_url":"https://app.syntology.ai/?focus=2108.02126","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2108.02126"}},"developers":"https://syntology.ai/developers","read_at":"2026-09-24T18:15:14+00:00","read_at_is":"when the build read Syntology's graph, not when any sample ran","claim":"Per-sample execution status on synthesized fixtures; not a correctness claim about the paper. Samples come from repositories linked to the paper, official or community; repo_kind says which.","repos":[{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/openreview/openreview-matcher","reach":{"status":"ok"}},{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/justinpayan/ReviewerAssignmentCode","reach":null}],"summary":{"unverified":3},"by_repo_kind":{"official":{"samples":3,"ran":0,"repositories":1}},"repo_kind_vocabulary":{"official":"The archive marks this repository official for the paper","named_in_paper":"The archive records that the paper mentions this repository; it is not marked official","listed":"In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper","found_in_text":"Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted","community":"Not in the archive's code links for this paper; a community repository Syntology harvested"},"n_pointer_only_for_licence":0,"samples":[{"code_sha256_prefix":"55301918d31d59f7","entry":"compute_usw","repo":"justinpayan/ReviewerAssignmentCode","repo_kind":"official","path":"greedy_reviewer_round_robin.py","file_url":"https://github.com/justinpayan/ReviewerAssignmentCode/blob/HEAD/greedy_reviewer_round_robin.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"55301918d31d59f7"}},{"code_sha256_prefix":"073ef70ee3d1632c","entry":"greedy","repo":"justinpayan/ReviewerAssignmentCode","repo_kind":"official","path":"greedy_reviewer_round_robin.py","file_url":"https://github.com/justinpayan/ReviewerAssignmentCode/blob/HEAD/greedy_reviewer_round_robin.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"073ef70ee3d1632c"}},{"code_sha256_prefix":"894cf67073f22451","entry":"run_algo","repo":"justinpayan/ReviewerAssignmentCode","repo_kind":"official","path":"greedy_reviewer_round_robin.py","file_url":"https://github.com/justinpayan/ReviewerAssignmentCode/blob/HEAD/greedy_reviewer_round_robin.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"894cf67073f22451"}}]},"arxiv_metadata":null,"syntology_extracted_results":null}