{"title":"股份厌恶型数据消费者数据交易的诚实拍卖机制","authors":"Zhenni Feng, Qiyuan Wang, Yanmin Zhu","doi":"10.1109/MSN57253.2022.00075","DOIUrl":null,"url":null,"abstract":"In the paper we focus on a promising research problem of data trading, under the scenario that data items can be reproduced easily and inexpensively. Apart from a Bayesian optimal mechanism based data trading approach, we also propose a prior-free data trading approach to organize the data trading process between selfish data owners and share-averse data consumers, with the goal of maximizing revenue of data owners and meanwhile determining the optimal number of data copies. Rigorous theoretical analysis and extensive experiment results are offered to verify the effectiveness of proposed methods in terms of sum of valuations, revenue, individual rationality and incentive compatibility.","PeriodicalId":114459,"journal":{"name":"2022 18th International Conference on Mobility, Sensing and Networking (MSN)","volume":"24 ","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Truthful Auction Mechanism for Data Trading with Share-Averse Data Consumers\",\"authors\":\"Zhenni Feng, Qiyuan Wang, Yanmin Zhu\",\"doi\":\"10.1109/MSN57253.2022.00075\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In the paper we focus on a promising research problem of data trading, under the scenario that data items can be reproduced easily and inexpensively. Apart from a Bayesian optimal mechanism based data trading approach, we also propose a prior-free data trading approach to organize the data trading process between selfish data owners and share-averse data consumers, with the goal of maximizing revenue of data owners and meanwhile determining the optimal number of data copies. Rigorous theoretical analysis and extensive experiment results are offered to verify the effectiveness of proposed methods in terms of sum of valuations, revenue, individual rationality and incentive compatibility.\",\"PeriodicalId\":114459,\"journal\":{\"name\":\"2022 18th International Conference on Mobility, Sensing and Networking (MSN)\",\"volume\":\"24 \",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2022-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2022 18th International Conference on Mobility, Sensing and Networking (MSN)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/MSN57253.2022.00075\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2022 18th International Conference on Mobility, Sensing and Networking (MSN)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/MSN57253.2022.00075","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Truthful Auction Mechanism for Data Trading with Share-Averse Data Consumers
In the paper we focus on a promising research problem of data trading, under the scenario that data items can be reproduced easily and inexpensively. Apart from a Bayesian optimal mechanism based data trading approach, we also propose a prior-free data trading approach to organize the data trading process between selfish data owners and share-averse data consumers, with the goal of maximizing revenue of data owners and meanwhile determining the optimal number of data copies. Rigorous theoretical analysis and extensive experiment results are offered to verify the effectiveness of proposed methods in terms of sum of valuations, revenue, individual rationality and incentive compatibility.