Adaptive Price Mechanism and a Sequential Reverse Auction Model in Social Commerce

Dipankar Das
{"title":"Adaptive Price Mechanism and a Sequential Reverse Auction Model in Social Commerce","authors":"Dipankar Das","doi":"10.2139/ssrn.3896318","DOIUrl":null,"url":null,"abstract":"This paper analyzes a two-stage auction inspired by price negotiations in Facebook Group Marketplace. In the proposed auctions, the buyer collects the first-round offers of the sellers, and confronts the set of sellers who asked for the second lowest,third lowest,fourth lowest amount etc... with the lowest price offer received. The buyer decides the set of sellers based on the quality of the product that can be seen using the distribution function of the common value and try to minimize the delivery cost and comparing with the lowest bid price in the first round as well.This is because the true valuation is not know to the buyer and the seller. These negotiating tactics is proposed to be optimal in some sense. The sellers respond to this negotiating tactic by inferring the buyer's valuation and somehow revise the offer less than the first round.In the end the buyer decide the best sellers comparing the first best bid and the set f revised bids.The paper derives a theoretical model, along with a piece of empirical evidence, of the determination of prices at which a seller sells objects in the \"Facebook Group Marketplace\" using an adaptive price mechanism and a sequential reverse auction model. This is an informal marketplace and has been developed by Facebook users. The paper considers the single object demand case. In the end, the paper explains the model empirically. The interesting part of this auction process is that both the buyer and the seller have the private information to exploit each other. Hence, no one is in an advantageous position. The paper gives a mechanism to sell the indivisible object in an asymmetry auction. Especially, tries to answer the question of the fact that, if buyers in an auction are uncertain about the value of the item being sold, how will the seller set a bid in the reverse auction mechanism?Buyers do not always know exactly how much they value a good. An adoptive price mechanism has been proposed here so that different bids can be set to heterogeneous buyers.","PeriodicalId":370988,"journal":{"name":"eBusiness & eCommerce eJournal","volume":"12 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-07-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"eBusiness & eCommerce eJournal","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.2139/ssrn.3896318","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

This paper analyzes a two-stage auction inspired by price negotiations in Facebook Group Marketplace. In the proposed auctions, the buyer collects the first-round offers of the sellers, and confronts the set of sellers who asked for the second lowest,third lowest,fourth lowest amount etc... with the lowest price offer received. The buyer decides the set of sellers based on the quality of the product that can be seen using the distribution function of the common value and try to minimize the delivery cost and comparing with the lowest bid price in the first round as well.This is because the true valuation is not know to the buyer and the seller. These negotiating tactics is proposed to be optimal in some sense. The sellers respond to this negotiating tactic by inferring the buyer's valuation and somehow revise the offer less than the first round.In the end the buyer decide the best sellers comparing the first best bid and the set f revised bids.The paper derives a theoretical model, along with a piece of empirical evidence, of the determination of prices at which a seller sells objects in the "Facebook Group Marketplace" using an adaptive price mechanism and a sequential reverse auction model. This is an informal marketplace and has been developed by Facebook users. The paper considers the single object demand case. In the end, the paper explains the model empirically. The interesting part of this auction process is that both the buyer and the seller have the private information to exploit each other. Hence, no one is in an advantageous position. The paper gives a mechanism to sell the indivisible object in an asymmetry auction. Especially, tries to answer the question of the fact that, if buyers in an auction are uncertain about the value of the item being sold, how will the seller set a bid in the reverse auction mechanism?Buyers do not always know exactly how much they value a good. An adoptive price mechanism has been proposed here so that different bids can be set to heterogeneous buyers.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
社会商务中的自适应价格机制与顺序逆向拍卖模型
本文分析了Facebook Group Marketplace中受价格谈判启发的两阶段拍卖。在提议拍卖中,买方收集卖方的第一轮报价,并面对要求第二低、第三低、第四低等价格的卖方。以收到的最低价格报价。买方根据共同价值的分布函数所能看到的产品质量来决定卖方的集合,并尽量使交货成本最小化,并与第一轮的最低出价进行比较。这是因为买卖双方都不知道真正的估价。这些谈判策略在某种意义上是最优的。卖方对这种谈判策略的反应是推断买方的估值,并以某种方式修改报价,低于第一轮。最后由买方比较第一个最佳出价和修改后的一组出价,确定最佳卖家。本文导出了一个理论模型,并结合了一些经验证据,利用自适应价格机制和顺序反向拍卖模型,确定了卖家在“Facebook Group Marketplace”中出售物品的价格。这是一个由Facebook用户开发的非正式市场。本文考虑单对象需求情况。最后,对模型进行了实证解释。这个拍卖过程的有趣之处在于,买卖双方都有可以利用对方的私人信息。因此,没有人处于有利地位。本文给出了不对称拍卖中不可分割物品的出售机制。特别是,试图回答这样一个事实:如果拍卖中的买方不确定被出售物品的价值,卖方将如何在反向拍卖机制中设定出价?买家并不总是确切知道他们对一件商品的价值。本文提出了一种采用价格机制,以便为异质买家设定不同的出价。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Advertising as Information for Ranking E-Commerce Search Listings Adaptive Price Mechanism and a Sequential Reverse Auction Model in Social Commerce Asymmetric Network Effects in the Integration of Digital Platforms Is COVID-19 Reshaping Consumer Buying Behavior? Understanding the Problems and Issues of Online Purchase in Nepal The Pricing Strategies of Online Grocery Retailers
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1