Fair Diffusion Auctions
Zixin Gu, Yaoxin Ge, Yao Zhang, Dengji Zhao
Abstract
Diffusion auction design is a new trend in mechanism design which extends the original incentive compatibility property to include buyers' private connection report. Reporting connections is equivalent to inviting their neighbors to join the auction in practice. Then, the social welfare is collectively accumulated by all participants: reporting high valuations or inviting high-valuation neighbors. Hence, we can measure each participant's contribution by the marginal social welfare increase due to her participation.
Therefore, in this paper, we introduce a new property called Shapley fairness to capture participants' social welfare contribution and use it as a benchmark to guide our auction design for a fairer utility allocation. Not surprisingly, none of the existing diffusion auctions has ever approximated the fairness, because Shapley fairness depends on each buyer's own valuation and this dependence can easily violate incentive compatibility. Thus, we combat this challenge by proposing a new diffusion auction called Permutation Diffusion Auction (PDA) for selling k homogeneous items, which is the first diffusion auction satisfying 1/(k+1)-Shapley fairness, incentive compatibility and individual rationality. Moreover, PDA can be extended to the general combinatorial auction setting where the literature did not discover meaningful diffusion auctions yet.
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.
Builds on1
Related papers
- Multi-Unit Auction in Social Networks with BudgetsMingyu Xiao, Yuchao Song, Bakh KhoussainovAAAI 2022 · 12 citations
- Formal Verification of Diffusion AuctionsRustam Galimullin, Munyque Mittelmann, Laurent PerrusselAAAI 2026
- Benefits of Permutation-Equivariance in Auction MechanismsTian Qin, Fengxiang He, Dingfeng Shi, Wenbing Huang et al.NeurIPS 2022 · 13 citations
- Budget Feasible Mechanisms Over GraphsXiang Liu, Weiwei Wu, Minming Li, Wanyuan WangAAAI 2021 · 11 citations
- A Permutation-Equivariant Neural Network Architecture For Auction DesignJad Rahme, Samy Jelassi, Joan Bruna, S. Matthew WeinbergAAAI 2021 · 65 citations
