arrow
返回

Diffusion auction design

delete2022-02-01
delete12
PRE
AI
B
Bin Li
D
Dong Hao *
H
Hui Gao
D
Dengji Zhao *
DOI:10.1016/j.artint.2021.103631delete
delete原文链接
delete原文求助
delete分享
delete收藏
摘要

摘要

En 中文
This paper studies an auction design problem for a seller to sell a single commodity in a social network, where each individual (the seller or a buyer) can only communicate with her neighbors. The challenge is to design a mechanism to incentivize the buyers, who are aware of the auction, to further propagate the information to their neighbors, so that more buyers can participate in the auction and hence, the seller will be able to make a higher revenue and a higher welfare. We build a general framework for this new scenario and propose several novel diffusion auctions, which not only incentivize the buyers to report their valuations on the commodity truthfully, but also to propagate the auction information to all their neighbors. Particularly, the direct extension of the well-known Vickrey-Clarke-Groves (VCG) mechanism on social networks can have the incentives, but it will decrease the seller's revenue or even lead to a deficit. We also show that in the social network setting all efficient mechanisms that are individually rational and incentive compatible can lead to a deficit. The goal in this article is to increase the seller's revenue by attracting more buyers, so we give up welfare maximization and propose a class of mechanisms called critical diffusion mechanisms. It is proved that both the seller's revenue and the social welfare achieved in critical diffusion mechanisms are not less than that given in the VCG mechanism before attracting new buyers. The intuition behind the proposed mechanisms is that buyers who join the mechanism earlier have higher priorities to buy the commodity. If a buyer does not win the commodity because of her propagation, then she will be compensated. The formalization of the problem has not been well-studied in the literature of mechanism design, and there are many open problems worth further investigation. The study of this problem will provide insights for the emerging market based on the participants' recommendations via their social networks. (C) 2021 Elsevier B.V. All rights reserved.
Keyword:
Mechanism design
Auction
Information diffusion
Social network
Revenue optimization

期刊

Artificial Intelligence Review 封面图
Artificial Intelligence Review
IF:
13.9
论文数:
6.1K
被引数:
1.9W

机构

S
ShanghaiTech University
学者数:
9.7K
论文数: 5.9K
被引数: 1.6W
引用论文

引用论文

err分享
err收藏
Revenue monotonicity in deterministic, dominant-strategy combinatorial auctions
err2011-02-01
err14
errOAAI
errRastegari, Baharak; Condon, Anne; Leyton-Brown, Kevin
err分享
err收藏
err分享
err收藏
Imaging single metal-nanoparticles in cells by photothermal interference contrast
err2003-06-19
err0
PREAI
errDavid Boyer; Philippe Tamarat; Laurent Cognet; Michel Orrit; Brahim Lounis
err分享
err收藏
A novel method for isolating spermatid nuclei from cytoplasm prior to ROSI in the mouse
err2005-02-04
err0
PREAI
errSatoshi Kishigami; Nguyen Van Thuan; Sayaka Wakayama; Takafusa Hikichi; Teruhiko Wakayama
err分享
err收藏
Targeted Molecular and Immunohistochemical Analyses of Endometrial Clear Cell Carcinoma Show that POLE Mutations and DNA Mismatch Repair Protein Deficiencies Are Uncommon
err2019-04-01
err0
PREAI
errNick Baniak; Oluwole Fadare; Martin Köbel; John DeCoteau; Vinita Parkash; Jonathan L. Hecht; Krisztina Z. Hanley; Katja Gwin; Wenxin Zheng; Charles M. Quick; Elke A. Jarboe; Sharon X. Liang; Mary Kinloch
err分享
err收藏
学者 查看更多内容