A volume discount-based allocation mechanism in group buying

T. Matsuo, Takayuki Ito, T. Shintani
{"title":"A volume discount-based allocation mechanism in group buying","authors":"T. Matsuo, Takayuki Ito, T. Shintani","doi":"10.1109/DEEC.2005.4","DOIUrl":null,"url":null,"abstract":"Volume discount is seen as an effective form of electronic commerce and a promising field for applying agent technologies. In current volume discount mechanisms, items are not allocated efficiently to buyers. Namely, social surplus is not maximum in existing volume discount schemes. To solve this problem, we propose a volume discount mechanism based on the seller's reservation price and the payment adjustment value. First, a seller registers his/her items with the evaluation value functions. The seller's evaluation value is sealed and each buyer bids his/her evaluation value as sealed bid. After the deadline, the mechanism determines the allocation of bundles of items. A tentative price is decided and the payment adjustment value is calculated. Finally, the payment amount is calculated. Our mechanism has some key advantages. First, the mechanism is Pareto efficient. Second, our mechanism is a strategy-proof mechanism, that is, it has the incentive compatibility. Third, our mechanism provides individual rationality. Fourth, our mechanism is made based on the volume discount system, where the seller can give a signal indicating a discount for buyers. Finally, our mechanism weakens the influence of false name bids.","PeriodicalId":297129,"journal":{"name":"International Workshop on Data Engineering Issues in E-Commerce","volume":"43 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2005-04-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"28","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Workshop on Data Engineering Issues in E-Commerce","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/DEEC.2005.4","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 28

Abstract

Volume discount is seen as an effective form of electronic commerce and a promising field for applying agent technologies. In current volume discount mechanisms, items are not allocated efficiently to buyers. Namely, social surplus is not maximum in existing volume discount schemes. To solve this problem, we propose a volume discount mechanism based on the seller's reservation price and the payment adjustment value. First, a seller registers his/her items with the evaluation value functions. The seller's evaluation value is sealed and each buyer bids his/her evaluation value as sealed bid. After the deadline, the mechanism determines the allocation of bundles of items. A tentative price is decided and the payment adjustment value is calculated. Finally, the payment amount is calculated. Our mechanism has some key advantages. First, the mechanism is Pareto efficient. Second, our mechanism is a strategy-proof mechanism, that is, it has the incentive compatibility. Third, our mechanism provides individual rationality. Fourth, our mechanism is made based on the volume discount system, where the seller can give a signal indicating a discount for buyers. Finally, our mechanism weakens the influence of false name bids.
团购中基于数量折扣的分配机制
批量折扣是电子商务的一种有效形式,是代理技术应用的一个很有前景的领域。在当前的批量折扣机制中,商品没有有效地分配给买家。也就是说,在现有的批量折扣计划中,社会盈余不是最大的。为了解决这一问题,我们提出了一种基于卖方预留价和付款调整值的批量折扣机制。首先,卖家用评估值函数注册他/她的物品。卖方的评价值是密封的,每个买方以其评价值作为密封投标。在截止日期之后,该机制决定项目包的分配。确定一个暂定价格并计算支付调整值。最后,计算付款金额。我们的机制有一些关键的优势。首先,该机制是帕累托有效的。其次,我们的机制是一种策略证明机制,即具有激励兼容性。第三,我们的机制提供了个人理性。第四,我们的机制是基于批量折扣制度,卖家可以给买家一个暗示折扣的信号。最后,我们的机制削弱了假名竞价的影响。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信