Incentive-Compatible Diffusion Auctions

被引:0
|
作者
Li, Bin [1 ]
Hao, Dong [1 ]
Zhao, Dengji [2 ]
机构
[1] Univ Elect Sci & Technol China, Sch Comp Sci & Engn, Chengdu, Peoples R China
[2] ShanghaiTech Univ, Shanghai Engn Res Ctr Intelligent Vis & Imaging, Shanghai, Peoples R China
关键词
TRUTHFUL APPROXIMATION MECHANISMS; ALGORITHM;
D O I
暂无
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Diffusion auction is a new model in auction design. It can incentivize the buyers who have already joined in the auction to further diffuse the sale information to others via social relations, whereby both the seller's revenue and the social welfare can be improved. Diffusion auctions are essentially nontypical multidimensional mechanism design problems and agents' social relations are complicatedly involved with their bids. In such auctions, incentive-compatibility (IC) means it is best for every agent to honestly report her valuation and fully diffuse the sale information to all her neighbors. Existing work identified some specific mechanisms for diffusion auctions, while a general theory characterizing all incentive-compatible diffusion auctions is still missing. In this work, we identify a sufficient and necessary condition for all dominant-strategy incentive-compatible (DSIC) diffusion auctions. We formulate the monotonic allocation policies in such multidimensional problems and show that any monotonic allocation policy can be implemented in a DSIC diffusion auction mechanism. Moreover, given any monotonic allocation policy, we obtain the optimal payment policy to maximize the seller's revenue.
引用
收藏
页码:231 / 237
页数:7
相关论文
共 50 条
  • [1] Incentive-Compatible Diffusion
    Babichenko, Yakov
    Dean, Oren
    Tennenholtz, Moshe
    WEB CONFERENCE 2018: PROCEEDINGS OF THE WORLD WIDE WEB CONFERENCE (WWW2018), 2018, : 1379 - 1388
  • [2] Incentive-compatible online auctions for digital goods
    Bar-Yossef, Z
    Hildrum, K
    Wu, F
    PROCEEDINGS OF THE THIRTEENTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2002, : 964 - 970
  • [3] Incentive-Compatible Learning of Reserve Prices for Repeated Auctions
    Kanoria, Yash
    Nazerzadeh, Hamid
    OPERATIONS RESEARCH, 2021, 69 (02) : 509 - 524
  • [4] Incentive-Compatible Learning of Reserve Prices for Repeated Auctions
    Kanoria, Yash
    Nazerzadeh, Hamid
    COMPANION OF THE WORLD WIDE WEB CONFERENCE (WWW 2019 ), 2019, : 932 - 933
  • [5] Online incentive-compatible mechanisms for traffic intersection auctions
    Rey, David
    Levin, Michael W.
    Dixit, Vinayak V.
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2021, 293 (01) : 229 - 247
  • [6] On incentive-compatible estimators
    Eliaz, Kfir
    Spiegler, Ran
    GAMES AND ECONOMIC BEHAVIOR, 2022, 132 : 204 - 220
  • [7] Incentive-Compatible Classification
    Babichenko, Yakov
    Dean, Oren
    Tennenholtz, Moshe
    THIRTY-FOURTH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE, THE THIRTY-SECOND INNOVATIVE APPLICATIONS OF ARTIFICIAL INTELLIGENCE CONFERENCE AND THE TENTH AAAI SYMPOSIUM ON EDUCATIONAL ADVANCES IN ARTIFICIAL INTELLIGENCE, 2020, 34 : 7055 - 7062
  • [8] Incentive-Compatible Forecasting Competitions
    Witkowski, Jens
    Freeman, Rupert
    Vaughan, Jennifer Wortman
    Pennock, David M.
    Krausee, Andreas
    MANAGEMENT SCIENCE, 2023, 69 (03) : 1354 - 1374
  • [9] Incentive-compatible interdomain routing
    Feigenbaum, Joan
    Ramachandran, Vijay
    Schapira, Michael
    DISTRIBUTED COMPUTING, 2011, 23 (5-6) : 301 - 319
  • [10] Incentive-Compatible Forecasting Competitions
    Witkowski, Jens
    Freeman, Rupert
    Vaughan, Jennifer Wortman
    Pennock, David M.
    Krause, Andreas
    THIRTY-SECOND AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE / THIRTIETH INNOVATIVE APPLICATIONS OF ARTIFICIAL INTELLIGENCE CONFERENCE / EIGHTH AAAI SYMPOSIUM ON EDUCATIONAL ADVANCES IN ARTIFICIAL INTELLIGENCE, 2018, : 1282 - 1289