为点对点服务定价的真实在线拍卖

Po-An Chen, Tyng-Ruey Chuang
{"title":"为点对点服务定价的真实在线拍卖","authors":"Po-An Chen, Tyng-Ruey Chuang","doi":"10.1109/ICECT.2005.100","DOIUrl":null,"url":null,"abstract":"We consider truthful online auctions that aim at optimizing sellers' revenues, representing service contributors' satisfactions, as a general model for pricing peer-to-peer services under the assumption of individual service consumer's rationality. For services that are in unlimited supply, we design a randomized truthful online auction with guaranteed revenue based on a randomized truthful offline auction. It is shown that the expected revenue extracted by our truthful online auction over all random factors achieves a /spl Theta/ (1) approximation ratio relative to the optimal single-price revenue under some reasonable assumption about the input bids. Since a peer must serve others to earn sufficient revenue that can cover its payment for being served, we argue that our online truthful auctions can be suitable schemes for incentivizing peer nodes in peer-to-peer systems to share, and thereby addressing the \"free-rider\" problem in peer-to-peer service sharing.","PeriodicalId":312957,"journal":{"name":"Seventh IEEE International Conference on E-Commerce Technology (CEC'05)","volume":"1960 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2005-07-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Truthful online auctions for pricing peer-to-peer services\",\"authors\":\"Po-An Chen, Tyng-Ruey Chuang\",\"doi\":\"10.1109/ICECT.2005.100\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We consider truthful online auctions that aim at optimizing sellers' revenues, representing service contributors' satisfactions, as a general model for pricing peer-to-peer services under the assumption of individual service consumer's rationality. For services that are in unlimited supply, we design a randomized truthful online auction with guaranteed revenue based on a randomized truthful offline auction. It is shown that the expected revenue extracted by our truthful online auction over all random factors achieves a /spl Theta/ (1) approximation ratio relative to the optimal single-price revenue under some reasonable assumption about the input bids. Since a peer must serve others to earn sufficient revenue that can cover its payment for being served, we argue that our online truthful auctions can be suitable schemes for incentivizing peer nodes in peer-to-peer systems to share, and thereby addressing the \\\"free-rider\\\" problem in peer-to-peer service sharing.\",\"PeriodicalId\":312957,\"journal\":{\"name\":\"Seventh IEEE International Conference on E-Commerce Technology (CEC'05)\",\"volume\":\"1960 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2005-07-19\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Seventh IEEE International Conference on E-Commerce Technology (CEC'05)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICECT.2005.100\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Seventh IEEE International Conference on E-Commerce Technology (CEC'05)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICECT.2005.100","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

我们考虑在服务消费者个体理性的假设下,以优化卖方收入(代表服务提供者满意度)为目标的真实在线拍卖,作为点对点服务定价的一般模型。对于无限供应的服务,我们在随机真实线下拍卖的基础上设计了具有保证收益的随机真实在线拍卖。结果表明,在有关输入出价的一些合理假设下,我们的真实在线拍卖在所有随机因素上提取的预期收入相对于最优单一价格收入达到a/ spl Theta/(1)近似比。由于一个对等体必须为他人服务才能获得足够的收入,以支付其被服务的费用,因此我们认为,我们的在线真实拍卖可以成为激励点对点系统中对等节点共享的合适方案,从而解决点对点服务共享中的“搭便车”问题。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Truthful online auctions for pricing peer-to-peer services
We consider truthful online auctions that aim at optimizing sellers' revenues, representing service contributors' satisfactions, as a general model for pricing peer-to-peer services under the assumption of individual service consumer's rationality. For services that are in unlimited supply, we design a randomized truthful online auction with guaranteed revenue based on a randomized truthful offline auction. It is shown that the expected revenue extracted by our truthful online auction over all random factors achieves a /spl Theta/ (1) approximation ratio relative to the optimal single-price revenue under some reasonable assumption about the input bids. Since a peer must serve others to earn sufficient revenue that can cover its payment for being served, we argue that our online truthful auctions can be suitable schemes for incentivizing peer nodes in peer-to-peer systems to share, and thereby addressing the "free-rider" problem in peer-to-peer service sharing.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信