On Truthful Item-Acquiring Mechanisms for Reward Maximization
Liang Shan, Shuo Zhang, Jie Zhang, Zihe Wang
Abstract
In this research, we study the problem that a collector acquires items from the owner based on the item qualities the owner declares and an independent appraiser's assessments. The owner is interested in maximizing the probability that the collector acquires the items and is the only one who knows the items' factual quality. The appraiser performs her duties with impartiality, but her assessment may be subject to random noises, so it may not accurately reflect the factual quality of the items. The main challenge lies in devising mechanisms that prompt the owner to reveal accurate information, thereby optimizing the collector's expected reward. We consider the menu size of mechanisms as a measure of their practicability and study its impact on the attainable expected reward. For the single-item setting, we design optimal mechanisms with a monotone increasing menu size. Although the reward gap between the simplest and optimal mechanisms is bounded, we show that simple mechanisms with a small menu size cannot ensure any positive fraction of the optimal reward of mechanisms with a larger menu size. For the multi-item setting, we show that an ordinal mechanism that only takes the owner's ordering of the items as input is not incentive-compatible. We then propose a set of Union mechanisms that combine single-item mechanisms. Moreover, we run experiments to examine these mechanisms' robustness against the independent appraiser's assessment accuracy and the items' acquiring rate.
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.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext 02bed6e7-56ab-4760-8a9f-32a811314d27Builds on4
- A Novice-Reviewer Experiment to Address Scarcity of Qualified Reviewers in Large ConferencesIvan Stelmakh, Nihar B. Shah, Aarti Singh, Hal Daumé IIIAAAI 2021 · 37 citations
- Dominantly Truthful Multi-task Peer Prediction with a Constant Number of TasksYuqing KongSODA 2020 · 33 citations
- A Market-Inspired Bidding Scheme for Peer Review Paper AssignmentReshef Meir, Jérôme Lang, Julien Lesca, Nicholas Mattei et al.AAAI 2021 · 33 citations
- You Are the Best Reviewer of Your Own Papers: An Owner-Assisted Scoring MechanismWeijie J. SuNeurIPS 2021 · 32 citations
Related papers
- Optimal Mechanism in a Dynamic Stochastic Knapsack EnvironmentJihyeok Jung, Chan-Oi Song, Deok-Joo Lee, Kiho YoonAAAI 2024 · 1 citation
- Plant-and-Steal: Truthful Fair Allocations via PredictionsIlan Reuven Cohen, Alon Eden, Talya Eden, Arsen VasilyanNeurIPS 2024 · 9 citations
- Bilateral Trade with Correlated ValuesShahar Dobzinski, Ariel ShaulkerSTOC 2024 · 2 citations
- Online Mechanism Design for Information AcquisitionFederico Cacciamani, Matteo Castiglioni, Nicola GattiICML 2023 · 3 citations
- Majorized Bayesian Persuasion and Fair SelectionSiddhartha Banerjee, Kamesh Munagala, Yiheng Shen, Kangning WangSODA 2025 · 1 citation
