论文标题

社交网络中的组合采购拍卖

Combinatorial Procurement Auction in Social Networks

论文作者

Guo, Yuhang, Hao, Dong, Li, Bin

论文摘要

本文研究了一种新兴的采购拍卖场景,在社交网络上构建了市场。在由许多代理商,智能手机或计算机组成的社交网络中,一个请求者发布了她对供应商的商品或任务的要求,然后也鼓励进入市场的供应商邀请其他一些供应商加入,并且网络中的所有供应商都可以竞争企业。这次网络拍卖的关键问题是如何激励每个节点,这些节点不仅是为了真正地利用她的全部能力,还要将任务转发给邻居。近年来,通过社交网络进行拍卖引起了相当大的兴趣。但是,大多数现有作品都集中在经典的远期拍卖上。此外,考虑多个商品/任务,没有现有的有效网络拍卖。这项工作是第一个探索社交网络中均质和异质商品或任务的采购拍卖。从理论证明和实验模拟中,我们证明了所提出的机制被证明是个人理性的,并且与激励兼容,也可以降低系统的成本和请求者。

This paper studies one emerging procurement auction scenario where the market is constructed over the social networks. In a social network composed of many agents, smartphones or computers, one requester releases her requirement for goods or tasks to suppliers, then suppliers who have entered the market are also encouraged to invite some other suppliers to join and all the suppliers in the network could compete for the business. The key problem for this networked auction is about how to incentivize each node who have entered the sell not only to truthfully use her full ability, but also to forward the task to her neighbours. Auctions conducting over social networks have attracted considerable interests in recent years. However, most of the existing works focus on classic forward auctions. Moreover, there is no existing valid networked auction considering multiple goods/tasks. This work is the first to explore procurement auction for both homogeneous and heterogeneous goods or tasks in social networks. From both theoretical proof and experimental simulation, we proved that the proposed mechanisms are proved to be individual-rational and incentive-compatible, also both the cost of the system and the requester could get decreased.

扫码加入交流群

加入微信交流群

微信交流群二维码

扫码加入学术交流群,获取更多资源