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