arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1903.02703cs.GTcs.AI
收藏

通过社交网络销售多个项目

Selling Multiple Items via Social Networks

ShanghaiTech University(上海科技大学);University of Electronic Science and Technology of China(电子科技大学);Imperial College London(帝国理工学院)

Dengji Zhao, Bin Li, Junping Xu, Dong Hao, Nicholas R. Jennings

摘要:

我们考虑一个市场,卖家在社交网络中出售多个单位的商品。社交网络中的每个节点/买家只能直接与她的邻居通信,即卖家只能在无法找到通知其他买家的方法的情况下将商品出售给她的邻居。在本文中,我们设计了一种新的促销机制,激励所有买家,谁知道的销售,邀请他们所有的邻居加入销售,即使没有保证,他们的努力将支付。虽然传统的促销活动,如赞助搜索拍卖不能保证广告客户(卖方)的积极回报,我们的机制保证卖方的收入比不使用广告更好。更重要的是,如果广告对她没有好处,卖家不需要付费。

英文摘要:

We consider a market where a seller sells multiple units of a commodity in a social network. Each node/buyer in the social network can only directly communicate with her neighbours, i.e. the seller can only sell the commodity to her neighbours if she could not find a way to inform other buyers. In this paper, we design a novel promotion mechanism that incentivizes all buyers, who are aware of the sale, to invite all their neighbours to join the sale, even though there is no guarantee that their efforts will be paid. While traditional sale promotions such as sponsored search auctions cannot guarantee a positive return for the advertiser (the seller), our mechanism guarantees that the seller's revenue is better than not using the advertising. More importantly, the seller does not need to pay if the advertising is not beneficial to her.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑