Barter exchange studies the setting where each agent owns a good, and they can exchange with each other if that gives them more preferred goods. This exchange will give better outcomes if there are more participants. The challenge here is how to get more participants and our goal is to incentivize the existing participants to invite new participants. However, new participants might be competitors for the existing participants. Therefore, we design an exchange mechanism based on the classical Top Trading Cycle (TTC) algorithm to solve their conflicts. Our mechanism is truthful in terms of revealing their preferences and also guarantees that inviting all their neighbors is a dominant strategy for all participants. The mechanism can be applied in settings where more participants are preferred but no extra budget to reach new participants.

翻译：易货交换研究每个代理商拥有一种商品的环境,如果给它们更多的首选商品,它们可以相互交换。如果有更多的参与者,这种交换将产生更好的结果。这里的挑战是如何吸引更多的参与者,我们的目标是鼓励现有参与者邀请新的参与者。然而,新的参与者可能是现有参与者的竞争对手。因此,我们设计了一个基于传统顶级交易周期算法的交换机制来解决他们的冲突。我们的机制在披露他们的偏好方面是真实的,并且还保证邀请他们的邻居是所有参与者的主导战略。这个机制可以适用于更偏好参与者但没有额外预算与新的参与者接触的环境。