A Market-Inspired Bidding Scheme for Peer Review Paper Assignment
Reshef Meir, Jérôme Lang, Julien Lesca, Nicholas Mattei, Natan Kaminsky
Abstract
We propose a market-inspired bidding scheme for the assignment of paper reviews in large academic conferences. We provide an analysis of the incentives of reviewers during the bidding phase, when reviewers have both private costs and some information about the demand for each paper; and their goal is to obtain the best possible k papers for a predetermined k.
We show that by assigning budgets' to reviewers and a price' for every paper that is (roughly) proportional to its demand, the best response of a reviewer is to bid sincerely, i.e., on her most favorite papers, and match the budget even when it is not enforced. This game-theoretic analysis is based on a simple, prototypical assignment algorithm.
We show via extensive simulations on bidding data from real conferences, that our bidding scheme would substantially improve both the bid distribution and the resulting assignment.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Cited by top-tier papers4
- Repeated Fair Allocation of Indivisible ItemsAyumi Igarashi, Martin Lackner, Oliviero Nardi, Arianna NovaroAAAI 2024 · 24 citations
- Eliciting Honest Information from Authors Using Sequential ReviewYichi Zhang, Grant Schoenebeck, Weijie SuAAAI 2024 · 1 citation
- On Truthful Item-Acquiring Mechanisms for Reward MaximizationLiang Shan, Shuo Zhang, Jie Zhang, Zihe WangWWW 2024
- The Publication Choice ProblemHaichuan Wang, Yifan Wu, Haifeng XuAAAI 2026
Related papers
- Making Paper Reviewing Robust to Bid Manipulation AttacksRuihan Wu, Chuan Guo, Felix Wu, Rahul Kidambi et al.ICML 2021 · 27 citations
- A Dataset on Malicious Paper Bidding in Peer ReviewSteven Jecmen, Minji Yoon, Vincent Conitzer, Nihar B. Shah et al.WWW 2023 · 22 citations
- Allocating Chores with Restricted Additive Costs: Achieving EFX, MMS, and Efficiency SimultaneouslyZehan Lin, Xiaowei Wu, Shengwei ZhouWWW 2026
- A One-Size-Fits-All Approach to Improving Randomness in Paper AssignmentYixuan Even Xu, Steven Jecmen, Zimeng Song, Fei FangNeurIPS 2023 · 11 citations
- Vulnerability of Text-Matching in ML/AI Conference Reviewer Assignments to CollusionsJhih-Yi Hsieh, Aditi Raghunathan, Nihar B. ShahUSENIX Security 2025
