{"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.