Optimal Mechanism Design with Referral

This paper establishes the optimal selling mechanism when a seller can incentivize an existing buyer to refer his privately known potential buyer to participate. We identify three optimal channels for providing referral incentives. First, if the existing buyer declares that no potential buyer exists, his virtual value is penalized. Second, if the existing buyer refers the potential buyer to the seller, his virtual value is boosted. Third, in some scenarios where this carrots-and-sticks-via-virtual-value approach is insufficient for creating proper referral incentives, the existing buyer is then given a constant referral bonus for referring the potential buyer. We also provide conditions under which the optimal mechanism can be implemented using simple mechanisms. Finally, we demonstrate that the conventional resale mechanism is suboptimal. This paper was accepted by Itai Ashlagi, revenue management and market analytics. Funding: H. Zhou’s research is supported by the Chenguang Program of Shanghai Education Development Foundation and Shanghai Municipal Education Commission [Grant 22CGA77]. Supplemental Material: The online appendix is available at https://doi.org/10.1287/mnsc.2023.01540 .

Authors

Institutions

Publication Details

Journal
Management Science
Published
2024-08-19
DOI
https://doi.org/10.1287/mnsc.2023.01540
Citations
1
Primary Topic
Auction Theory and Applications
Type
article
Field-Weighted Citation Impact
0.49
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Optimal Mechanism Design with Referral

Jun Zhang, Hao Zhou
1 citations
Management Science
Auction Theory and Applications
0.49
article

Optimal Mechanism Design with Referral

Jun Zhang, Hao Zhou
article en
1 citations

Abstract

This paper establishes the optimal selling mechanism when a seller can incentivize an existing buyer to refer his privately known potential buyer to participate. We identify three optimal channels for providing referral incentives. First, if the existing buyer declares that no potential buyer exists, his virtual value is penalized. Second, if the existing buyer refers the potential buyer to the seller, his virtual value is boosted. Third, in some scenarios where this carrots-and-sticks-via-virtual-value approach is insufficient for creating proper referral incentives, the existing buyer is then given a constant referral bonus for referring the potential buyer. We also provide conditions under which the optimal mechanism can be implemented using simple mechanisms. Finally, we demonstrate that the conventional resale mechanism is suboptimal. This paper was accepted by Itai Ashlagi, revenue management and market analytics. Funding: H. Zhou’s research is supported by the Chenguang Program of Shanghai Education Development Foundation and Shanghai Municipal Education Commission [Grant 22CGA77]. Supplemental Material: The online appendix is available at https://doi.org/10.1287/mnsc.2023.01540 .

Management ScienceVol. 71(5)
University of Technology Sydney (AU), Zhejiang University of Finance and Economics (CN)
Openalex Percentile: Top 32%
Auction Theory and Applications
0.49
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Optimal Mechanism Design with Referral — Jun Zhang, Hao Zhou · Management Science (2024) | TGRS Research Map | TGRS