pith. sign in

arxiv: 2605.17221 · v1 · pith:TLJIKKQSnew · submitted 2026-05-17 · 💻 cs.GT

Probabilistic Mechanism Design in Diffusion Auctions

Xinlun Zhang , Zhechen Li , Yongzhi Cao , Yu Huang , Hanpin Wang This is my paper

Pith reviewed 2026-05-19 23:18 UTC · model grok-4.3

classification 💻 cs.GT
keywords diffusion auctionmechanism designincentive compatibilitysocial networksprobabilistic mechanismSybil-proofnessmulti-unit auctionapproximate efficiency
0
0 comments X

The pith

The Probabilistic Diffusion Mechanism achieves incentive compatibility, non-negative revenue, and constant-approximation efficiency for diffusion auctions on path graphs and extends to general networks.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

Diffusion auctions let buyers recruit others across a social network, but prior designs could not simultaneously ensure truthful bidding, positive seller revenue, and efficient allocation. The paper introduces the Probabilistic Diffusion Mechanism for path graphs that meets all three requirements with a fixed efficiency bound. It then defines a mapping to carry the same guarantees to arbitrary network shapes. Variants add resistance to fake identities and buyer collusion, while a multi-unit version handles sales of several identical items.

Core claim

The authors establish that the Probabilistic Diffusion Mechanism (PDM) defined on path graphs is incentive compatible, produces non-negative revenue, and approximates social welfare within a constant factor. Composing PDM with a map f yields an f-PDM that inherits these three properties on general graphs. When f respects breadth-first ordering, the mechanism further becomes Sybil-proof and approximates revenue. A collusion-resistant modification and the Multi-Unit PDM (MUPDM) with its Sybil-proof variant extend the same guarantees to additional settings.

What carries the argument

The Probabilistic Diffusion Mechanism (PDM), a randomized rule that diffuses bids along the network and determines allocations and payments to satisfy the three properties at once.

If this is right

  • Sellers gain a concrete rule to run auctions over social networks without risking negative revenue or losing a constant fraction of welfare.
  • The same guarantees apply to any network topology once a suitable mapping is chosen.
  • Under breadth-first ordering the mechanism prevents profitable creation of fake buyer identities.
  • The multi-unit extension lets sellers offer several identical items while retaining incentive compatibility and approximate efficiency.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • The probabilistic balancing technique may transfer to other graph-based allocation problems such as matching or resource sharing.
  • Empirical tests on real social-network data could show whether the theoretical constant bound is tight in practice.
  • Alternative base graphs such as trees might yield even stronger approximation ratios when used as the starting point for the mapping.

Load-bearing premise

A mapping function exists that lifts the path-graph mechanism to arbitrary networks while preserving incentive compatibility, non-negative revenue, and the constant efficiency bound.

What would settle it

A concrete bid profile on a star or cycle graph for which no map f can keep all three properties or for which the efficiency ratio exceeds the claimed constant bound.

Figures

Figures reproduced from arXiv: 2605.17221 by Hanpin Wang, Xinlun Zhang, Yongzhi Cao, Yu Huang, Zhechen Li.

Figure 1
Figure 1. Figure 1: Example of a social network. There are four buyers in the network and buyer d has the highest valuation 1. If buyer 1 wins the item, no one needs to pay. If buyer j > 1 wins the item, the payment rule for buyer i is defined as: p j i =    v ∗ N−j +v ′ j 2 , if i = j, − v ∗ N−j +v ′ j 2 , if i = 1, 0, otherwise. Intuitively, if a buyer’s bid is not higher than the highest bid before her, she does not… view at source ↗
Figure 2
Figure 2. Figure 2: Example of a social network. There are three buyers in the network and buyer c has the highest valuation 0.9. Case 1: s 0.3 a 0 b 0.9 c Case 2: s 0.3 a 0.9 c 0 b Case 3: s 0 b 0.3 a 0.9 c [PITH_FULL_IMAGE:figures/full_fig_p009_2.png] view at source ↗
Figure 3
Figure 3. Figure 3: Example of f-PDM. There are 3 cases that f might map to under the network in [PITH_FULL_IMAGE:figures/full_fig_p009_3.png] view at source ↗
Figure 4
Figure 4. Figure 4: Example of a Sybil attack. Buyer a is incentivized to create a Sybil identity a ′ , and get a reward of 0.8 instead of 0. Moreover, f-PDM can also satisfy ex-post properties. Ex-post properties ensure that after the result is revealed, everyone will participate in the auction and report the same type if they start over. f-PDM is ex-post WBB, because the seller’s revenue is always non-negative. For ex-post … view at source ↗
Figure 5
Figure 5. Figure 5: Example of inefficiency. The seller s only knows buyer a with valuation 0. Buyer a only knows buyer b whose valuation is 1 and buyer b does not know anyone. In this case, the existing mechanisms assign the item to a for free, so the social welfare is 0. At the end of this subsection, we demonstrate that both the breadth-first map and the generalized breadth￾first map are Sybil-proof maps, and thus the corr… view at source ↗
Figure 6
Figure 6. Figure 6: Example of collusion. The seller s knows buyer a and buyer b, both of whom have valuation 0.1 and know buyer c and each other. Buyer c, whose valuation is 1, does not know anyone. If a and b collude, they can win the item and have 0.1 utility. while SP guarantees that no individual buyer can benefit by misreporting or inflating their scale. In other models, the potential collusive buyer sets (called cartel… view at source ↗
Figure 7
Figure 7. Figure 7: Example of the map of MUPFM. There are 2 cases that MUPDM might map to under the network in [PITH_FULL_IMAGE:figures/full_fig_p016_7.png] view at source ↗
Figure 8
Figure 8. Figure 8: Example of Sybil-attack under multi-unit setting. In MUDAN, buyer a wins one item for free because she has more neighbors than b, and then c wins one item for free for the same reason. If b creates more than one Sybil-identities with valuation 0, she will win one item and have 0.1 utility. Then Xm k=1 pk · k = E[ Xm i=1 1A(Pi)] = Xm i=1 E[1A(Pi)] = Xm i=1 (1 − (1 − 1 m ) m) = m(1 − (1 − 1 m ) m) > (1 − 1 e… view at source ↗
Figure 9
Figure 9. Figure 9: Example of social network challenging to Sybil-proof mechanism design. is challenging to Sybil-proof mechanism design. Note that buyer e is neither a Sybil identity of a nor b. However, buyer d can make e appear to be b’s Sybil identity by not inviting e and thus reduces competition. MUPDM is not Sybil-proof because each buyer is randomly assigned to a path graph, enabling buyers to increase their probabil… view at source ↗
Figure 10
Figure 10. Figure 10: Example of the map of MUPDM under [PITH_FULL_IMAGE:figures/full_fig_p020_10.png] view at source ↗
read the original abstract

A diffusion auction refers to a selling process conducted over a social network, where each participant submits a bid and may invite other potential buyers to join the auction. Although various mechanisms have been proposed, none of them can simultaneously achieve incentive compatibility, non-negative revenue, and approximate efficiency with a constant approximation bound. In this paper, we propose the Probabilistic Diffusion Mechanism (PDM), a novel mechanism tailored for path graphs, which satisfies all three desired properties. We further extend PDM to general network structures through a map $f$, resulting in the $f$-PDM mechanism, which preserves the key properties of the original design. Beyond these, when $f$ satisfies properties such as breadth-first order, $f$-PDM also ensures Sybil-proofness and provides approximate revenue. Furthermore, to address buyer collusion, we introduce a modified version of the mechanism that balances collusion-proofness with revenue approximation. Finally, we extend the design to multi-unit diffusion auctions -- a more challenging setting -- and propose a simple yet effective mechanism, Multi-Unit PDM (MUPDM), that achieves approximate efficiency while maintaining IC. Moreover, we design Sybil-Proof MUPDM (SP-MUPDM) to resist Sybil attacks in the multi-item scenario.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

2 major / 2 minor

Summary. The paper proposes the Probabilistic Diffusion Mechanism (PDM) tailored for path graphs in diffusion auctions, claiming it simultaneously achieves incentive compatibility, non-negative revenue, and constant-factor approximate efficiency. It extends the design to general networks via an arbitrary map f to obtain f-PDM, which is asserted to preserve the three core properties. Additional variants address Sybil-proofness (when f satisfies breadth-first order), approximate revenue, buyer collusion, and multi-unit settings via MUPDM and SP-MUPDM.

Significance. If the central claims hold with rigorous proofs, the work would fill an important gap in diffusion auction literature by providing the first mechanisms that jointly satisfy IC, non-negative revenue, and constant approximation. The extension to general graphs and multi-unit auctions, plus handling of Sybil attacks and collusion, would increase applicability to networked selling environments. The explicit construction of probabilistic allocation rules that trade off welfare and revenue while preserving IC is a constructive strength.

major comments (2)
  1. §4 (f-PDM extension): the claim that f-PDM inherits a graph-independent constant efficiency approximation requires that the welfare loss induced by any map f (relative to the optimal diffusion allocation on the original graph) itself be bounded by a constant independent of graph size and topology. No explicit worst-case analysis or bound over arbitrary f and graphs is supplied, which is load-bearing for the general-network claim.
  2. §3 (PDM on paths): the abstract states that proofs exist for IC, non-negative revenue, and the constant approximation, yet the provided text contains no derivation sketches or verification that the probabilistic allocation rule avoids post-hoc restrictions on f when extending beyond paths; this must be supplied to confirm the base case.
minor comments (2)
  1. Notation for the map f and the effective path ordering it induces should be introduced earlier and with an explicit example on a small non-path graph to improve readability.
  2. The multi-unit extension (MUPDM) section would benefit from a brief comparison table contrasting its approximation ratio and Sybil-proofness guarantees against the single-unit case.

Simulated Author's Rebuttal

2 responses · 0 unresolved

We thank the referee for the careful and constructive review of our manuscript. The comments highlight important points regarding the rigor of our claims for general networks and the presentation of proofs for the base case. We respond to each major comment below and will revise the manuscript to address them.

read point-by-point responses

  1. Referee: §4 (f-PDM extension): the claim that f-PDM inherits a graph-independent constant efficiency approximation requires that the welfare loss induced by any map f (relative to the optimal diffusion allocation on the original graph) itself be bounded by a constant independent of graph size and topology. No explicit worst-case analysis or bound over arbitrary f and graphs is supplied, which is load-bearing for the general-network claim.

    Authors: We agree that an explicit worst-case bound on the welfare loss from an arbitrary map f is not supplied in the current version. The f-PDM applies the core probabilistic allocation rule of PDM to the diffusion structure induced by f, and the constant approximation is inherited from the path case because the rule trades off welfare and revenue in a manner that yields a fixed factor (independent of the underlying structure size) relative to the welfare of the f-induced diffusion allocation. To make the graph-independent claim fully rigorous for arbitrary f, we will add a dedicated worst-case analysis subsection in the revised §4. This analysis will establish that the additional loss factor from any f is bounded by a small constant (arising from the breadth and connectivity properties of diffusion on networks), ensuring the overall approximation remains constant and independent of graph size and topology. revision: yes

  2. Referee: §3 (PDM on paths): the abstract states that proofs exist for IC, non-negative revenue, and the constant approximation, yet the provided text contains no derivation sketches or verification that the probabilistic allocation rule avoids post-hoc restrictions on f when extending beyond paths; this must be supplied to confirm the base case.

    Authors: We acknowledge that the main text of §3 states the properties of PDM without including derivation sketches. The complete formal proofs appear in the appendix, but we agree that sketches are needed in the body for readability and to explicitly address the extension. In the revision we will insert concise proof sketches in §3 that derive incentive compatibility via the probabilistic allocation probabilities, non-negative revenue from the payment rule, and the constant approximation factor via comparison to the optimal diffusion welfare on paths. These sketches will also verify that the allocation rule is defined independently of any subsequent map f, so that the extension to f-PDM introduces no post-hoc restrictions on the base mechanism. revision: yes

Circularity Check

0 steps flagged

No circularity; mechanism constructed directly from desired properties

full rationale

The paper proposes the Probabilistic Diffusion Mechanism (PDM) as a novel construction for path graphs that is defined to satisfy incentive compatibility, non-negative revenue, and constant-factor approximate efficiency by explicit probabilistic allocation rules. The extension to f-PDM applies an arbitrary map f to reduce general graphs to the path case while claiming preservation of the same properties; this is a constructive reduction rather than a self-referential definition or a fitted parameter renamed as a prediction. No equations reduce by construction to inputs defined in terms of the target result, no load-bearing self-citation chain is invoked to justify uniqueness, and no ansatz is smuggled via prior work. The derivation is therefore self-contained as a direct mechanism design.

Axiom & Free-Parameter Ledger

0 free parameters · 2 axioms · 0 invented entities

The design rests on standard mechanism-design assumptions rather than new free parameters or invented physical entities. The central contribution is the construction of the mechanisms themselves.

axioms (2)
  • domain assumption Buyers have quasi-linear utilities and the seller seeks non-negative revenue
    Standard assumption in auction theory invoked to define incentive compatibility and revenue properties.
  • domain assumption The social network is known and can be represented as a graph (path or general)
    Required for the diffusion process and the mapping f to be well-defined.

pith-pipeline@v0.9.0 · 5754 in / 1330 out tokens · 49091 ms · 2026-05-19T23:18:03.185591+00:00 · methodology

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Reference graph

Works this paper leans on

46 extracted references · 46 canonical work pages · 1 internal anchor

  1. [1]

    SIAM Journal on Computing28(6), 2117–2132 (1999)

    Alstrup, S., Harel, D., Lauridsen, P.W., Thorup, M.: Dominators in linear time. SIAM Journal on Computing28(6), 2117–2132 (1999)

    work page 1999

  2. [2]

    Proceedings of the National Academy of Sciences97(21), 11149–11152 (2000) 24 X

    Amaral, L.A.N., Scala, A., Barthelemy, M., Stanley, H.E.: Classes of small-world networks. Proceedings of the National Academy of Sciences97(21), 11149–11152 (2000) 24 X. Zhang et al

    work page 2000

  3. [3]

    Journal of Economic Theory100(2), 295– 328 (2001)

    Bogomolnaia, A., Moulin, H.: A new solution to the random assignment problem. Journal of Economic Theory100(2), 295– 328 (2001)

    work page 2001

  4. [4]

    Journal of Economic Theory144(2), 565–603 (2009)

    Che, Y .K., Kim, J.: Optimal collusion-proof auctions. Journal of Economic Theory144(2), 565–603 (2009)

    work page 2009

  5. [5]

    In: Proceedings of the 22nd International Conference on Autonomous Agents and Multiagent Systems

    Chen, H., Deng, X., Wang, Y ., Wu, Y ., Zhao, D.: Sybil-proof diffusion auction in social networks. In: Proceedings of the 22nd International Conference on Autonomous Agents and Multiagent Systems. pp. 1379–1387 (2023)

    work page 2023

  6. [6]

    In: Proceedings of the 25th International Joint Conference on Artificial Intelligence

    Cho, S.H., Todo, T., Yokoo, M.: Two-sided matching over social networks. In: Proceedings of the 25th International Joint Conference on Artificial Intelligence. pp. 186–193 (2022)

    work page 2022

  7. [7]

    Public Choice11, 17–33 (1971)

    Clarke, E.H.: Multipart pricing of public goods. Public Choice11, 17–33 (1971)

    work page 1971

  8. [8]

    In: International Workshop on Peer-to-peer Systems

    Douceur, J.R.: The sybil attack. In: International Workshop on Peer-to-peer Systems. pp. 251–260 (2002)

    work page 2002

  9. [9]

    In: Proceedings of the 26th European Conference on Artificial Intelligence

    Fang, Y ., Zhang, M., Liu, J., Khoussainov, B., Xiao, M.: Multi-unit auction over a social network. In: Proceedings of the 26th European Conference on Artificial Intelligence. vol. 372, pp. 676–683 (2023)

    work page 2023

  10. [10]

    arXiv preprint arXiv:2511.08765 (2025)

    Galimullin, R., Mittelmann, M., Perrussel, L.: Formal verification of diffusion auctions. arXiv preprint arXiv:2511.08765 (2025)

    work page arXiv 2025

  11. [11]

    Econometrica41(4), 617–631 (1973)

    Groves, T.: Incentives in teams. Econometrica41(4), 617–631 (1973)

    work page 1973

  12. [12]

    In: Proceedings of the AAAI Conference on Artificial Intelligence

    Gu, Z., Ge, Y ., Zhang, Y ., Zhao, D.: Fair diffusion auctions. In: Proceedings of the AAAI Conference on Artificial Intelligence. vol. 40, pp. 16989–16996 (2026)

    work page 2026

  13. [13]

    Games and Economic Behavior143, 191–203 (2024)

    Jeong, S.E., Lee, J.: The groupwise-pivotal referral auction: Core-selecting referral strategy-proof mechanism. Games and Economic Behavior143, 191–203 (2024)

    work page 2024

  14. [14]

    In: Proceedings of the 22nd International Conference on Autonomous Agents and Multiagent Systems

    Jia, F., Zhang, M., Liu, J., Khoussainov, B.: Differentially private diffusion auction: The single-unit case. In: Proceedings of the 22nd International Conference on Autonomous Agents and Multiagent Systems. pp. 2724–2726 (2023)

    work page 2023

  15. [15]

    In: Uncertainty in Artificial Intelligence

    Jia, F., Zhang, M., Liu, J., Khoussainov, B.: Incentivising diffusion while preserving differential privacy. In: Uncertainty in Artificial Intelligence. pp. 963–972 (2023)

    work page 2023

  16. [16]

    In: Proceedings of the AAAI Conference on Artificial Intelligence

    Kawasaki, T., Barrot, N., Takanashi, S., Todo, T., Yokoo, M.: Strategy-proof and non-wasteful multi-unit auction via social network. In: Proceedings of the AAAI Conference on Artificial Intelligence. vol. 34, pp. 2062–2069 (2020)

    work page 2062

  17. [17]

    In: Proceedings of the 20th International Conference on Autonomous Agents and Multi-Agent Systems

    Kawasaki, T., Wada, R., Todo, T., Yokoo, M.: Mechanism design for housing markets over social networks. In: Proceedings of the 20th International Conference on Autonomous Agents and Multi-Agent Systems. pp. 692–700 (2021)

    work page 2021

  18. [18]

    ACM Transactions on Programming Lan- guages and Systems1(1), 121–141 (1979)

    Lengauer, T., Tarjan, R.E.: A fast algorithm for finding dominators in a flowgraph. ACM Transactions on Programming Lan- guages and Systems1(1), 121–141 (1979)

    work page 1979

  19. [19]

    Artificial Intelligence303, 103631 (2022)

    Li, B., Hao, D., Gao, H., Zhao, D.: Diffusion auction design. Artificial Intelligence303, 103631 (2022)

    work page 2022

  20. [20]

    IEEE Access 8, 40850–40860 (2020)

    Li, B., Hao, D., Liu, F., Gao, H., Zhou, T.: Information diffusion and revenue optimization in distribution market. IEEE Access 8, 40850–40860 (2020)

    work page 2020

  21. [21]

    In: Proceedings of the 29th International Conference on International Joint Conferences on Artificial Intelligence

    Li, B., Hao, D., Zhao, D.: Incentive-compatible diffusion auctions. In: Proceedings of the 29th International Conference on International Joint Conferences on Artificial Intelligence. pp. 231–237 (2021)

    work page 2021

  22. [22]

    Autonomous Agents and Multi-Agent Systems38(2) (2024)

    Li, B., Hao, D., Zhao, D.: Diffusion auction design with transaction costs. Autonomous Agents and Multi-Agent Systems38(2) (2024)

    work page 2024

  23. [23]

    In: Proceedings of the 22th International Joint Confer- ence on Artificial Intelligence

    Li, B., Hao, D., Zhao, D., Yokoo, M.: Diffusion and auction on graphs. In: Proceedings of the 22th International Joint Confer- ence on Artificial Intelligence. pp. 435–441 (2019)

    work page 2019

  24. [24]

    In: Proceedings of the AAAI Conference on Artificial Intelligence

    Li, B., Hao, D., Zhao, D., Zhou, T.: Mechanism design in social networks. In: Proceedings of the AAAI Conference on Artificial Intelligence. pp. 586–592 (2017)

    work page 2017

  25. [25]

    In: Proceedings of the 27th International Joint Conference on Artificial Intelligence

    Li, B., Hao, D., Zhao, D., Zhou, T.: Customer sharing in economic networks with costs. In: Proceedings of the 27th International Joint Conference on Artificial Intelligence. pp. 368–374 (2018)

    work page 2018

  26. [26]

    In: Proceedings of the AAAI Conference on Artificial Intelli- gence

    Li, M., Cao, Y ., Zhao, D.: Double auction on diffusion network. In: Proceedings of the AAAI Conference on Artificial Intelli- gence. pp. 9848–9855 (2024)

    work page 2024

  27. [27]

    In: Proceedings of the 22nd International Conference on Autonomous Agents and Multiagent Systems

    Liu, H., Lian, X., Zhao, D.: Diffusion multi-unit auctions with diminishing marginal utility buyers. In: Proceedings of the 22nd International Conference on Autonomous Agents and Multiagent Systems. pp. 2715–2717 (2023)

    work page 2023

  28. [28]

    In: Proceedings of the AAAI Conference on Artificial Intelligence

    Liu, X., Wu, W., Li, M., Wang, W.: Budget feasible mechanisms over graphs. In: Proceedings of the AAAI Conference on Artificial Intelligence. vol. 35, pp. 5549–5556 (2021)

    work page 2021

  29. [29]

    Electronic Com- merce Research and Applications52, 101078 (2022)

    Mishra, P., Moustafa, A.: A diffusion mechanism for multi-unit commodity allocation in economic networks. Electronic Com- merce Research and Applications52, 101078 (2022)

    work page 2022

  30. [30]

    Artifi- cial Intelligence339, 104272 (2025)

    Munyque, M., Bastien, M., Aniello, M., Laurent, P.: Formal verification and synthesis of mechanisms for social choice. Artifi- cial Intelligence339, 104272 (2025)

    work page 2025

  31. [31]

    Mathematics of operations research6(1), 58–73 (1981)

    Myerson, R.B.: Optimal auction design. Mathematics of operations research6(1), 58–73 (1981)

    work page 1981

  32. [32]

    Theoretical Economics3(3), 383–429 (2008)

    Pavlov, G.: Auction design in the presence of collusion. Theoretical Economics3(3), 383–429 (2008)

    work page 2008

  33. [33]

    Frontiers in Artificial Intelli- gence and Applications325, 211–218 (2020)

    Shi, H., Zhang, Y ., Si, Z., Wang, L., Zhao, D.: Maximal information propagation with budgets. Frontiers in Artificial Intelli- gence and Applications325, 211–218 (2020)

    work page 2020

  34. [34]

    Efficiency in Truthful Auctions via a Social Network

    Takanashi, S., Kawasaki, T., Todo, T., Yokoo, M.: Efficiency in truthful auctions via a social network. arXiv preprint arXiv:1904.12422 (2019)

    work page internal anchor Pith review Pith/arXiv arXiv 1904

  35. [35]

    The Journal of Finance16(1), 8–37 (1961)

    Vickrey, W.: Counterspeculation, auctions, and competitive sealed tenders. The Journal of Finance16(1), 8–37 (1961)

    work page 1961

  36. [36]

    Artificial Intelli- gence314, 103824 (2023) Probabilistic Mechanism Design in Diffusion Auctions 25

    Wang, H., Sikdar, S., Guo, X., Xia, L., Cao, Y ., Wang, H.: Multi resource allocation with partial preferences. Artificial Intelli- gence314, 103824 (2023) Probabilistic Mechanism Design in Diffusion Auctions 25

    work page 2023

  37. [37]

    In: 23rd International Conference on Digital Signal Processing

    Yang, L., Zhu, H., Wang, H., Qian, H., Yang, Y .: Incentive propagation mechanism of computation offloading in fog-enabled d2d networks. In: 23rd International Conference on Digital Signal Processing. pp. 1–4 (2018)

    work page 2018

  38. [38]

    In: Proceedings of the 21st International Conference on Autonomous Agents and Multiagent Systems

    You, B., Dierks, L., Todo, T., Li, M., Yokoo, M.: Strategy-proof house allocation with existing tenants over social networks. In: Proceedings of the 21st International Conference on Autonomous Agents and Multiagent Systems. pp. 1446–1454 (2022)

    work page 2022

  39. [39]

    In: Proceedings of the 19th International Conference on Au- tonomous Agents and Multi-Agent Systems

    Zhang, W., Zhang, Y ., Zhao, D.: Collaborative data acquisition. In: Proceedings of the 19th International Conference on Au- tonomous Agents and Multi-Agent Systems. pp. 1629–1637 (2020)

    work page 2020

  40. [40]

    In: Proceedings of the 19th International Conference on Autonomous Agents and MultiAgent Systems

    Zhang, W., Zhao, D., Chen, H.: Redistribution mechanism on networks. In: Proceedings of the 19th International Conference on Autonomous Agents and MultiAgent Systems. pp. 1620–1628 (2020)

    work page 2020

  41. [41]

    In: Proceedings of the 24th European Conference on Artificial Intelligence

    Zhang, W., Zhao, D., Zhang, Y .: Incentivize diffusion with fair rewards. In: Proceedings of the 24th European Conference on Artificial Intelligence. vol. 325, pp. 251–258 (2020)

    work page 2020

  42. [42]

    In: Proceedings of the 29th International Joint Conference on Artificial Intelligence

    Zhang, Y ., Zhang, X., Zhao, D.: Sybil-proof answer querying mechanism. In: Proceedings of the 29th International Joint Conference on Artificial Intelligence. pp. 422–428 (2020)

    work page 2020

  43. [43]

    In: Proceedings of the 21st International Conference on Autonomous Agents and Multi-Agent Systems

    Zhang, Y ., Zhao, D.: Incentives to invite others to form larger coalitions. In: Proceedings of the 21st International Conference on Autonomous Agents and Multi-Agent Systems. pp. 1509–1517 (2022)

    work page 2022

  44. [44]

    In: Proceedings of the 23rd International Conference on Au- tonomous Agents and Multiagent Systems

    Zhang, Y ., Zheng, S., Zhao, D.: Optimal diffusion auctions. In: Proceedings of the 23rd International Conference on Au- tonomous Agents and Multiagent Systems. pp. 2600–2602 (2024)

    work page 2024

  45. [45]

    In: Proceedings of the AAAI Conference on Artificial Intelligence

    Zhang, Y ., Tang, P.: Collusion-proof and sybil-proof reward mechanisms for query incentive networks. In: Proceedings of the AAAI Conference on Artificial Intelligence. vol. 37, pp. 5892–5899 (2023)

    work page 2023

  46. [46]

    In: Proceedings of the 17th International Conference on Autonomous Agents and MultiAgent Systems

    Zhao, D., Li, B., Xu, J., Hao, D., Jennings, N.R.: Selling multiple items via social networks. In: Proceedings of the 17th International Conference on Autonomous Agents and MultiAgent Systems. pp. 68–76 (2018)

    work page 2018