Article(id=1329458273247408477, tenantId=1146029695717560320, journalId=1324759914146529478, issueId=1329458094792356805, articleNumber=null, orderNo=null, doi=10.7544/issn1000-1239.202330791, pmid=null, cstr=null, oa=null, hot=null, price=null, onlineType=0, articleFormat=0, articleType=null, articleTypeStr=null, receivedDate=1696867200000, receivedDateStr=2023-10-10, revisedDate=1715788800000, revisedDateStr=2024-05-16, acceptedDate=1716998400000, acceptedDateStr=2024-05-30, onlineDate=1794897152482, onlineDateStr=2026-11-17, pubDate=1732982400000, pubDateStr=2024-12-01, doiRegisterDate=null, doiRegisterDateStr=null, onlineIssueDate=1794897152482, onlineIssueDateStr=2026-11-17, onlineJustAcceptDate=null, onlineJustAcceptDateStr=null, onlineFirstDate=null, onlineFirstDateStr=null, sourceXml=null, magXml=null, createTime=1794897152482, creator=13701087609, updateTime=1794897152482, updator=13701087609, issue=Issue{id=1329458094792356805, tenantId=1146029695717560320, journalId=1324759914146529478, year='2024', volume='61', issue='12', pageStart='2937', pageEnd='3187', issueExtLink='null', onlineDate='null', pubDate='1732982400000', pubDateStr='2024-12-01', beforeIssueId=null, nextIssueId=null, price=null, status=1, issueComplete=1, articleOrder=1, issueType=-1, specialIssue=null, createTime=1794897109934, creator='13701087609', updateTime=1794897109934, updator='13701087609', preIssue=null, nextIssue=null, articleTotal=null, ext=null, issueFiles=null, downloadFileDto=null}, startPage=3154, endPage=3167, ext={EN=ArticleExt(id=1329458273431957854, articleId=1329458273247408477, tenantId=1146029695717560320, journalId=1324759914146529478, language=EN, title=Novel Practical Query Pricing Algorithm Based on Labor Game Model, columnId=1325489891789910943, journalTitle=Journal of Computer Research and Development, columnName=Artificial Intelligence, runingTitle=null, highlight=null, articleAbstract=

With the promotion of data as a production factor, traditional query pricing methods face tremendous challenges in practical applications due to their overly strict premise assumptions, limited support for flexibility and dynamics, and inadequate consideration of key factors. To address these issues, we innovatively design a query pricing algorithm based on the labor game model. This algorithm models the participants in data transactions as labor unions and employers, and treats the data trading platform and data buyers as the labor union and employers, respectively. The data trading platform (labor union) is responsible for the fair and transparent calculation of the value of each traded dataset (wages), aiming to facilitate transactions as much as possible. Data buyers determine the purchase quantities of datasets based on their estimated value, personal needs, and budgets, thereby achieving a pricing strategy that balances the interests of all three parties. Experimental results demonstrate that compared with the popular Stackelberg game model, our algorithm better accommodates the interests of all parties and ensures greater fairness. Compared with traditional query-based data pricing methods, our pricing algorithm is more practical, offers greater flexibility and dynamics, and can dynamically adjust prices in response to changes in query results. The time complexity of our pricing algorithm is O(N), where N is the number of datasets related to the query, and it also guarantees no arbitrage.

, authors=Huiju Wang, Weixuan Huang, Xiao Yue*, authorsList=Huiju Wang, Weixuan Huang, Xiao Yue, authorCompany=null, correspAuthors=Xiao Yue, authorNote=

born in 1979. PhD, associate professor, master supervisor. Member of CCF. His research interests include big data, high performance database, graph database, and AI

born in 1999. Master. His main research interests include data pricing and big data

born in 1980. PhD, associate professor, master supervisor. Her main research interests include big data and data trading

, correspAuthorsNote=null, copyrightStatement=Copyright © 2024 Journal of Computer Research and Development. All rights reserved., copyrightOwner=null, extLink=null, articleAbsUrl=null, sourceXml=null, magXml=null, pdfUrl=null, pdf=null, pdfFileSize=null, pdfExtLink=null, richHtmlUrl=null, mobilePdfUrl=null, reviewReport=null, pdfFirstPage=null, abstractGraph=null, abstractGraphContent=null, abstractVideo=null, citation=null, cebUrl=null, magXmlContent=null, mapNumber=null, fund=null), CN=ArticleExt(id=1329458275021599090, articleId=1329458273247408477, tenantId=1146029695717560320, journalId=1324759914146529478, language=CN, title=基于劳资博弈模型的实用查询定价新算法, columnId=1325489892104483745, journalTitle=计算机研究与发展, columnName=人工智能, runingTitle=null, highlight=null, articleAbstract=

在数据要素化的推动下,传统查询定价方法因其前提假设要求过高、灵活动态性支持有限、关键因素考虑不足等问题,面临落地难的巨大挑战. 为解决以上问题,创新设计了基于劳资博弈模型的查询定价算法,该算法利用劳资博弈模型对数据交易中参与方进行建模,将数据交易平台和数据买方分别视作工会和用人单位;数据交易平台(工会)负责各交易数据集价值(劳动者工资)公平透明计算,以尽可能促成交易为目标;数据买方根据各数据集估量价值、自身需求和自身预算,决定各数据集购买数量,藉此实现兼顾三方利益的交易数据集定价. 实验表明,该算法相比于流行的斯塔克伯格博弈模型,更能兼顾各方利益,更加公平;相比于传统的基于查询的数据定价方法,该定价算法更易落地应用、更具动态灵活性,可以跟随查询结果的变化实现价格的动态调整. 该定价算法时间复杂度为O(N)(N为查询相关数据集个数),且具有无套利性.

, authors=王会举, 黄玮煊, 岳晓*, authorsList=王会举, 黄玮煊, 岳晓, authorCompany=null, correspAuthors=岳晓, authorNote=

1979年生. 博士,副教授,硕士生导师. CCF会员. 主要研究方向为大数据、高性能数据库、图数据库、人工智能

1999年生. 硕士. 主要研究方向为数据定价、大数据

1980年生. 博士,副教授,硕士生导师. 主要研究方向为大数据、数据交易

, correspAuthorsNote=
岳晓()
, copyrightStatement=版权所有 © 2024 计算机研究与发展编辑部, copyrightOwner=null, extLink=null, articleAbsUrl=null, sourceXml=RjSyCnc5b3f760nPuTqaiw==, magXml=cCZ4x1fkP3EOGsChdVC+UA==, pdfUrl=null, pdf=dhuzIKpITgy4DpLKX2GUXA==, pdfFileSize=1659821, pdfExtLink=null, richHtmlUrl=null, mobilePdfUrl=null, reviewReport=null, pdfFirstPage=null, abstractGraph=NtuMpEfBN1gCCjLjLJ6RmA==, abstractGraphContent=null, abstractVideo=null, citation=null, cebUrl=null, magXmlContent=Sg/MEdCC1XJq/LmNGnsA6Q==, mapNumber=null, fund=null)}, authors=[Author(id=1329458275331977591, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329458273247408477, orderNo=0, firstName=null, middleName=null, lastName=null, nameCn=null, orcid=null, stid=null, country=null, authorPic=null, dead=0, email=wanghj@zuel.edu.cn, emailSecond=null, emailThird=null, correspondingAuthor=0, authorType=1, ext={EN=AuthorExt(id=1329458275432640889, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329458273247408477, authorId=1329458275331977591, language=EN, stringName=Huiju Wang, firstName=Huiju, middleName=null, lastName=Wang, prefix=null, suffix=null, authorComment=null, nameInitials=null, affiliation=null, department=null, xref=null, address=School of Information Engineering, Zhongnan University of Economics and Law, Wuhan 430073, bio={"content":"

born in 1979. PhD, associate professor, master supervisor. Member of CCF. His research interests include big data, high performance database, graph database, and AI

"}, bioImg=null, bioContent=

born in 1979. PhD, associate professor, master supervisor. Member of CCF. His research interests include big data, high performance database, graph database, and AI

, aboutCorrespAuthor=null), CN=AuthorExt(id=1329458277039059322, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329458273247408477, authorId=1329458275331977591, language=CN, stringName=王会举, firstName=null, middleName=null, lastName=null, prefix=null, suffix=null, authorComment=null, nameInitials=null, affiliation=null, department=null, xref=null, address=中南财经政法大学信息工程学院 武汉 430073, bio={"img":"+pJJW+Qi9vcaBwwHto+vfg==","content":"

1979年生. 博士,副教授,硕士生导师. CCF会员. 主要研究方向为大数据、高性能数据库、图数据库、人工智能

"}, bioImg=+pJJW+Qi9vcaBwwHto+vfg==, bioContent=

1979年生. 博士,副教授,硕士生导师. CCF会员. 主要研究方向为大数据、高性能数据库、图数据库、人工智能

, aboutCorrespAuthor=null)}, companyList=[AuthorCompany(id=1329458275214537075, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329458273247408477, xref=null, ext=[AuthorCompanyExt(id=1329458275222925684, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329458273247408477, companyId=1329458275214537075, language=EN, country=null, province=null, city=null, postcode=null, companyName=null, departmentName=null, remark=School of Information Engineering, Zhongnan University of Economics and Law, Wuhan 430073), AuthorCompanyExt(id=1329458275235508597, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329458273247408477, companyId=1329458275214537075, language=CN, country=null, province=null, city=null, postcode=null, companyName=null, departmentName=null, remark=中南财经政法大学信息工程学院 武汉 430073)])]), Author(id=1329458277110362492, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329458273247408477, orderNo=1, firstName=null, middleName=null, lastName=null, nameCn=null, orcid=null, stid=null, country=null, authorPic=null, dead=0, email=null, emailSecond=null, emailThird=null, correspondingAuthor=0, authorType=1, ext={EN=AuthorExt(id=1329458277185859966, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329458273247408477, authorId=1329458277110362492, language=EN, stringName=Weixuan Huang, firstName=Weixuan, middleName=null, lastName=Huang, prefix=null, suffix=null, authorComment=null, nameInitials=null, affiliation=null, department=null, xref=null, address=School of Information Engineering, Zhongnan University of Economics and Law, Wuhan 430073, bio={"content":"

born in 1999. Master. His main research interests include data pricing and big data

"}, bioImg=null, bioContent=

born in 1999. Master. His main research interests include data pricing and big data

, aboutCorrespAuthor=null), CN=AuthorExt(id=1329458277269746048, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329458273247408477, authorId=1329458277110362492, language=CN, stringName=黄玮煊, firstName=null, middleName=null, lastName=null, prefix=null, suffix=null, authorComment=null, nameInitials=null, affiliation=null, department=null, xref=null, address=中南财经政法大学信息工程学院 武汉 430073, bio={"img":"CkeHeM2p7Ryjg4kpC6UT3A==","content":"

1999年生. 硕士. 主要研究方向为数据定价、大数据

"}, bioImg=CkeHeM2p7Ryjg4kpC6UT3A==, bioContent=

1999年生. 硕士. 主要研究方向为数据定价、大数据

, aboutCorrespAuthor=null)}, companyList=[AuthorCompany(id=1329458275214537075, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329458273247408477, xref=null, ext=[AuthorCompanyExt(id=1329458275222925684, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329458273247408477, companyId=1329458275214537075, language=EN, country=null, province=null, city=null, postcode=null, companyName=null, departmentName=null, remark=School of Information Engineering, Zhongnan University of Economics and Law, Wuhan 430073), AuthorCompanyExt(id=1329458275235508597, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329458273247408477, companyId=1329458275214537075, language=CN, country=null, province=null, city=null, postcode=null, companyName=null, departmentName=null, remark=中南财经政法大学信息工程学院 武汉 430073)])]), Author(id=1329458277366215042, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329458273247408477, orderNo=2, firstName=null, middleName=null, lastName=null, nameCn=null, orcid=null, stid=null, country=null, authorPic=null, dead=0, email=yuexiao@zuel.edu.cn, emailSecond=null, emailThird=null, correspondingAuthor=1, authorType=1, ext={EN=AuthorExt(id=1329458277450101124, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329458273247408477, authorId=1329458277366215042, language=EN, stringName=Xiao Yue, firstName=Xiao, middleName=null, lastName=Yue, prefix=null, suffix=null, authorComment=null, nameInitials=null, affiliation=null, department=null, xref=*, address=School of Information Engineering, Zhongnan University of Economics and Law, Wuhan 430073, bio={"content":"

born in 1980. PhD, associate professor, master supervisor. Her main research interests include big data and data trading

"}, bioImg=null, bioContent=

born in 1980. PhD, associate professor, master supervisor. Her main research interests include big data and data trading

, aboutCorrespAuthor=null), CN=AuthorExt(id=1329458277521404293, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329458273247408477, authorId=1329458277366215042, language=CN, stringName=岳晓, firstName=null, middleName=null, lastName=null, prefix=null, suffix=null, authorComment=null, nameInitials=null, affiliation=null, department=null, xref=*, address=中南财经政法大学信息工程学院 武汉 430073, bio={"img":"WhdkAHRrTso5x7H520QdEQ==","content":"

1980年生. 博士,副教授,硕士生导师. 主要研究方向为大数据、数据交易

"}, bioImg=WhdkAHRrTso5x7H520QdEQ==, bioContent=

1980年生. 博士,副教授,硕士生导师. 主要研究方向为大数据、数据交易

, aboutCorrespAuthor=null)}, companyList=[AuthorCompany(id=1329458275214537075, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329458273247408477, xref=null, ext=[AuthorCompanyExt(id=1329458275222925684, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329458273247408477, companyId=1329458275214537075, language=EN, country=null, province=null, city=null, postcode=null, companyName=null, departmentName=null, remark=School of Information Engineering, Zhongnan University of Economics and Law, Wuhan 430073), AuthorCompanyExt(id=1329458275235508597, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329458273247408477, companyId=1329458275214537075, language=CN, country=null, province=null, city=null, postcode=null, companyName=null, departmentName=null, remark=中南财经政法大学信息工程学院 武汉 430073)])])], keywords=[Keyword(id=1329458277647233414, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329458273247408477, language=EN, orderNo=1, keyword=query pricing), Keyword(id=1329458277714342279, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329458273247408477, language=EN, orderNo=2, keyword=labor game model), Keyword(id=1329458277798228360, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329458273247408477, language=EN, orderNo=3, keyword=data pricing), Keyword(id=1329458277869531529, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329458273247408477, language=EN, orderNo=4, keyword=data trading), Keyword(id=1329458277940834698, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329458273247408477, language=EN, orderNo=5, keyword=fair pricing), Keyword(id=1329458278007943563, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329458273247408477, language=CN, orderNo=1, keyword=查询定价), Keyword(id=1329458278083441036, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329458273247408477, language=CN, orderNo=2, keyword=劳资博弈模型), Keyword(id=1329458278154744205, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329458273247408477, language=CN, orderNo=3, keyword=数据定价), Keyword(id=1329458278238630286, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329458273247408477, language=CN, orderNo=4, keyword=数据交易), Keyword(id=1329458278318322063, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329458273247408477, language=CN, orderNo=5, keyword=公平定价)], refs=[Reference(id=1329458282202247594, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329458273247408477, doi=null, pmid=null, pmcid=null, year=null, volume=null, issue=null, pageStart=null, pageEnd=null, url=null, language=null, rfNumber=1, rfOrder=0, authorNames=null, journalName=null, refType=null, unstructuredReference=中共中央国务院. “十四五”数字经济发展规划[EB/OL]. (2022-03-25)[2023-05-12]. https://www.gov.cn/gongbao/content/2022/content_5671108.htm?eqid=8776104300000c760000000664564e72&eqid=cc7670d30007fc920000000664867f05, articleTitle=null, refAbstract=null), Reference(id=1329458282269356459, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329458273247408477, doi=null, pmid=null, pmcid=null, year=null, volume=null, issue=null, pageStart=null, pageEnd=null, url=null, language=null, rfNumber=1, rfOrder=1, authorNames=null, journalName=null, refType=null, unstructuredReference=CPC Central Committee and the State Council. “14th five year plan” digital economic development plan[EB/OL]. (2022-03-25) [2023-05-12]. https://www.gov.cn/gongbao/content/2022/content_5671108.htm?eqid=8776104300000c760000000664564e72&eqid=cc7670d30007fc920000000664867f05 (in Chinese), articleTitle=null, refAbstract=null), Reference(id=1329458282332271020, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329458273247408477, doi=null, pmid=null, pmcid=null, year=null, volume=null, issue=null, pageStart=null, pageEnd=null, url=null, language=null, rfNumber=2, rfOrder=2, authorNames=null, journalName=null, refType=null, unstructuredReference=Koutris P, Upadhyaya P, Balazinska M, et al. Query-based data pricing[C]//Proc of the 34th SIGMOD Symp on Principles of Database Systems (PODS). New York: ACM, 2012: 167−178, articleTitle=null, refAbstract=null), Reference(id=1329458282399379885, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329458273247408477, doi=null, pmid=null, pmcid=null, year=null, volume=null, issue=null, pageStart=null, pageEnd=null, url=null, language=null, rfNumber=3, rfOrder=3, authorNames=null, journalName=null, refType=null, unstructuredReference=Tang Ruiming, Wu Huayu, Bao Zhifeng, et al. The price is right: Models and algorithms for pricing data[C]//Proc of the 24th Int Conf on Database and Expert Systems Applications. Berlin: Springer, 2013: 380−394, articleTitle=null, refAbstract=null), Reference(id=1329458282458100142, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329458273247408477, doi=null, pmid=null, pmcid=null, year=null, volume=null, issue=null, pageStart=null, pageEnd=null, url=null, language=null, rfNumber=4, rfOrder=4, authorNames=null, journalName=null, refType=null, unstructuredReference=Balazinska M, Howe B, Suciu D. Data markets in the cloud: An opportunity for the database community[J]. Proceedings of the VLDB Endowment, 2011, 4(12): 1482−1485, articleTitle=null, refAbstract=null), Reference(id=1329458282521014703, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329458273247408477, doi=null, pmid=null, pmcid=null, year=null, volume=null, issue=null, pageStart=null, pageEnd=null, url=null, language=null, rfNumber=5, rfOrder=5, authorNames=null, journalName=null, refType=null, unstructuredReference=Lin Bingrong, Kifer D. On arbitrage-free pricing for general data queries[J]. Proceedings of the VLDB Endowment, 2014, 7(9): 757−768, articleTitle=null, refAbstract=null), Reference(id=1329458282579734960, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329458273247408477, doi=null, pmid=null, pmcid=null, year=null, volume=null, issue=null, pageStart=null, pageEnd=null, url=null, language=null, rfNumber=6, rfOrder=6, authorNames=null, journalName=null, refType=null, unstructuredReference=Upadhyaya P, Balazinska M, Suciu D. Price-optimal querying with data apis[J]. Proceedings of the VLDB Endowment, 2016, 9(14): 1695−1706, articleTitle=null, refAbstract=null), Reference(id=1329458282638455217, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329458273247408477, doi=null, pmid=null, pmcid=null, year=null, volume=null, issue=null, pageStart=null, pageEnd=null, url=null, language=null, rfNumber=7, rfOrder=7, authorNames=null, journalName=null, refType=null, unstructuredReference=Deep S, Koutris P. The design of arbitrage-free data pricing schemes[C]//Proc of the 20th Int Conf on Database Theory (ICDT). Wadern: Schloss Dagstuhl, 2017: 12: 1−12: 18, articleTitle=null, refAbstract=null), Reference(id=1329458282705564082, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329458273247408477, doi=null, pmid=null, pmcid=null, year=null, volume=null, issue=null, pageStart=null, pageEnd=null, url=null, language=null, rfNumber=8, rfOrder=8, authorNames=null, journalName=null, refType=null, unstructuredReference=Deep S, Koutris P. Qirana: A framework for scalable query pricing[C]//Proc of the 43rd ACM Int Conf on Management of Data. New York: ACM, 2017: 699−713, articleTitle=null, refAbstract=null), Reference(id=1329458282764284339, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329458273247408477, doi=null, pmid=null, pmcid=null, year=null, volume=null, issue=null, pageStart=null, pageEnd=null, url=null, language=null, rfNumber=9, rfOrder=9, authorNames=null, journalName=null, refType=null, unstructuredReference=Deep S, Koutris P, Bidasaria Y. Qirana demonstration: Real time scalable query pricing[J]. Proceedings of the VLDB Endowment, 2017, 10(12): 1949−1952, articleTitle=null, refAbstract=null), Reference(id=1329458282827198900, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329458273247408477, doi=null, pmid=null, pmcid=null, year=null, volume=null, issue=null, pageStart=null, pageEnd=null, url=null, language=null, rfNumber=10, rfOrder=10, authorNames=null, journalName=null, refType=null, unstructuredReference=Li Chao, Li Y D, Miklau G, et al. A theory of pricing private data[J]. ACM Transactions on Database System, 2014, 39(4): 1−28, articleTitle=null, refAbstract=null), Reference(id=1329458282919473589, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329458273247408477, doi=null, pmid=null, pmcid=null, year=null, volume=null, issue=null, pageStart=null, pageEnd=null, url=null, language=null, rfNumber=11, rfOrder=11, authorNames=null, journalName=null, refType=null, unstructuredReference=Chen Chen, Yuan Ye, Wen Zhenyu, et al. GQP: A framework for scalable and effective graph query-based pricing[C]//Proc of the 38th IEEE Int Conf on Data Engineering. Piscataway, NJ: IEEE, 2022: 1573−1585, articleTitle=null, refAbstract=null), Reference(id=1329458283003359670, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329458273247408477, doi=null, pmid=null, pmcid=null, year=null, volume=null, issue=null, pageStart=null, pageEnd=null, url=null, language=null, rfNumber=12, rfOrder=12, authorNames=null, journalName=null, refType=null, unstructuredReference=Haddadi S, Ghasemi A. Pricing-based Stackelberg game for spectrum trading in self-organised heterogeneous networks[J]. IET Communications, 2016, 10(11): 1374−1383, articleTitle=null, refAbstract=null), Reference(id=1329458283070468535, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329458273247408477, doi=null, pmid=null, pmcid=null, year=null, volume=null, issue=null, pageStart=null, pageEnd=null, url=null, language=null, rfNumber=13, rfOrder=13, authorNames=null, journalName=null, refType=null, unstructuredReference=Xu Chengzhen, Zhu Kun, Yi Changyan, et al. Data pricing for blockchain- based car sharing: A stackelberg game approach[C/OL]//Proc of IEEE Global Communications Conf. Piscataway, NJ: IEEE, [2023-05-12]. https://ieeexplore.ieee.org/document/9322221, articleTitle=null, refAbstract=null), Reference(id=1329458283137577400, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329458273247408477, doi=null, pmid=null, pmcid=null, year=null, volume=null, issue=null, pageStart=null, pageEnd=null, url=null, language=null, rfNumber=14, rfOrder=14, authorNames=null, journalName=null, refType=null, unstructuredReference=苑迎,王翠荣,王聪,等. 基于非完全信息博弈的云资源分配模型[J]. 计算机研究与发展,2016,53(6):1342−1351, articleTitle=null, refAbstract=null), Reference(id=1329458283196297657, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329458273247408477, doi=null, pmid=null, pmcid=null, year=null, volume=null, issue=null, pageStart=null, pageEnd=null, url=null, language=null, rfNumber=14, rfOrder=15, authorNames=null, journalName=null, refType=null, unstructuredReference=Yuan Ying, Wang Cuirong, Wang Cong, et al. An uncompleted information game based resources allocation model for cloud computing[J]. Journal of Computer Research and Development, 2016, 53(6): 1342−1351(in Chinese), articleTitle=null, refAbstract=null), Reference(id=1329458283271795130, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329458273247408477, doi=null, pmid=null, pmcid=null, year=null, volume=null, issue=null, pageStart=null, pageEnd=null, url=null, language=null, rfNumber=15, rfOrder=16, authorNames=null, journalName=null, refType=null, unstructuredReference=Berz G. Game Theory Bargaining and Auction Strategies: Practical Examples from Internet Auctions to Unvestment Banking[M]. Berlin: Springer, 2016, articleTitle=null, refAbstract=null), Reference(id=1329458283338903995, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329458273247408477, doi=null, pmid=null, pmcid=null, year=null, volume=null, issue=null, pageStart=null, pageEnd=null, url=null, language=null, rfNumber=16, rfOrder=17, authorNames=null, journalName=null, refType=null, unstructuredReference=Riederer C, Erramilli V, Chaintreau A, et al. For sale: your data: by: you[C]//Proc of the 10th ACM Workshop on Hot Topics in Networks. New York: ACM, 2011: 13: 1−13: 6, articleTitle=null, refAbstract=null), Reference(id=1329458283406012860, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329458273247408477, doi=null, pmid=null, pmcid=null, year=null, volume=null, issue=null, pageStart=null, pageEnd=null, url=null, language=null, rfNumber=17, rfOrder=18, authorNames=null, journalName=null, refType=null, unstructuredReference=Susanto H, Zhang Honggang, Ho S Y, et al. Effective mobile data trading in secondary ad-hoc market with heterogeneous and dynamic environment[C]//Proc of the 37th IEEE Int Conf on Distributed Computing Systems (ICDCS). Los Alamitos, CA: IEEE Computer Society, 2017: 645−655, articleTitle=null, refAbstract=null), Reference(id=1329458283468927421, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329458273247408477, doi=null, pmid=null, pmcid=null, year=null, volume=null, issue=null, pageStart=null, pageEnd=null, url=null, language=null, rfNumber=18, rfOrder=19, authorNames=null, journalName=null, refType=null, unstructuredReference=Ghosh A, Roth A. Selling privacy at auction[C]//Proc of the 12th ACM Conf on Electronic Commerce. New York: ACM, 2011: 199−208, articleTitle=null, refAbstract=null), Reference(id=1329458283531841982, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329458273247408477, doi=null, pmid=null, pmcid=null, year=null, volume=null, issue=null, pageStart=null, pageEnd=null, url=null, language=null, rfNumber=19, rfOrder=20, authorNames=null, journalName=null, refType=null, unstructuredReference=Yang Jian, Zhao Chongchong, Xing Chunxiao. Big data market optimization pricing model based on data quality[J]. Complexity, 2019(2): 1−10, articleTitle=null, refAbstract=null), Reference(id=1329458283598950847, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329458273247408477, doi=null, pmid=null, pmcid=null, year=null, volume=null, issue=null, pageStart=null, pageEnd=null, url=null, language=null, rfNumber=20, rfOrder=21, authorNames=null, journalName=null, refType=null, unstructuredReference=Li Xijun, Yao Jianguo, Liu Xue, et al. A first look at information entropy-based data pricing[C]//Proc of the 37th IEEE Int Conf on Distributed Computing Systems (ICDCS). Piscataway, NJ: IEEE, 2017: 2053−2060, articleTitle=null, refAbstract=null), Reference(id=1329458283670254016, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329458273247408477, doi=null, pmid=null, pmcid=null, year=null, volume=null, issue=null, pageStart=null, pageEnd=null, url=null, language=null, rfNumber=21, rfOrder=22, authorNames=null, journalName=null, refType=null, unstructuredReference=Yu Haifei, Zhang Mengxiao. Data pricing strategy based on data quality[J]. Computers & Industrial Engineering, 2017(112): 1−10, articleTitle=null, refAbstract=null), Reference(id=1329458283737362881, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329458273247408477, doi=null, pmid=null, pmcid=null, year=null, volume=null, issue=null, pageStart=null, pageEnd=null, url=null, language=null, rfNumber=22, rfOrder=23, authorNames=null, journalName=null, refType=null, unstructuredReference=Kaggle. Personal dataset [EB/OL]. [2023-04-11]. https://www.kaggle.com/ datasets/wangtaobo/personal-data-datasets-for-big-data-research, articleTitle=null, refAbstract=null), Reference(id=1329458283796083138, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329458273247408477, doi=null, pmid=null, pmcid=null, year=null, volume=null, issue=null, pageStart=null, pageEnd=null, url=null, language=null, rfNumber=23, rfOrder=24, authorNames=null, journalName=null, refType=null, unstructuredReference=TPC. TPC-H benchmark[EB/OL]. [2023-10-11]. http://www.tpc.org/tpch/, articleTitle=null, refAbstract=null)], funds=null, companyList=[AuthorCompany(id=1329458275214537075, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329458273247408477, xref=null, ext=[AuthorCompanyExt(id=1329458275222925684, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329458273247408477, companyId=1329458275214537075, language=EN, country=null, province=null, city=null, postcode=null, companyName=null, departmentName=null, remark=School of Information Engineering, Zhongnan University of Economics and Law, Wuhan 430073), AuthorCompanyExt(id=1329458275235508597, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329458273247408477, companyId=1329458275214537075, language=CN, country=null, province=null, city=null, postcode=null, companyName=null, departmentName=null, remark=中南财经政法大学信息工程学院 武汉 430073)])], figs=[ArticleFig(id=1329458278435762576, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329458273247408477, language=EN, label=Figure 1, caption=Comparison results of query-labor game pricing and traditional query pricing, figureFileSmall=s3/CPVd5WtCsV8fljf4pcg==, figureFileBig=NtuMpEfBN1gCCjLjLJ6RmA==, tableContent=null), ArticleFig(id=1329458278502871441, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329458273247408477, language=CN, label=图1, caption=查询-劳资博弈定价与传统查询定价的结果对比, figureFileSmall=s3/CPVd5WtCsV8fljf4pcg==, figureFileBig=NtuMpEfBN1gCCjLjLJ6RmA==, tableContent=null), ArticleFig(id=1329458278695809426, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329458273247408477, language=EN, label=Figure 2, caption=Platform profits comparison, figureFileSmall=HHsBrYeiIe97LQAYbq+RbA==, figureFileBig=si+9K02DpDyZ5DtKaJr2Ow==, tableContent=null), ArticleFig(id=1329458278758723987, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329458273247408477, language=CN, label=图2, caption=平台收益对比, figureFileSmall=HHsBrYeiIe97LQAYbq+RbA==, figureFileBig=si+9K02DpDyZ5DtKaJr2Ow==, tableContent=null), ArticleFig(id=1329458278834221460, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329458273247408477, language=EN, label=Figure 3, caption=Buyer extra profits comparison, figureFileSmall=tj72kyMeyvrHntE7mtcWFg==, figureFileBig=XsZWP3YK4SZu/5sfGuIO1Q==, tableContent=null), ArticleFig(id=1329458278905524629, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329458273247408477, language=CN, label=图3, caption=买家额外收益对比, figureFileSmall=tj72kyMeyvrHntE7mtcWFg==, figureFileBig=XsZWP3YK4SZu/5sfGuIO1Q==, tableContent=null), ArticleFig(id=1329458278981022102, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329458273247408477, language=EN, label=Figure 4, caption=Comparison of privacy content obtained by buyers, figureFileSmall=VjenO5f1S83ZeKvW/c5LHw==, figureFileBig=LktIuN2kUN5wdJfTPSGw4Q==, tableContent=null), ArticleFig(id=1329458279035548055, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329458273247408477, language=CN, label=图4, caption=买家获得的隐私含量对比, figureFileSmall=VjenO5f1S83ZeKvW/c5LHw==, figureFileBig=LktIuN2kUN5wdJfTPSGw4Q==, tableContent=null), ArticleFig(id=1329458279111045529, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329458273247408477, language=EN, label=Figure 5, caption=Comparison of the satisfaction degree of buyers’ needs, figureFileSmall=99i0wmP1sO/PGSbSzUBP+Q==, figureFileBig=KB5uyoFT5zddNjmCOFS2uw==, tableContent=null), ArticleFig(id=1329458279220097433, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329458273247408477, language=CN, label=图5, caption=买家需求满足程度对比, figureFileSmall=99i0wmP1sO/PGSbSzUBP+Q==, figureFileBig=KB5uyoFT5zddNjmCOFS2uw==, tableContent=null), ArticleFig(id=1329458279316566426, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329458273247408477, language=EN, label=Figure 6, caption=Performance evaluation of the query-labor game pricing algorithm, figureFileSmall=uIH53Yh/g7ptOkm7Tcpxgw==, figureFileBig=eEC3QHBKyFZIZmOZOYoPxg==, tableContent=null), ArticleFig(id=1329458279383675291, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329458273247408477, language=CN, label=图6, caption=查询-劳资博弈定价算法执行性能评价, figureFileSmall=uIH53Yh/g7ptOkm7Tcpxgw==, figureFileBig=eEC3QHBKyFZIZmOZOYoPxg==, tableContent=null), ArticleFig(id=1329458279454978460, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329458273247408477, language=EN, label=Table 1, caption=

Income Matrix

, figureFileSmall=null, figureFileBig=null, tableContent=
交易平台策略买家策略
接受单位价格不接受单位价格
交易平台接受交易价值量$ (R(P,V) - z,U(P,V)) $$ (0,0) $
交易平台不接受交易价值量$ (0,0) $$ (0,0) $
), ArticleFig(id=1329458279517893021, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329458273247408477, language=CN, label=表1, caption=

收益矩阵

, figureFileSmall=null, figureFileBig=null, tableContent=
交易平台策略买家策略
接受单位价格不接受单位价格
交易平台接受交易价值量$ (R(P,V) - z,U(P,V)) $$ (0,0) $
交易平台不接受交易价值量$ (0,0) $$ (0,0) $
), ArticleFig(id=1329458279593390494, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329458273247408477, language=EN, label=Table 2, caption=

The Table of Dataset Detailed Information

, figureFileSmall=null, figureFileBig=null, tableContent=
数据集数据条数隐私含量
D120 00026 756
$D'_1 $20 00018 679
D230 00047 839
$D'_2 $30 00029 375
), ArticleFig(id=1329458279786328479, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329458273247408477, language=CN, label=表2, caption=

数据集详情表

, figureFileSmall=null, figureFileBig=null, tableContent=
数据集数据条数隐私含量
D120 00026 756
$D'_1 $20 00018 679
D230 00047 839
$D'_2 $30 00029 375
), ArticleFig(id=1329458279874408864, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329458273247408477, language=EN, label=Table 3, caption=

Experimental Datasets

, figureFileSmall=null, figureFileBig=null, tableContent=
数据集$ {V}_{\mathrm{m}\mathrm{a}\mathrm{x}} $$ {V}_{\mathrm{m}\mathrm{i}\mathrm{n}} $$ S $$ S/{V}_{\mathrm{m}\mathrm{a}\mathrm{x}} $
$ {D}_{1} $10 0007 0007000.080
$ {D}_{2} $20 0004 0004000.020
$ {D}_{3} $30 0005 0005000.017
), ArticleFig(id=1329458281493410209, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329458273247408477, language=CN, label=表3, caption=

实验数据集

, figureFileSmall=null, figureFileBig=null, tableContent=
数据集$ {V}_{\mathrm{m}\mathrm{a}\mathrm{x}} $$ {V}_{\mathrm{m}\mathrm{i}\mathrm{n}} $$ S $$ S/{V}_{\mathrm{m}\mathrm{a}\mathrm{x}} $
$ {D}_{1} $10 0007 0007000.080
$ {D}_{2} $20 0004 0004000.020
$ {D}_{3} $30 0005 0005000.017
), ArticleFig(id=1329458281564713378, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329458273247408477, language=EN, label=Table 4, caption=

Pricing Results of Stackelberg Game Pricing Algorithm Under Sufficient Budget

, figureFileSmall=null, figureFileBig=null, tableContent=
数据集买家花费或
平台收益
买家所获
隐私含量
买家需求
满足程度/%
买家额外
收益
$ {D}_{1} $656.2510 00010043.75
$ {D}_{2} $375.0020 00010025.00
$ {D}_{3} $468.7530 00010031.25
), ArticleFig(id=1329458281631822243, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329458273247408477, language=CN, label=表4, caption=

预算充足时斯塔克伯格博弈定价算法定价结果

, figureFileSmall=null, figureFileBig=null, tableContent=
数据集买家花费或
平台收益
买家所获
隐私含量
买家需求
满足程度/%
买家额外
收益
$ {D}_{1} $656.2510 00010043.75
$ {D}_{2} $375.0020 00010025.00
$ {D}_{3} $468.7530 00010031.25
), ArticleFig(id=1329458281698931108, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329458273247408477, language=EN, label=Table 5, caption=

Pricing Results of Query-Labor Game Pricing Algorithm Under Sufficient Budget

, figureFileSmall=null, figureFileBig=null, tableContent=
数据集买家花费或
平台收益
买家获得的
隐私含量
买家需求
满足程度/%
买家额外
收益
$ {D}_{1} $50510 000100195
$ {D}_{2} $28820 000100112
$ {D}_{3} $36030 000100140
), ArticleFig(id=1329458281782817189, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329458273247408477, language=CN, label=表5, caption=

预算充足时查询-劳资博弈定价算法定价结果

, figureFileSmall=null, figureFileBig=null, tableContent=
数据集买家花费或
平台收益
买家获得的
隐私含量
买家需求
满足程度/%
买家额外
收益
$ {D}_{1} $50510 000100195
$ {D}_{2} $28820 000100112
$ {D}_{3} $36030 000100140
), ArticleFig(id=1329458281862508966, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329458273247408477, language=EN, label=Table 6, caption=

Pricing Results of Stackelberg Game Pricing Algorithm with Priority Strategy Under Insufficient Budget

, figureFileSmall=null, figureFileBig=null, tableContent=
数据集买家花费或
平台收益
买家获得的
隐私含量
买家需求
满足程度/%
买家额外
收益
$ {D}_{1} $437.57 00070.000
$ {D}_{2} $2504 00020.000
$ {D}_{3} $312.55 00016.670
), ArticleFig(id=1329458281938006439, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329458273247408477, language=CN, label=表6, caption=

预算不足且采取优先策略时斯塔克伯格博弈定价算法的定价结果

, figureFileSmall=null, figureFileBig=null, tableContent=
数据集买家花费或
平台收益
买家获得的
隐私含量
买家需求
满足程度/%
买家额外
收益
$ {D}_{1} $437.57 00070.000
$ {D}_{2} $2504 00020.000
$ {D}_{3} $312.55 00016.670
), ArticleFig(id=1329458282013503912, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329458273247408477, language=EN, label=Table 7, caption=

Pricing Results of Query-Labor Game Pricing Algorithm with Priority Strategy Under Insufficient Budget

, figureFileSmall=null, figureFileBig=null, tableContent=
数据集买家花费或
平台收益
买家获得的
隐私含量
买家需求
满足程度/%
买家额外
收益
$ {D}_{1} $50510 000100195
$ {D}_{2} $28820 000100112
$ {D}_{3} $20716 82956.100
), ArticleFig(id=1329458282076418473, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329458273247408477, language=CN, label=表7, caption=

预算不足且采取优先策略时查询-劳资博弈定价算法的定价结果

, figureFileSmall=null, figureFileBig=null, tableContent=
数据集买家花费或
平台收益
买家获得的
隐私含量
买家需求
满足程度/%
买家额外
收益
$ {D}_{1} $50510 000100195
$ {D}_{2} $28820 000100112
$ {D}_{3} $20716 82956.100
)], attaches=null, journal=Journal(id=1324759606947315908, delFlag=0, nameCn=计算机研究与发展, nameEn=Journal of Computer Research and Development, nameHistory1=null, nameHistory2=null, issn=1000-1239, eissn=null, cn=11-1777/TP, coden=null, periodic=0, language=CN, oaType=null, ccby=null, superviseOffice=null, ownerOffice=null, pubOffice=null, editorOffice=null, officeType=null, aims=null, clcCode=null, officeProv=null, officeCity=null, officeAddr=null, officeZip=null, officeEmail=null, officePhone=null, editDirector=null, officeDirector=null, officeDirectorPhone=null, officeStaffNum=null, officeEmpNum=null, coverPicUrl=k2l8zgqwstuxxevFX2qxVA==, journalPrice=null, startedYear=null, abbrevIsoEn=Journal of Computer Research and Development, journalRemark=null, publicationField=null, createdTime=1793776903141, updatedTime=1793850698612, createdBy=18614031015, updatedBy=13701087609, firstLetterCn=J, firstLetterEn=J, subjectCode=Electronic Information, subjectName=null, subjectCodeEn=Electronic Information, subjectNameEn=null, picCn=k2l8zgqwstuxxevFX2qxVA==, picEn=r6k0Ry+RD+c/VXj5QarmDw==, jcr=null, cjcr=null, exts=[JournalExt(id=1325069127710286688, language=CN, name=计算机研究与发展, nameHistory1=null, nameHistory2=null, managedBy=, sponsoredBy=, publishedBy=, editorOffice=, officeProv=null, officeCity=null, officeAddr=, officeZip=, editDirector=, officeDirector=null, officePhone=null, coverPicUrl=null, journalRemark=, submitArticleUrl=null, websiteUrl=, createdTime=1793850698640, updatedTime=1793850698640, createdBy=13701087609, updatedBy=13701087609, submissionGuidelinesUrl=, submissionAuthorUrl=https://crad.ict.ac.cn/journalx/authorLogOn.action, submissionEditorUrl=https://crad.ict.ac.cn/journalx/editorLogOn.action, submissionReviewUrl=https://crad.ict.ac.cn/journalx/expertLogOn.action, submissionCeEditorUrl=https://crad.ict.ac.cn/journalx/editorInChiefLogOn.action, submissionAeEditorUrl=, option={"copyright":""}), JournalExt(id=1325069127777395553, language=EN, name=Journal of Computer Research and Development, nameHistory1=null, nameHistory2=null, managedBy=, sponsoredBy=, publishedBy=, editorOffice=, officeProv=null, officeCity=null, officeAddr=, officeZip=, editDirector=, officeDirector=null, officePhone=null, coverPicUrl=null, journalRemark=, submitArticleUrl=null, websiteUrl=, createdTime=1793850698656, updatedTime=1793850698656, createdBy=13701087609, updatedBy=13701087609, submissionGuidelinesUrl=, submissionAuthorUrl=https://crad.ict.ac.cn/journalx/authorLogOn.action, submissionEditorUrl=https://crad.ict.ac.cn/journalx/editorLogOn.action, submissionReviewUrl=https://crad.ict.ac.cn/journalx/expertLogOn.action, submissionCeEditorUrl=https://crad.ict.ac.cn/journalx/editorInChiefLogOn.action, submissionAeEditorUrl=, option={"copyright":""})], databaseList=null, tenantJournalId=1324759914146529478, websiteList=[Website(id=1325070300139892771, webName=null, webTitle=null, webDomain=null, webCopyrigh=null, webIpcNo=null, seoTitle=null, seoKeywords=null, seoDescription=null, tenantJournalId=null, journalId=1324759914146529478, journalNameCn=null, journalNameEn=null, grayFlag=null, tenantId=1146029695717560320, platformId=null, journalGroupId=null, journalGroupNameCn=null, journalGroupNameEn=null, type=1, domain=https://castjournals.cast.org.cn/joweb/jsjyjyfz/CN, language=CN, createTime=1793850978169, createBy=18614031015, updateTime=1793851040259, updateBy=18614031015, name=计算机研究与发展-中文, tplId=1146099689490845704, title=计算机研究与发展, delFlag=0, indexPage=/home, props=[WebsiteProps(id=1325070893751349360, tenantId=1146029695717560320, journalId=null, journalGroupId=null, siteId=1325070300139892771, code=articleTextType, value=kx, createTime=1793851119697, updateTime=1793851119697, creator=18614031015, updator=18614031015), WebsiteProps(id=1325070893730377837, tenantId=1146029695717560320, journalId=null, journalGroupId=null, siteId=1325070300139892771, code=banner, value=null, createTime=1793851119692, updateTime=1793851119692, creator=18614031015, updator=18614031015), WebsiteProps(id=1325070893772320883, tenantId=1146029695717560320, journalId=null, journalGroupId=null, siteId=1325070300139892771, code=grayFlag, value=0, createTime=1793851119702, updateTime=1793851119702, creator=18614031015, updator=18614031015), WebsiteProps(id=1325070893721989228, tenantId=1146029695717560320, journalId=null, journalGroupId=null, siteId=1325070300139892771, code=logo, value=https://castjournals.cast.org.cn/joweb/jsjyjyfz/CN/file/pic?fileId=U27tDsy717YF7XSPA+Vwdw==, createTime=1793851119690, updateTime=1793851119690, creator=18614031015, updator=18614031015), WebsiteProps(id=1325070893784903797, tenantId=1146029695717560320, journalId=null, journalGroupId=null, siteId=1325070300139892771, code=minRunFlag, value=0, createTime=1793851119705, updateTime=1793851119705, creator=18614031015, updator=18614031015), WebsiteProps(id=1325070893742960751, tenantId=1146029695717560320, journalId=null, journalGroupId=null, siteId=1325070300139892771, code=picServerUrl, value=https://castjournals.cast.org.cn/joweb/jsjyjyfz/CN/file/pic, createTime=1793851119695, updateTime=1793851119695, creator=18614031015, updator=18614031015), WebsiteProps(id=1325070893780709492, tenantId=1146029695717560320, journalId=null, journalGroupId=null, siteId=1325070300139892771, code=silenceFlag, value=0, createTime=1793851119704, updateTime=1793851119704, creator=18614031015, updator=18614031015), WebsiteProps(id=1325070893738766446, tenantId=1146029695717560320, journalId=null, journalGroupId=null, siteId=1325070300139892771, code=staticResourcePath, value=https://castjournals.cast.org.cn/joweb/cast_kjdb_cn_619/, createTime=1793851119694, updateTime=1793851119694, creator=18614031015, updator=18614031015), WebsiteProps(id=1325070893755543665, tenantId=1146029695717560320, journalId=null, journalGroupId=null, siteId=1325070300139892771, code=themeColor, value=null, createTime=1793851119698, updateTime=1793851119698, creator=18614031015, updator=18614031015), WebsiteProps(id=1325070893763932274, tenantId=1146029695717560320, journalId=null, journalGroupId=null, siteId=1325070300139892771, code=themeStyle, value=null, createTime=1793851119700, updateTime=1793851119700, creator=18614031015, updator=18614031015)]), Website(id=1325070300580294698, webName=null, webTitle=null, webDomain=null, webCopyrigh=null, webIpcNo=null, seoTitle=null, seoKeywords=null, seoDescription=null, tenantJournalId=null, journalId=1324759914146529478, journalNameCn=null, journalNameEn=null, grayFlag=null, tenantId=1146029695717560320, platformId=null, journalGroupId=null, journalGroupNameCn=null, journalGroupNameEn=null, type=1, domain=https://castjournals.cast.org.cn/joweb/jsjyjyfz/EN, language=EN, createTime=1793850978274, createBy=18614031015, updateTime=1793851036638, updateBy=18614031015, name=计算机研究与发展-英文, tplId=1146101810881728533, title=Journal of Computer Research and Development, delFlag=0, indexPage=/home, props=[WebsiteProps(id=1325070925288321148, tenantId=1146029695717560320, journalId=null, journalGroupId=null, siteId=1325070300580294698, code=articleTextType, value=kx, createTime=1793851127216, updateTime=1793851127216, creator=18614031015, updator=18614031015), WebsiteProps(id=1325070925263155321, tenantId=1146029695717560320, journalId=null, journalGroupId=null, siteId=1325070300580294698, code=banner, value=null, createTime=1793851127210, updateTime=1793851127210, creator=18614031015, updator=18614031015), WebsiteProps(id=1325070925309292671, tenantId=1146029695717560320, journalId=null, journalGroupId=null, siteId=1325070300580294698, code=grayFlag, value=0, createTime=1793851127221, updateTime=1793851127221, creator=18614031015, updator=18614031015), WebsiteProps(id=1325070925254766712, tenantId=1146029695717560320, journalId=null, journalGroupId=null, siteId=1325070300580294698, code=logo, value=https://castjournals.cast.org.cn/joweb/jsjyjyfz/EN/file/pic?fileId=U27tDsy717YF7XSPA+Vwdw==, createTime=1793851127208, updateTime=1793851127208, creator=18614031015, updator=18614031015), WebsiteProps(id=1325070925326069889, tenantId=1146029695717560320, journalId=null, journalGroupId=null, siteId=1325070300580294698, code=minRunFlag, value=0, createTime=1793851127225, updateTime=1793851127225, creator=18614031015, updator=18614031015), WebsiteProps(id=1325070925279932539, tenantId=1146029695717560320, journalId=null, journalGroupId=null, siteId=1325070300580294698, code=picServerUrl, value=https://castjournals.cast.org.cn/joweb/jsjyjyfz/EN/file/pic, createTime=1793851127214, updateTime=1793851127214, creator=18614031015, updator=18614031015), WebsiteProps(id=1325070925317681280, tenantId=1146029695717560320, journalId=null, journalGroupId=null, siteId=1325070300580294698, code=silenceFlag, value=0, createTime=1793851127223, updateTime=1793851127223, creator=18614031015, updator=18614031015), WebsiteProps(id=1325070925271543930, tenantId=1146029695717560320, journalId=null, journalGroupId=null, siteId=1325070300580294698, code=staticResourcePath, value=https://castjournals.cast.org.cn/joweb/cast_kjdb_en_623/, createTime=1793851127212, updateTime=1793851127212, creator=18614031015, updator=18614031015), WebsiteProps(id=1325070925292515453, tenantId=1146029695717560320, journalId=null, journalGroupId=null, siteId=1325070300580294698, code=themeColor, value=null, createTime=1793851127217, updateTime=1793851127217, creator=18614031015, updator=18614031015), WebsiteProps(id=1325070925300904062, tenantId=1146029695717560320, journalId=null, journalGroupId=null, siteId=1325070300580294698, code=themeStyle, value=null, createTime=1793851127219, updateTime=1793851127219, creator=18614031015, updator=18614031015)])], journalTitle=计算机研究与发展, weixinUrl=null, journalUrl=https://crad.ict.ac.cn/, iacademicId=null, status=1, seqNo=null, journalTitleEn=Journal of Computer Research and Development, journalPhotoCn=k2l8zgqwstuxxevFX2qxVA==, journalPhotoEn=r6k0Ry+RD+c/VXj5QarmDw==, journalFirstLetter=J, journalRecommend=null, journalNew=null, journalCollection=null, jcrJf=null, cjcrJf=null, jcrJfStr=null, cjcrJfStr=null, submissionFirstDecision=null, sciSubjectClassification=null, casSubjectClassification=null, citeScore=null, totalCitationFrequency=null, icpCode=null, psCode=null, advertisingLicenseCode=null, copyrightInformation=null, country=null, option=, provinceCode=null, provinceName=null, collectFlag=false, interPubPlatform=, interPubPlatformUrl=null), detailUrlCn=https://castjournals.cast.org.cn/joweb/jsjyjyfz/CN/10.7544/issn1000-1239.202330791, detailUrlEn=https://castjournals.cast.org.cn/joweb/jsjyjyfz/EN/10.7544/issn1000-1239.202330791, pdfUrlCn=https://castjournals.cast.org.cn/joweb/jsjyjyfz/CN/PDF/10.7544/issn1000-1239.202330791, pdfUrlEn=https://castjournals.cast.org.cn/joweb/jsjyjyfz/EN/PDF/10.7544/issn1000-1239.202330791, aliStartDate=0, aliEndDate=0, collectionFlag=false, citedCount=null, citedUrl=null, previewStatus=0, delFlag=0, hasFullText=1, orderTime=1732982400000, fullTextJson=null, articleText=null, reference=null)
收藏切换
基于劳资博弈模型的实用查询定价新算法
王会举 , 黄玮煊 , 岳晓 *
计算机研究与发展 | 人工智能 2024,61(12): 3154-3167
收起
收藏切换
计算机研究与发展 |人工智能 2024 , 61 (12) : 3154 -3167
基于劳资博弈模型的实用查询定价新算法
全屏
[Author(id=1329458275331977591, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329458273247408477, orderNo=0, firstName=null, middleName=null, lastName=null, nameCn=null, orcid=null, stid=null, country=null, authorPic=null, dead=0, email=wanghj@zuel.edu.cn, emailSecond=null, emailThird=null, correspondingAuthor=0, authorType=1, ext={EN=AuthorExt(id=1329458275432640889, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329458273247408477, authorId=1329458275331977591, language=EN, stringName=Huiju Wang, firstName=Huiju, middleName=null, lastName=Wang, prefix=null, suffix=null, authorComment=null, nameInitials=null, affiliation=null, department=null, xref=null, address=School of Information Engineering, Zhongnan University of Economics and Law, Wuhan 430073, bio={"content":"

born in 1979. PhD, associate professor, master supervisor. Member of CCF. His research interests include big data, high performance database, graph database, and AI

"}, bioImg=null, bioContent=

born in 1979. PhD, associate professor, master supervisor. Member of CCF. His research interests include big data, high performance database, graph database, and AI

, aboutCorrespAuthor=null), CN=AuthorExt(id=1329458277039059322, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329458273247408477, authorId=1329458275331977591, language=CN, stringName=王会举, firstName=null, middleName=null, lastName=null, prefix=null, suffix=null, authorComment=null, nameInitials=null, affiliation=null, department=null, xref=null, address=中南财经政法大学信息工程学院 武汉 430073, bio={"img":"+pJJW+Qi9vcaBwwHto+vfg==","content":"

1979年生. 博士,副教授,硕士生导师. CCF会员. 主要研究方向为大数据、高性能数据库、图数据库、人工智能

"}, bioImg=+pJJW+Qi9vcaBwwHto+vfg==, bioContent=

1979年生. 博士,副教授,硕士生导师. CCF会员. 主要研究方向为大数据、高性能数据库、图数据库、人工智能

, aboutCorrespAuthor=null)}, companyList=[AuthorCompany(id=1329458275214537075, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329458273247408477, xref=null, ext=[AuthorCompanyExt(id=1329458275222925684, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329458273247408477, companyId=1329458275214537075, language=EN, country=null, province=null, city=null, postcode=null, companyName=null, departmentName=null, remark=School of Information Engineering, Zhongnan University of Economics and Law, Wuhan 430073), AuthorCompanyExt(id=1329458275235508597, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329458273247408477, companyId=1329458275214537075, language=CN, country=null, province=null, city=null, postcode=null, companyName=null, departmentName=null, remark=中南财经政法大学信息工程学院 武汉 430073)])]), Author(id=1329458277110362492, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329458273247408477, orderNo=1, firstName=null, middleName=null, lastName=null, nameCn=null, orcid=null, stid=null, country=null, authorPic=null, dead=0, email=null, emailSecond=null, emailThird=null, correspondingAuthor=0, authorType=1, ext={EN=AuthorExt(id=1329458277185859966, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329458273247408477, authorId=1329458277110362492, language=EN, stringName=Weixuan Huang, firstName=Weixuan, middleName=null, lastName=Huang, prefix=null, suffix=null, authorComment=null, nameInitials=null, affiliation=null, department=null, xref=null, address=School of Information Engineering, Zhongnan University of Economics and Law, Wuhan 430073, bio={"content":"

born in 1999. Master. His main research interests include data pricing and big data

"}, bioImg=null, bioContent=

born in 1999. Master. His main research interests include data pricing and big data

, aboutCorrespAuthor=null), CN=AuthorExt(id=1329458277269746048, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329458273247408477, authorId=1329458277110362492, language=CN, stringName=黄玮煊, firstName=null, middleName=null, lastName=null, prefix=null, suffix=null, authorComment=null, nameInitials=null, affiliation=null, department=null, xref=null, address=中南财经政法大学信息工程学院 武汉 430073, bio={"img":"CkeHeM2p7Ryjg4kpC6UT3A==","content":"

1999年生. 硕士. 主要研究方向为数据定价、大数据

"}, bioImg=CkeHeM2p7Ryjg4kpC6UT3A==, bioContent=

1999年生. 硕士. 主要研究方向为数据定价、大数据

, aboutCorrespAuthor=null)}, companyList=[AuthorCompany(id=1329458275214537075, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329458273247408477, xref=null, ext=[AuthorCompanyExt(id=1329458275222925684, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329458273247408477, companyId=1329458275214537075, language=EN, country=null, province=null, city=null, postcode=null, companyName=null, departmentName=null, remark=School of Information Engineering, Zhongnan University of Economics and Law, Wuhan 430073), AuthorCompanyExt(id=1329458275235508597, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329458273247408477, companyId=1329458275214537075, language=CN, country=null, province=null, city=null, postcode=null, companyName=null, departmentName=null, remark=中南财经政法大学信息工程学院 武汉 430073)])]), Author(id=1329458277366215042, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329458273247408477, orderNo=2, firstName=null, middleName=null, lastName=null, nameCn=null, orcid=null, stid=null, country=null, authorPic=null, dead=0, email=yuexiao@zuel.edu.cn, emailSecond=null, emailThird=null, correspondingAuthor=1, authorType=1, ext={EN=AuthorExt(id=1329458277450101124, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329458273247408477, authorId=1329458277366215042, language=EN, stringName=Xiao Yue, firstName=Xiao, middleName=null, lastName=Yue, prefix=null, suffix=null, authorComment=null, nameInitials=null, affiliation=null, department=null, xref=*, address=School of Information Engineering, Zhongnan University of Economics and Law, Wuhan 430073, bio={"content":"

born in 1980. PhD, associate professor, master supervisor. Her main research interests include big data and data trading

"}, bioImg=null, bioContent=

born in 1980. PhD, associate professor, master supervisor. Her main research interests include big data and data trading

, aboutCorrespAuthor=null), CN=AuthorExt(id=1329458277521404293, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329458273247408477, authorId=1329458277366215042, language=CN, stringName=岳晓, firstName=null, middleName=null, lastName=null, prefix=null, suffix=null, authorComment=null, nameInitials=null, affiliation=null, department=null, xref=*, address=中南财经政法大学信息工程学院 武汉 430073, bio={"img":"WhdkAHRrTso5x7H520QdEQ==","content":"

1980年生. 博士,副教授,硕士生导师. 主要研究方向为大数据、数据交易

"}, bioImg=WhdkAHRrTso5x7H520QdEQ==, bioContent=

1980年生. 博士,副教授,硕士生导师. 主要研究方向为大数据、数据交易

, aboutCorrespAuthor=null)}, companyList=[AuthorCompany(id=1329458275214537075, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329458273247408477, xref=null, ext=[AuthorCompanyExt(id=1329458275222925684, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329458273247408477, companyId=1329458275214537075, language=EN, country=null, province=null, city=null, postcode=null, companyName=null, departmentName=null, remark=School of Information Engineering, Zhongnan University of Economics and Law, Wuhan 430073), AuthorCompanyExt(id=1329458275235508597, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1329458273247408477, companyId=1329458275214537075, language=CN, country=null, province=null, city=null, postcode=null, companyName=null, departmentName=null, remark=中南财经政法大学信息工程学院 武汉 430073)])])]
王会举 , 黄玮煊, 岳晓*
作者信息
  • 中南财经政法大学信息工程学院 武汉 430073
通讯作者:
作者简介:

1979年生. 博士,副教授,硕士生导师. CCF会员. 主要研究方向为大数据、高性能数据库、图数据库、人工智能

1999年生. 硕士. 主要研究方向为数据定价、大数据

1980年生. 博士,副教授,硕士生导师. 主要研究方向为大数据、数据交易

Novel Practical Query Pricing Algorithm Based on Labor Game Model
Huiju Wang , Weixuan Huang, Xiao Yue*
Affiliations
  • School of Information Engineering, Zhongnan University of Economics and Law, Wuhan 430073
  • born in 1979. PhD, associate professor, master supervisor. Member of CCF. His research interests include big data, high performance database, graph database, and AI

    born in 1999. Master. His main research interests include data pricing and big data

    born in 1980. PhD, associate professor, master supervisor. Her main research interests include big data and data trading

出版时间: 2024-12-01 doi: 10.7544/issn1000-1239.202330791
文章导航
收藏切换

在数据要素化的推动下,传统查询定价方法因其前提假设要求过高、灵活动态性支持有限、关键因素考虑不足等问题,面临落地难的巨大挑战. 为解决以上问题,创新设计了基于劳资博弈模型的查询定价算法,该算法利用劳资博弈模型对数据交易中参与方进行建模,将数据交易平台和数据买方分别视作工会和用人单位;数据交易平台(工会)负责各交易数据集价值(劳动者工资)公平透明计算,以尽可能促成交易为目标;数据买方根据各数据集估量价值、自身需求和自身预算,决定各数据集购买数量,藉此实现兼顾三方利益的交易数据集定价. 实验表明,该算法相比于流行的斯塔克伯格博弈模型,更能兼顾各方利益,更加公平;相比于传统的基于查询的数据定价方法,该定价算法更易落地应用、更具动态灵活性,可以跟随查询结果的变化实现价格的动态调整. 该定价算法时间复杂度为O(N)(N为查询相关数据集个数),且具有无套利性.

查询定价  /  劳资博弈模型  /  数据定价  /  数据交易  /  公平定价

With the promotion of data as a production factor, traditional query pricing methods face tremendous challenges in practical applications due to their overly strict premise assumptions, limited support for flexibility and dynamics, and inadequate consideration of key factors. To address these issues, we innovatively design a query pricing algorithm based on the labor game model. This algorithm models the participants in data transactions as labor unions and employers, and treats the data trading platform and data buyers as the labor union and employers, respectively. The data trading platform (labor union) is responsible for the fair and transparent calculation of the value of each traded dataset (wages), aiming to facilitate transactions as much as possible. Data buyers determine the purchase quantities of datasets based on their estimated value, personal needs, and budgets, thereby achieving a pricing strategy that balances the interests of all three parties. Experimental results demonstrate that compared with the popular Stackelberg game model, our algorithm better accommodates the interests of all parties and ensures greater fairness. Compared with traditional query-based data pricing methods, our pricing algorithm is more practical, offers greater flexibility and dynamics, and can dynamically adjust prices in response to changes in query results. The time complexity of our pricing algorithm is O(N), where N is the number of datasets related to the query, and it also guarantees no arbitrage.

query pricing  /  labor game model  /  data pricing  /  data trading  /  fair pricing
王会举, 黄玮煊, 岳晓. 基于劳资博弈模型的实用查询定价新算法. 计算机研究与发展, 2024 , 61 (12) : 3154 -3167 . DOI: 10.7544/issn1000-1239.202330791
Huiju Wang, Weixuan Huang, Xiao Yue. Novel Practical Query Pricing Algorithm Based on Labor Game Model[J]. Journal of Computer Research and Development, 2024 , 61 (12) : 3154 -3167 . DOI: 10.7544/issn1000-1239.202330791
数据的爆发增长、海量集聚蕴藏了巨大的价值,为智能化发展带来了新的机遇[1]. 数据的流通汇聚是从数据“量变”到知识“质变”的关键步骤. 数据定价是数据要素流通的核心问题之一. 基于查询的数据定价(简称查询定价)是对数据库查询结果进行价格计算的算法[2]. 在数据要素化的背景下,传统查询定价算法面临落地难的巨大挑战:
1)用户关键需求考虑不足,难以促成交易. 传统查询定价方法较少考虑用户的关键购买需求,尤其是用户预算、多数据集组合购买及数据集倾向性等需求,容易导致交易失败.
2)前提假设要求过高,难以落地. 传统查询定价方法往往需要用户预设细粒度价格点如$ \langle $基础视图,价格$ \rangle$点,查询基于预设基础视图进行,查询结果价格基于预设的基础视图价格点推导而出. 由于数据商品的非标性,由普通用户来预设价格点,在实际操作中并不现实.
3)用户查询的动态灵活性支持不足,难以满足用户对交易数据集的灵活定制化需求. 传统查询定价方法中查询的灵活性往往取决于基础视图的定义,导致查询的动态灵活性不足. 虽然已有研究关注到此问题,提出基于元组的定价方法[3],但也存在空间或时间成本过高的问题,而且粒度只到元组,未到列级,动态灵活性仍然有限,也严重影响了其推广应用.
为解决传统查询定价中存在的以上遗留问题,本文研究创新性提出了一种兼顾数据交易参与双方利益的新查询定价方法——基于劳资博弈的查询定价算法. 该算法采用更加适合数据交易市场的新博弈模型——劳资博弈模型——来实现双方利益的博弈计算,最终实现查询公平价格的计算,避免目前常用的动态博弈模型——斯塔克伯格博弈——在数据定价中存在的不公平问题. 该算法无需数据提供者预设价格点,系统可以自动利用现有数据集价值量计算算法,通过劳资博弈模型计算出数据交易价格. 大量实验结果表明,基于劳资博弈的查询定价算法可以兼顾双方利益,实现多数据集动态公平定价,能更直接地指导交易,有效促成交易的达成.
本文研究贡献有3点:
1)首次提出多数据集组合购买定价问题.
2)创新设计了基于劳资博弈模型的查询定价算法. 该算法无需预设价格点,可以根据买方需求,实现多数据集的组合定价,兼具动态灵活性和公平合理性,更易促成数据交易的达成.
3)进行了大量实验验证分析,验证了基于劳资博弈的查询定价算法可以兼顾双方利益,实现多数据集动态公平定价,能更直接地指导交易,有效促成交易的达成.
从定价原理角度来看,同本文工作相关的研究主要是基于查询的定价方法和基于博弈的定价方法,现综述如下.
1)基于查询的定价方法
Balazinska等人[4]有远见地指出了查询定价对数据库社区的重要性,随后文献[2-10]进一步发展了这个观点,并提出了一系列查询定价方法. Koutris等人[2]提出的查询定价模型允许卖家对部分视图指定明确的价格,模型会根据这些视图自动导出其他买家查询的视图集价格,且针对该模型提出了定价函数,并证明该函数满足定价模型的无套利和无折扣要求. Lin等人[5]考虑了查询定价的套利情况,并提出了免套利定价函数,以解决基于查询定价所导致的套利问题. Upadhyaya等人[6]提出了基于退款的历史感知定价. 文献[7]描述了不同套利条件下定价函数的可能空间,其理论框架在Qirana系统中得到了应用[8-9]. Tang等人[3]提出了类似的基于元组的定价方法,即只有对结果集有贡献的元组才会被计费. 然而,此类查询定价需要预设一些细粒度的价格点如$ \langle $基础视图,价格$ \rangle $,因此此类方法计算复杂度较高,并且很难根据结果集自身价值动态地调整价格. Li等人[10]提出了一种基于量化噪声的定价模型,加入的噪声越多,获取的数据集的敏感度越低,数据集的价格越便宜. 该工作结合差分隐私和查询,以扰动的程度作为价值衡量的参考,此举一定程度上实现了动态定价,使得数据集价格可以随着扰动参数变化,但是其研究没有给出无扰动的原始数据集是如何定价的,如果还是通过给定价格点进行推导,那么该研究的定价方法还是无法完全实现动态定价. Chen等人[11]也采用文献[2]预设价格点的方式,对图数据定价问题进行了研究.
基于查询的定价方法能够很好地满足交易数据集的定制化需求,且在实时系统中有着良好的发挥空间. 但现有查询定价研究主要关注单个查询结果的购买定价问题,较少考虑多查询集的组合购买定价问题. 此外,其预设价格点的前提要求在现实应用中存在落地难的问题. 数据卖家如何合理地预设价格点才能满足双方收益最大化,实现公平定价,也是基于查询的定价方法需要解决的难题.
2)基于博弈的定价方法
博弈定价是商品定价的常用方法. 在数据定价领域,因为目前缺乏有效的实际交易价格确定方法,使得博弈定价在定价领域取得了非常好的效果. Haddadi等人[12]提出了一个基于斯塔克伯格博弈的定价模型,该模型是一个典型的双寡头完全信息动态博弈模型,其特点是不要求博弈双方同时做出决策,而是运行一方在对方决策后才进行决策,因此后决策的一方总是会取得博弈的有利地位. Xu等人[13]针对汽车共享设计了数据卖方、交易平台及数据买方三方参与的斯塔克伯格博弈数据定价方法. 苑迎等人[14]面向云资源提出了一种基于非完全信息的动态博弈定价模型. Berz [15]利用讨价还价博弈来作为复杂谈判情况下提升拍卖性能的有效举措. Riederer等人[16]提出了利用拍卖会来出售个人数据. Susanto等人[17]提出了一种基于McAfee拍卖模型的双向拍卖机制,且证明了该机制能够达到纳什均衡. Ghosh等人[18]利用差分隐私和拍卖会来最大程度实现保护隐私的同时以最低价格买到最准确的个人数据.
基于博弈的定价解决了静态定价的问题,在理性博弈时可以真实体现出商品的价格,并且能够满足双边收益最大化,实现公平定价. 但是其缺点也非常明显. 首先是拍卖、讨价还价等博弈定价方法效率低下;其次是交易的数据包是已经打包好再进行出售的,难以满足交易中的定制化需求;再次是交易者们不总是理性的,特别是在拍卖、讨价还价时,商品成交价格可能会极大地偏离商品价值. 基于斯塔克伯格的定价模型解决了以往拍卖讨价还价的低效率问题,尽量规避了在定价时交易者们容易出现的不理性行为,但是由于斯塔克伯格博弈模型是一个大小寡头的博弈模型,其博弈双方地位的不对等性易导致定价不公平性问题.
本节介绍如何利用劳资博弈模型实现查询定价算法,包括算法流程、建模及模型求解3部分内容.
目标问题可建模描述为函数P=f(ds,Q,W,S,B),其中函数f即是本文研究所提的劳资博弈定价函数,其输入参数ds={D1, D2, …, Dn}为待售数据集集合,Q={Q1, Q2, …, Qn}为买方查询束,W为买方对查询结果集的倾向排序,S为买方购买策略,B为买家预算;其输出为买家数据集最优购买组合及各数据集价格集合P={$ \langle $Q(Di), Pi$ \rangle $, $ \langle $Q(Dj), Pj$ \rangle $, …, $ \langle $Q(Dk), Pk$ \rangle $| 1<i, j, k<n}, Q(Di)为从数据集Di购买的查询结果集,Pi为买方购买Q(Di)查询结果集应支付的价格. 目标问题求解即是以参数ds,Q,W,S,B为输入的定价函数f的结果计算.
查询定价的思想源于基于版本的数据定价. 基于版本的数据定价思想是平台通过预设多个数据版本,并为每个数据版本预设价格,来满足不同数据买家的需求. 基于查询的定价方法考虑了结构化数据的多版本,让买家提出任意的结构化查询语句,结构化数据定价系统根据查询语句生成指定的数据集,并自动生成价格. 在Koutris等人[2-9]的一系列工作中,数据集的价格是基于卖家预设的价格点,借助定价函数来自动生成的. 预设价格点方式存在落地难、动态灵活性不足等问题,本文研究对其思路进行了改进,将预设价格点操作替换为数据价值量的计算,并利用劳资博弈模型实现定价函数. 改进后的定价步骤有:
1)交易平台对上架数据集价值进行衡量1;
2)买家输入查询语句2;
3)交易平台执行查询语句,获得每一个数据源i的查询结果集$ D $i,计算结果集单位价值量$ ({D}_{i},{\theta }_{i}) $;
4)交易平台利用劳资博弈定价函数$ f $计算结果集$ D $i的价格.
举例说明定价算法流程如下:某服装公司拟购买一些男装交易数据用于构建男装销售预测模型. 该公司登录某数据交易平台,选择电商类数据,发现有2个数据包可用,分别叫作“京东男鞋”和“京东男装_女装_童装”,分别记为数据集D1和数据集D2. 数据集D1售价101855元,大小290 MB;数据集D2售价9150元,大小22 MB. 该公司建模人员在每个数据集上查询选择部分或者全部数据,查询结果分别记为R1=Q(D1)和R2=Q(D2),数据交易平台根据该公司的预算B、数据集倾向性(数据集购买优先级排序)及购买策略(均衡购买策略、部分优先购买策略等,详见2.5节算法1)、基于价值量计算函数(详见附录A)计算出R1和R2所含价值量,并计算出各自数据价值量单价,利用劳资博弈定价函数(详见2.3~2.5节后续内容)给出每个数据集的购买量及其价格.
1946年,里昂惕夫提出劳资博弈模型,用以描述代表劳资双方的工会与企业之间的博弈问题. 该模型是一个完全信息动态博弈模型. 模型假设工人工资完全由工会决定,雇工数量则由企业根据工会提出的工资要求自行调整;工会在促进企业健康发展的前提下权衡工人工资,以使工人接受工资、企业雇佣更多工人.
根据上述博弈情形,本文研究基于一般的数据交易情况,提出2个博弈变量,分别称作交易价值量$ V $和单位价格$ P $,并设定数据买家的收益函数为R和数据交易平台的收益函数为U. 价值量是数据集价值的衡量指标,假设数据集$ D $的成本为z,其含有的价值量为$ \theta $,针对数据集$ D $的交易价值量$ V\in [0,\theta ] $. 单位价格$ P $为数据买家愿为单位价值量$\varDelta $支付的价格. 单位价值量$\varDelta $是数据集交易的基本单位,$\varDelta = 1/\theta $价值量在实际的交易情形中是多样的,可以是数据集的质量量化值 [19],也可以是数据集的信息熵[20]等价值衡量因素. 在针对一些特殊数据类别进行定价的时候,还会有更加有针对性的价值衡量因素,比如隐私价值[10].
基于V和P这2个博弈变量和交易双方的收益函数,本次交易场景的收益矩阵如表1所示. 接下来将对本次博弈的子精炼纳什均衡解进行具体分析. 数据交易平台是本次博弈的先行动方,在劳资博弈模型中,充当着工会的角色. 工会在劳资博弈中决定工人的工资,数据交易平台在本文研究所涉及的交易情景中决定单位价格. 工会的收益是一个关于工资和就业人数双变量的函数,因此,数据交易平台的收益也是一个关于单位价格$ P $与交易价值量$ V $双变量的函数.
根据效用理论,数据买家的资源是有限的. 设数据买家预算为B,输入一组查询Q={Q1, Q2, …, Qn}对应输出结果集R={R1, R2, …, Rn},则数据交易平台的收益函数为
$ U=\displaystyle\sum_{i = 1}^n {U(P_i,V_i} ) = \displaystyle\sum_{i = 1}^n {P_i \times V_i} - z \text{,} $
$ {\text{s}}{\text{.t}}{\text{. }}P_i > 0 \text{,} $
$ 0 < V_i \leqslant V_{\max_i} \text{,} $
$ \displaystyle\sum_{i = 1}^n {U(P_i,V_i} ) \leqslant B . $
式(1)中,$ P_i $是结果集Ri的单位价格,$ V_i $是买家针对结果集Ri成交的交易价值量,$ {V_{\max_i}} $是结果集Ri可获得的最大价值量,z是数据成本.
数据买家作为本次博弈的后动方,在劳资博弈模型中充当着企业的角色. 企业在劳资博弈中决定雇工的数量,对应地,数据买家决定交易价值量的多少. 企业的利润等于企业的雇工收益减去雇工成本,因此企业的收益是一个关于工资和雇工人数双变量的函数. 同理,数据买家的收益是一个关于单位价格与交易价值量的双变量函数. 设
$ R=\displaystyle\sum_{i=1}^nR(P_i,V_i)=\displaystyle\sum_{i=1}^n(G_i(V_i)-P_i\times V_i), $
$ {\text{s}}{\text{.t}}{\text{. }}V_{\min_i} \leqslant V_i \leqslant V_{\max_i} . $
式(2)中,Gi(Vi)是数据买家有关于结果集Ri交易价值量的收益函数,$ V_{\min_i} $是数据买家所能接受的交易价值量的最小值,低于该值的结果集Ri对数据买家没有收益,即收益为0.
本节讨论如何基于构建的博弈模型确定最优博弈解,也称为子精炼纳什均衡解. 买卖双方的交易目的均是获取各自的最大利润,可以公式化表示为
$ \left\{\begin{aligned}&\mathrm{max}{\displaystyle\sum _{i=1}^{n}U(P_i,V_i)\text{,}}\\ &\mathrm{max}{\displaystyle\sum _{i=1}^{n}R(P_i,V_i). }\end{aligned}\right. $
求解此不定方程即可获得本次交易的最优$ ({P}_{i}^{\mathrm{*}},{V}_{i}^{\mathrm{*}}) $.
为了进一步演示博弈的求解流程,对买家的收益函数和卖家的成本做出以下假设. 根据文献[21]以及数据交易场景,买家的收益取决于数据对买家的效用,故而假设数据商品$ i $的效用函数为
$ G_i(V_i)=S_i\times log_{a_i}\left(a_i-1+\dfrac{V_i}{V_{\max_i}}\right), $
$ {\text{s}}{\text{.t}}{\text{. }}{V_{{\text{min}}_i}} \leqslant V_i \leqslant {V_{{\text{max}}_i}} . $
式(4)中,Gi($ {V}_{i} $)是一个以交易价值量为自变量的增函数,Gi($ {V}_{i} $)在数值上表现为愿意为产品支付的预期价格. 数值越大,商品对消费者的效用就越大,商品对消费者需求的满足程度越高,消费者的支付意愿越大. Si是用户对商品$ i $的最大支付意愿,$ {\alpha }_{i} $为拟合参数,用于表现不同的消费者对商品量的偏好度. 面对理智的消费者,一个商品的最大效用不会超过消费者的最大支付意愿.
鉴于数据成本为固定值,为便于讨论,假设数据卖家的数据成本$ z=0 $. 求解的目标问题变为
$ \left\{\begin{aligned}&\mathrm{max}{\displaystyle\sum _{i=1}^{n}\left(S_i\times {\mathrm{log}}_{a_i}\left(a_i-1+\dfrac{V_i}{V_{\max_i}}\right)-P_i\times V_i\right)\text{,}} \\ &\mathrm{max}{\displaystyle\sum _{i=1}^{n}P_i\times V_i}. \end{aligned}\right. $
根据动态博弈的逆向归纳法,首先分析数据买家的博弈最优解. 令$ \dfrac{{\partial R(P_i,V_i)}}{{\partial V_i}} = 0 $,可得
$ \dfrac{{S_i}}{{\ln 2 \times (V_{\max_i} + V_i)}} = P_i \text{,} $
$ V_i^*(P_i) = \dfrac{{S_i}}{{P_i \times \ln 2}} - V_{\max_i} . $
式(7)中,
$ \dfrac{{S_i}}{{2\ln 2 \times {V_{\max_i}}}} < {P_i} < \dfrac{{S_i}}{{\ln 2 \times ({V_{\max_i}} + {V_{\min_i}})}} . $
综上,就获得了针对数据交易平台提出的不同单位价格$ {P}_{i} $,买家的最优交易价值量$ {V}_{i}^{*}\left({P}_{i}\right) $的函数表达式为
$ {V}_{i}^{*}({P}_{i})=\left\{\begin{aligned}&{V}_{\mathrm{max}_i},\;\; P_i\le \dfrac{S_i}{2\mathrm{ln}2\times {V}_{\mathrm{max}_i}}. \\&\dfrac{S_i}{\mathrm{ln}2\times P_i}-{V}_{\mathrm{max}_i},\;\;\dfrac{S_i}{2\mathrm{ln}2\times {V}_{\mathrm{max}_i}} < {P}_{i} <\\&\quad \dfrac{S_i}{\mathrm{ln}2\times ({V}_{\mathrm{max}_i}+{V}_{\mathrm{min}_i})}. \\&0,\;\; {P}_{i}\ge \dfrac{S_i}{\mathrm{ln}2\times ({V}_{\mathrm{max}_i}+{V}_{\mathrm{min}_i})}. \end{aligned}\right. $
此种情况下,无论数据交易平台如何选择单位价格Pi,买家都会购买${V}_{i}^{*} $数量的价值量. 因此,交易平台的目标就是选出最优单位价格${P}_{i}^{*} $,使自己收益最大化. 令
$ \max \displaystyle\sum_{i = 1}^n {U(P_i,V_i) = } \max \displaystyle\sum_{i = 1}^n {P_i \times V_i} . $
将式(9)代入式(8)得
$ \max \displaystyle\sum_{i = 1}^n {U(P_i,V_i) = } \displaystyle\sum_{i = 1}^n {\dfrac{{S_i}}{{2\ln 2}}} \text{,} $
博弈的子精炼纳什均衡解为$ ({{S_i}/ {{V_{\max_i}}}},{V_{\max_i}}) $.
但是,该收益只在买家预算充足,即$ \displaystyle\sum_{i = 1}^n {\dfrac{{S_i}}{{2\ln 2}}} \leqslant B $时成立. 在实际的交易中,我们往往要考虑买家预算有限,不支持每个结果集都购买$ {V}_{{\mathrm{m}\mathrm{a}\mathrm{x}}_{i}} $的价值量,因此,存在以下3种特殊情况.
1)情况1. 买家选择每个结果集都要购买,追求整体数据集均衡满足.
这种情况可以退化为一个大数据集的购买问题,大数据集的最大支付意愿为$ \displaystyle\sum_{i = 1}^n {S_i} $,买家能够交易的最大价值量为$ \displaystyle\sum_{i = 1}^n {{V_{\max_i}}} $,能够交易的最小价值量为$ \displaystyle\sum_{i = 1}^n {{V_{\min_i}}} $,买家此时购买$ {{\displaystyle\sum_{i = 1}^n {S_i} } \big/{(P_i \times \ln 2}}) - \displaystyle\sum_{i = 1}^n {{V_{\max_i}}} $数量的价值量. 此时,交易平台的定价区间为P$ \in $$ \Bigg({\displaystyle\sum_{i = 1}^n {S_i} } \big/ \Big(2\ln 2 \times \displaystyle\sum_{i = 1}^n {{V_{\max_i}}} \Big),{{\displaystyle\sum_{i = 1}^n {S_i} } \big/ {\Big(\ln 2 \times \displaystyle\sum_{i = 1}^n ({V_{\max_i}} + {V_{\min_i}}) }}\Big)\Bigg) $问题的求解变为
$ {\text{max}}\displaystyle\sum_{i = 1}^n {U(P,V) = } \max \left(\dfrac{{\displaystyle\sum_{i = 1}^n {S_i} }}{{\ln 2}} - \displaystyle\sum_{i = 1}^n {V_{\max_i}} \times P\right) \text{,} $
$ {\text{s}}{\text{.t}}{\text{. }}{{\displaystyle\sum_{i = 1}^n {S_i} } \Bigg/ {\ln 2}} - \displaystyle\sum_{i = 1}^n {V_{\max_i}} \times P \leqslant B \text{,} $
解得
$ P^* = \left(\dfrac{{\displaystyle\sum_{i = 1}^n {S_i} }}{{2\ln 2}} - B\right) \Bigg/ \displaystyle\sum_{i = 1}^n {V_{\max_i}} . $
各数据集交易价值量为:
$ V_i^* = \dfrac{{{V_{_{\max_i}}} \times \left(\dfrac{{\displaystyle\sum_{j = 1}^n {S_j} }}{{P_i \times \ln 2}} - \displaystyle\sum_{j = 1}^n {{V_{\max_j}}} \right)}}{{\displaystyle\sum_{j = 1}^n {{V_{\max_j}}} }} . $
此时,买家对各个数据集的满足程度$ {V}_{i}^{\mathrm{*}}/{V}_{{\mathrm{m}\mathrm{a}\mathrm{x}}_{i}} $都是一个相同的常数,符合买家需求.
2)情况2. 买家优先选择偏好数据集,其他数据集均衡满足. 即对于其中$ k $个结果集,交易其$ {V}_{{\mathrm{m}\mathrm{a}\mathrm{x}}_{i}} $的价值量按照买家偏好度$ {{S_i} / {{V_{\max_i}}}} $决定,其他的$ n-k $结果集交易$ {{S_i} / {(P_i \times \ln 2)}} - {V_{\max_i}} $的价值量,且追求这$ n-k $个结果集整体根据偏好程度的均衡满足.
此时,对于这$ k $个结果集,其价格$ P_i^* = {S_i} / 2\ln 2 \times {V_{\max_i}} $,对于其他$ n-k $个数据集,求解同情况1. 问题的求解变为
$ \max \; \displaystyle\sum_{i = 1}^n {U(P_i,V_i)} = \max \displaystyle\sum_{i = 1}^k {\dfrac{{S_i}}{{2\ln 2}}} + \dfrac{{\displaystyle\sum_{i = k + 1}^n {S_i} }}{{\ln 2}} - \displaystyle\sum_{i = k + 1}^n {V_{\max_i}} P \text{,}$
$ {\text{s}}{\text{.t}}{\text{. }}\displaystyle\sum_{i = 1}^k {\dfrac{{S_i}}{{2\ln 2}}} + \displaystyle\sum_{i = k + 1}^n {\left(\dfrac{{S_i}}{{\ln 2}} - {V_{\max_i}} \times P_i\right)} \leqslant B . $
同情况1,解得
$ P^* = \dfrac{\displaystyle\sum_{i = 1}^n {S_i} + \displaystyle\sum_{i = k + 1}^n {S_i} }{2\ln 2} - B \left/ {\displaystyle\sum_{i = k + 1}^n {V_{\max_i}} }\right..$
3)情况3. 买家追求偏好数据集得到最大程度满足,且每个结果集都要参与交易.
在这种情况中,将有$ k $个结果集交易其$ {V}_{{\mathrm{m}\mathrm{a}\mathrm{x}}_{i}} $的价值量,$ m $个结果集交易其$ {V}_{{\mathrm{m}\mathrm{i}\mathrm{n}}_{i}} $的价值量,剩余结果集交易$ {{S_i} / {(P_i \times \ln 2)}} - {V_{\max_i}} $的价值量. 设该结果集为$ t $,问题的求解变为式(15)和式(16).
$ \begin{split}{\text{max}}& \displaystyle\sum_{i = 1}^n {U(P,V) = } \max \left(\displaystyle\sum_{i = 1}^k {\dfrac{{S_i}}{{2\ln 2}}} + \dfrac{{S_t}}{{\ln 2}} - {V_{\max_t}} \times P_t +\right.\\&\left.\displaystyle\sum_{i = n - m + 1}^n {\dfrac{{{V_{\min_i}} \times S_i}}{{\ln 2 \times ({V_{\max_i}} + {V_{\min_i}})}}} \right)\text{,}\\[-1pt] \end{split} $
$ \displaystyle\sum_{i = 1}^k {\dfrac{{S_i}}{{2\ln 2}}} + \dfrac{{S_t}}{{\ln 2}} - {V_{\max_t}} \times P_t + \displaystyle\sum_{i = n - m + 1}^n {\dfrac{{{V_{\min_i}} \times S_i}}{{\ln 2 \times ({V_{\max_i}} + {V_{\min_i}})}}} \leqslant B . $
由式(15)和式(16)解得
$ P_t=\dfrac{{\displaystyle\sum_{i = 1}^n {\dfrac{{S_i}}{{2\ln 2}} + \dfrac{{S_t}}{{\ln 2}} + \displaystyle\sum_{i = n - m + 1}^n {\dfrac{{{V_{\min_i}} \times S_i}}{{\ln 2 \times ({V_{\max_i}} + {V_{\min_i}})}} - B} } }}{{{V_{\max_i}}}} . $
综上,对于交易平台来说,根据数据买家的最优定价策略,平台的最优定价策略见式(17),本次博弈的子精炼纳什均衡解见式(18).
$ P_i^*(V) = \left\{ {\begin{aligned}& {\dfrac{{S_i}}{{2\ln 2 \times {V_{\max_i}}}}}\text{,} \quad\quad \displaystyle\sum_{j = 1}^n {\dfrac{{S_j}}{{2\ln 2}} \leqslant B \vee } \left(\displaystyle\sum_{j = 1}^n \dfrac{{S_j}}{{2\ln 2}} > B \wedge 0 < i < k\right) \text{,}\\[-3pt] & {\dfrac{{{{\displaystyle\sum_{j = 1}^n {S_j} } \Big/ {\ln 2}} - B}}{{\displaystyle\sum_{j = 1}^n {{V_{\max_j}}} }}} \text{,}\quad\quad {\displaystyle\sum_{j = 1}^n {\dfrac{{S_j}}{{2\ln 2}} > B \wedge k = 0} }\text{,} \\[-3pt] &{\dfrac{{\displaystyle\sum_{j = 1}^k {\dfrac{{S_j}}{{2\ln 2}} + \dfrac{{S_t}}{{\ln 2}} + \displaystyle\sum_{j = n - m + 1}^n {\dfrac{{{V_{\min_j}} \times S_j}}{{\ln 2 \times ({V_{\max_j}} + {V_{\min_j}})}} - B} } }}{{{V_{\max_i}}}}} \text{,}\quad\quad {\displaystyle\sum_{j = 1}^n {\dfrac{{S_j}}{{2\ln 2}} > B \wedge 0 < k < i < m} }\text{,} \\[-3pt] &{\dfrac{{S_i}}{{\ln 2 \times ({V_{\max_i}} + {V_{\min_i}})}}}\text{,} \quad\quad {\displaystyle\sum_{j = 1}^n {\dfrac{{S_j}}{{2\ln 2}} > B \wedge 0 < m \leqslant i.} } \end{aligned}} \right. $
$ (P_i^*,V_i^*) = \left\{ {\begin{aligned}& {\left(\dfrac{{S_i}}{{2\ln 2 \times {V_{\max_i}}}},{V_{\max_i}}\right)}\text{,}\quad\quad\displaystyle\sum_{j = 1}^n {\dfrac{{S_j}}{{2\ln 2}} \leqslant B \vee } \left(\displaystyle\sum_{j = 1}^n \dfrac{{S_j}}{{2\ln 2}} > B,0 < i \leqslant k\right)\text{,} \\[-3pt] & {\left(\dfrac{{{{\displaystyle\sum_{j = 1}^n {S_j} } \Big/ {\ln 2}} - B}}{{\displaystyle\sum_{j = 1}^n {{V_{\max_j}}} }},\dfrac{{{V_{\max_i}} \times \left({{\displaystyle\sum_{j = 1}^n {S_j} } \Big/ {(P_i \times \ln 2}}) - \displaystyle\sum_{j = 1}^n {{V_{\max_j}}} \right)}}{{\displaystyle\sum_{j = 1}^n {{V_{\max_j}}} }}\right)}\text{,}\quad\quad{\displaystyle\sum_{j = 1}^n {\dfrac{{S_j}}{{2\ln 2}} > B \wedge k = 0 \wedge m = 0} }\text{,} \\[-3pt] & {\left( \dfrac{{\displaystyle\sum_{j = 1}^k {\dfrac{{S_j}}{{2\ln 2}} + \dfrac{{S_t}}{{\ln 2}} + \displaystyle\sum_{j = n - m + 1}^n {\dfrac{{{V_{\min_j}} \times S_j}}{{\ln 2 \times ({V_{\max_j}} + {V_{\min_j}})}} - B} } }}{{{V_{\max_i}}}}\text{,} \;\;\dfrac{{\displaystyle\sum_{j = 1}^n {{V_{\max_j}}} \times\Bigg(B - \dfrac{{\displaystyle\sum_{j = 1}^k {S_j} }}{{2\ln 2}} - \dfrac{{{V_{\min_i}} \times S_i}}{{\ln 2 \times ({V_{\max_i}} + {V_{\min_i}})}}\Bigg)}}{{{{\left(\displaystyle\sum_{j = 1}^n {S_j} + \displaystyle\sum_{j = k + 1}^n {S_j} \right)} \Big/ {2\ln 2}} - B}} \right),}\\[-3pt]&\quad\quad \displaystyle\sum_{j = 1}^n {\dfrac{{S_j}}{{2\ln 2}} > B \wedge 0 < m \wedge } 0 < k < i < n - m + 1\text{,} \\[-3pt]& {\left(\dfrac{{S_i}}{{\ln 2 \times ({V_{\max_i}} + {V_{\min_i}})}},{V_{\min_i}}\right)}\text{,}\quad\quad{\displaystyle\sum_{j = 1}^n {\dfrac{{S_j}}{{2\ln 2}} > B \wedge 0 < i \leqslant m} . } \end{aligned}} \right. $
劳资博弈定价具体实现如算法1所示. 算法1中行①~③确定边界值,行④~⑦计算预算充足情况下每个数据集的交易量及价格,行⑧~㉕实现在预算不充足、买家不同偏好度及购买策略情况下每个数据集交易量及价格的计算. 其中行⑩~⑫,⑬~⑱,⑲~㉓分别对应2.4节中情况1、情况2和情况3买家3种不同需求下交易量及价格的计算.
算法1. 劳资博弈定价算法.
输入:数据源集合Set,买家总预算$ B $,效用函数参数$ \alpha $,买家的购买策略STRATEGY;
输出:最优定价组合$ priceS et=\left\{\left({P}_{i}^{*},{V}_{i}^{*}\right)\big|1\le i\le n\right\} $.
① for each(ds:Set)/*根据式(10)确定纳什均衡 解*/
②  bv+=ds.s/2ln$ \alpha $;/*bv为边界值变量*/
③ end for
④ if(B$ \ge $bv){ /*买家预算充足*/
⑤ for each(ds:Set)
⑥   priceSet.put(getBestP(ds), ds.Vmax);/*根据   式(10)计算数据集ds交易最大价值量   时的价格*/
⑦ end for
⑧ }else if(B<bv){/*买家预算不足*/
⑨  switch(STRATEGY);
⑩   case:BALANCE{/*情况1:据式(12) (13)    计算得到各结果集的均衡价格与交    易价值量*/
⑪    for each(ds:Set)
⑫      priceSet.put(getBalanceP(B, Set),       getBalanceV(ds));
⑬   }case:PREBALANCE{/*情况2*/
⑭     BuyAllVMin(Set,B);
⑮     BuyPreferences(Set,B);
⑯    for(ds:Set)/*计算剩余数据集的均衡     交易价值量及价格*/
⑰      priceSet.update(getBalanceP(B,Set),       getBalanceV(ds));
⑱    end for
⑲   }case:PREFERENCE{/* 情况3*/
⑳     BuyAllVMin(Set,B);
㉑     BuyPreferences(Set,B);
㉒     priceSet.update(getBetterP(B, ds),      getBetterV(P,ds));/*根据式(15)     计算预算不足时的购买价值量及     价格*/
㉓   }
㉔  end switch
㉕ }
㉖ end if
㉗ return(priceSet).
算法2完成每个数据集最低价值量及对应价格的博弈计算,实现所有数据集全部购买情况下的最低购买需求. 其中行①~③计算每个数据集的最低价值量及对应价格,行④~⑥计算在所有数据集都最低价值量交易时交易后的剩余预算.
算法2. 以最低价值量购买所有数据BuyAllVMin.
输入:数据源集合Set,买家总预算$ B $;
输出: priceSet,B.
① for each(ds:Set)
②  priceSet.put(getLowestP(ds),ds.Vmin); /*依式  (15)计算数据集ds的最低购买价值量及  对应价格*/
③ end for
④ for each(int p:priceSet)
⑤  B– =p;/*剩余预算*/
⑥ end for
⑦ return priceSet,B.
算法3完成以数据集偏好为优先购买顺序,对每个数据集购买的价值量和应支付的价格进行计算. 行①~⑧按数据集购买的偏好优先级遍历所有数据集,并扣除购买该数据集最大价值量的价格(行⑤⑥),直至预算用尽(行②③),返回结果.
算法3. 按偏好购买数据集BuyPreferences.
输入:数据源集合Set,买家总预算$ B $;
输出:priceSet,B.
① for each(ds:Set){/*按偏好遍历数据集*/
② if(getBestP(ds)>B+priceSet.getP(ds))
③  break;/*剩余预算不足以购买ds的最大   价值量*/
④ end if
⑤  B– = getBestP(ds)–priceSet.getP(ds);/*计算  剩余预算*/
⑥  priceSet.update(getBestP(ds), ds.Vmax); /*据  式(10)计算每个数据集最优购买价值量  及对应价格*/
⑦ }
⑧ end for
⑨ return priceSet,B.
不难看出,劳资博弈定价算法的时间复杂度为O(N),其中N为候选数据集的个数. 考虑到数据交易现实情况,N远远小于数据量,因此理论上讲,该算法执行时间几乎可忽略不计.
无套利原则的定义源于信息理论确定性的概念. 假如$ V $是数据集$ D $的一个视图集,当一个数据集$ D $的查询$ Q\left(D\right) $可以通过$ Q\left(V\right) $来获取结果时,那么由视图集$ V $确定查询结构$ Q $可表示为$ D \vdash V\twoheadrightarrow Q $.
假设$ R\mathrm{和}T $是数据集$ D $的2个视图(结果集),且满足$ D=R\bowtie T $,3个数据集的价格分别是$ \left(D,{P}_{1}\right),(R, {P}_{2}),(T,{P}_{3}) $. 考虑一种情况,若$ {P}_{1}\ge {P}_{2}+{P}_{3} $,那么聪明的数据买家会发现购买数据集$ R\mathrm{和}T $可以用更低的价格获得数据集$ D $,这将会损害数据交易平台的利益. 因此,有效的定价函数应遵循无套利原则,即当数据集$ D $的查询结果$ Q $可由查询束$ {Q}_{1},{Q}_{2},… ,{Q}_{k} $得到时,定价函数P=G(Q)须满足
$ \displaystyle\sum_{i = 1}^k {G(Q_i)} \geqslant G(Q) . $
定义1. 无套利性. 当数据集$ D $的查询结果$ Q $可由查询束$ {Q}_{1},{Q}_{2},… ,{Q}_{k} $得到时,买家获取到的单位价值量$ V $必须满足
$ \displaystyle\sum_{i = 1}^k {R(V_i)} \leqslant R(V) . $
式(20)的意义为多个子查询结果对买家的总收益不得大于单查询结果对买家的总收益,否则就有可能发生套利行为.
其次,为了确保本定价算法的合理性,在进行多个子查询时,交易的输入参数必须满足:
$ S \leqslant \displaystyle\sum_{i = 1}^k {S_i} . $
式(21)中,S为每个查询结果集的最大支付意愿. 该公式的意义为一个查询束获取到的各个子结果集的最大支付意愿之和不得小于等价查询Q获取的结果集的最大支付意愿.
由式(8)的劳资博弈定价结果可以得知,根据买家预算的不同,买家可获取到的单位价值量如式(22)所示.
$ V = \left\{ {\begin{aligned}& {\displaystyle\sum_{i = 1}^n {{V_{\max_i}}} }\text{,}\quad\quad {\displaystyle\sum_{i = 1}^n {\dfrac{{S_i}}{{2\ln a_i}} \leqslant B.} } \\ & {\dfrac{{{V_{\max_i}} \times \left(\displaystyle\sum_{i = 1}^n {S_i} \Bigg/ (P_i \times \ln 2) - \displaystyle\sum_{i = 1}^n {{V_{\max_i}}} \right)}}{{\displaystyle\sum_{i = 1}^n {{V_{\max_i}}} }}}\text{,} \quad\quad {\displaystyle\sum_{i = 1}^n {\dfrac{{S_i}}{{2\ln a_i}} > B \wedge k = 0 \wedge m = 0} } \text{,}\\ &{\displaystyle\sum_{i = 1}^k {{V_{\max_i}}} + \dfrac{{\displaystyle\sum_{i = k + 1}^n {{V_{\max_i}}\left(B - {{\displaystyle\sum_{i = 1}^k {S_i} } \Bigg/{2\ln 2}}\right)} }}{{{{\left(\displaystyle\sum_{i = 1}^n {S_i} + \displaystyle\sum_{i = k + 1}^n {S_i} \right)} \Bigg/ {2\ln 2}} - B}} - \displaystyle\sum_{i = k + 1}^n {{V_{\max_i}}} }\text{,} \quad\quad {\displaystyle\sum_{i = 1}^n {\dfrac{{S_i}}{{2\ln a_i}} > B \wedge k \ne 0 \wedge m = 0} }\text{,} \\ &\displaystyle\sum_{i = 1}^k {{V_{\max_i}}} + \displaystyle\sum_{i = 1}^m {{V_{\min_i}}} + \dfrac{{{V_{\max_i}}\left(B - \dfrac{{\displaystyle\sum_{i = 1}^n {S_i} }}{{2\ln 2}} - \dfrac{{{V_{\min_i}} \times S_i}}{{\ln 2 \times ({V_{\max_i}} + {V_{\min_i}})}}\right)}}{{{{\left(\displaystyle\sum_{i = 1}^n {S_i} + \displaystyle\sum_{i = k + 1}^n {S_i} \right)} \Bigg/ {2\ln 2}} - B}}\text{,} \quad\quad {\displaystyle\sum_{i = 1}^n {\dfrac{{S_i}}{{2\ln a_i}} > B \wedge k \ne 0 \wedge m \ne 0.} } \end{aligned}} \right. $
根据式(22)可知,买家单位价值量获取的影响因素有3个,分别是预算$ B $、各数据集的最大支付意愿$ {S}_{i} $和各数据集的最大单位价值量$ {V}_{{\mathrm{m}\mathrm{a}\mathrm{x}}_{i}} $. 接下来我们将对这3个因素逐个分析.
1)预算$ B $的分析. 预算$ B $在买家一开始进入交易市场中就已经确定,其只与买家的最终目标有关,理智的买家在交易市场中无论采取何种交易行为,其交易目标都是确定的,因此预算$ B $不随交易行为的改变而改变.
2)数据集的最大支付意愿$ {S}_{i} $的分析. 在式(21)中,我们可知$ S \leqslant \displaystyle\sum_{i = 1}^k {S_i} $,根据式(22),当买家预算充足时,买家获取的单位价值量与$ {S}_{i} $无关,当买家预算不足时,由式(22)可知,$ {S}_{i} $的增大将导致获取到的单位价值量减少,此时买家拆分成子查询束的行为是不明智的,故明智的买家不会拆分成子查询束.
3)数据集的最大单位价值含量$ {V}_{{\mathrm{m}\mathrm{a}\mathrm{x}}_{i}} $的分析. 当查询结果Q可由查询束Q1,Q2,…,Qk得到时,即查询结果集$ R={R}_{1}\bowtie {R}_{2}\bowtie … \bowtie {R}_{k} $时,各结果集的自然连接结果依然是原数据集$ R $,也就是说,买家将1个查询分解为多个子查询,其最终获取到的数据集是相同的,拆分之后各数据集的单位价值量之和$ \displaystyle\sum_{i = 1}^n {{V_{\max_i}}} $发生变化,不会影响其最终获取到的单位价值量.
综上所述,本文定价算法满足$ \displaystyle\sum_{i = 1}^k {R(V_i)} \leqslant R(V) $,满足查询定价的无套利性要求.
1)实验内容. 本节对基于劳资博弈的查询定价算法(以下简称查询-劳资博弈)进行实验验证分析. 鉴于其无套利性已在2.6节分析,本节主要验证其定价动态灵活性、公平合理性和高效性. 为表明该定价算法具备无需预设价格点的优势,本节实验采用附录A中介绍的隐私含量作为数据集的价值量.
2)基准测试. 基于查询的定价方法侧重于定价的灵活性,而基于斯塔克伯格博弈的定价方法侧重于定价的合理性. 因此,本文研究使用查询定价方法作为对比算法,来验证查询-劳资博弈定价算法的动态灵活性,同时使用斯塔克伯格博弈定价方法来分析其公平合理性. 为说明查询-劳资博弈定价算法的有效性,本文研究分别采用最新的查询定价方法[8]和斯塔克伯格博弈定价方法[13]作为基准测试算法.
虽然关系数据库具备高性能的特性,但由于本文研究是第1个提出多数据集组合购买定价问题的研究,同基于关系数据库的传统查询定价方法研究问题不同. 因此,在分析性能时,本文研究所提方法同传统查询定价方法不具备直接对比性. 基于此,在分析查询-劳资博弈定价算法性能时,本文研究采用相对分析手段,将从劳资博弈定价算法的执行导致的查询-劳资博弈完整执行时间的增加比例入手,对算法性能进行分析.
3)数据集. 实验数据集包含1个真实数据集和1个标准模拟数据集. 真实数据集用于对算法合理性和灵活性进行分析,标准模拟数据集用于对算法性能进行分析. 真实数据集采用从Kaggle网站上获取的名为personal data的test_data公开数据集[22]. 为确保该真实数据集的代表性,本文研究调研了京东万象等数据交易平台,从该数据集中抽取出10列交易频率高的个人基本信息项,构造出一个8 756行、40列的实验数据集,并基于该真实数据集,派生出4个对比数据集. 另外,由于涉及到隐私,本文研究对测试集中具有高度指向性的数据进行了脱敏处理. 模拟数据集选用TPC-H标准测试集[23].
4)实现及实验平台. 所有算法用Java语言实现. 由于查询-劳资博弈定价算法是对数据库查询的定价,理论上来说,可以对任意关系数据库查询结果进行定价,考虑到代表性,数据的存储和查询基于流行的开源关系数据库MySQL 5.17进行. 实验平台配置为:CPU 2.5 GHz 4核Intel Core i7,内存16 GB 1600 MHz DDR3,磁盘500 GB SSD.
本实验利用SQL语句查询得到2个数据集. 为了实验的严谨性,本实验复制了这2个数据集,采取控制变量原则,仅调整了2个数据集的隐私含量,生成了4个数据集,分别命名为数据集D1、数据集$D'_1 $、数据集D2、数据集$D'_2 $. 其中,数据集D1和数据集$D'_1 $、数据集D2和数据集$D'_2 $的数据完全相同,但是其隐私含量不同. 这样的实验设置可以避免因数据变化造成的查询定价结果变化. 数据集详情如表2所示.
对算法动态灵活性的验证分析,本文研究选取经典的基于查询的定价方法(查询定价)作为基准测试. 2种定价方法的比较结果如图1所示.
从图1可得,由于数据集D1和数据集$ D'_1$数据相同、隐私含量不同,传统查询定价方法给这2个数据集定价相同,查询-劳资博弈定价算法给出的定价随数据集隐私含量的变化呈正比例变化. 数据集D2和数据集$ D'_2 $数据相同、隐私含量不同,现有的查询定价方法给这2个数据集定价相同,本文研究提出的查询-劳资博弈定价随着数据集隐私含量的变化呈正比例变化. 结果表明,相比于现有的查询定价方法,查询-劳资博弈定价算法可以跟随数据价值的变化动态调整价格,因此更具优越性.
公平合理性验证选择斯塔克伯格博弈模型作为基准对比算法. 假设斯塔克伯格博弈模型和劳资博弈模型双方采用相同的收益函数. 买家需求如表3所示.
1)设买家预算B=1 500. 此时买家预算充足,基于斯塔克伯格博弈定价方法的定价结果如表4所示. 本文研究提出的查询-劳资博弈定价算法的定价结果如表5所示.
图2和图3分别显示了斯塔克伯格博弈模型和劳资博弈模型在平台收益和买家收益2个关键指标的对比.由结果可知,2个定价方法对于买家的需求满足程度都达到了100%,但是基于斯塔克伯格博弈的定价方法最后买家收益为100,基于查询-劳资博弈的定价算法最后买家收益为447. 基于斯塔克伯格博弈的定价方法由于结果集单位价格$ P $及交易价值量$ V $都由卖家设置,因此,在预算充足的情况下,相比于斯塔克伯格博弈定价算法,查询-劳资博弈定价算法对买家更为有利,更容易促成交易.
2)设买家预算B=1 000. 买家购买策略为优先购买策略即选择每个数据集都要购买且优先满足偏好度高的数据集.
此时买家预算不足,基于斯塔克伯格博弈定价算法的定价结果如表6所示. 基于劳资博弈的查询定价算法的定价结果如表7所示.
图4和图5分别显示了斯塔克伯格博弈模型和劳资博弈模型在买家所获得的隐私含量(价值量)和需求满足程度的对比. 由表6和表7中结果可知,2个博弈方法交易平台的收益相同,都为1 000,但是对比之下,2个方法的买家需求满足程度不同,基于斯塔克伯格博弈的定价方法中买家的需求满足程度为70%,20%,16.67%,整体小于查询-劳资博弈定价算法中买家的需求满足程度100%,100%,56.10%. 此外,斯塔克伯格博弈方法并不能按照用户的偏好去优先满足偏好度高的数据集. 因此,在预算不足的情况下,查询-劳资博弈定价算法比斯塔克伯格博弈定价算法对买家更有利,更易促成交易的达成.
综上,本文研究提出的查询-劳资博弈定价算法更加兼顾买卖双方的合理利益,定价更加公平、更易促成交易的达成.
本实验基于TPC-H数据集派生出5份价值量不同的对比数据集,并假定用户需求场景为预算不足且购买策略为各数据集均衡购买. 为准确控制实验参数,每个元组价值量参数设置为相同值. 如前文所述,因难以找到合适的直接对比基准算法,本节采取相对分析方法,以查询-劳资博弈定价算法在查询总执行时间的占比作为分析指标. 以TPC-H每组查询的第2个查询为测试查询,不同扩展因子(scale factor,SF)参数对应的实验结果如图6所示.
从图6可以看出,在各数据规模下,查询-劳资博弈定价算法执行时间占整个查询执行时间的比例均在0.2‰以下,甚至更低,且数据量越大,其执行时间占比越低,其执行均可在数毫秒内完成,这同其算法复杂度O(N)的理论值是一致的,说明本文研究所提定价方法具备高效的优良特性.
针对现有查询定价算法落地难的挑战,本文研究创新利用劳资博弈模型对数据交易市场进行建模,据此设计了基于劳资博弈的查询定价算法. 该算法权衡考虑了各参与方的利益,利用劳资博弈给出交易数据价格,具有动态灵活、公平透明、易应用等优良特性. 对比传统查询定价和斯塔克伯格博弈模型,大量实验验证了本文研究定价算法的高效性、优越性和实际落地性.
作者贡献声明:王会举提出论文研究方向、思路及参与论文的修改;黄玮煊负责实验及实现;岳晓提出指导意见并修改论文.

参考文献 引证文献
排序方式:
1
中共中央国务院. “十四五”数字经济发展规划[EB/OL]. (2022-03-25)[2023-05-12]. https://www.gov.cn/gongbao/content/2022/content_5671108.htm?eqid=8776104300000c760000000664564e72&amp;eqid=cc7670d30007fc920000000664867f05
CPC Central Committee and the State Council. “14th five year plan” digital economic development plan[EB/OL]. (2022-03-25) [2023-05-12]. https://www.gov.cn/gongbao/content/2022/content_5671108.htm?eqid=8776104300000c760000000664564e72&amp;eqid=cc7670d30007fc920000000664867f05 (in Chinese)
2
Koutris P, Upadhyaya P, Balazinska M, et al. Query-based data pricing[C]//Proc of the 34th SIGMOD Symp on Principles of Database Systems (PODS). New York: ACM, 2012: 167−178
3
Tang Ruiming, Wu Huayu, Bao Zhifeng, et al. The price is right: Models and algorithms for pricing data[C]//Proc of the 24th Int Conf on Database and Expert Systems Applications. Berlin: Springer, 2013: 380−394
4
Balazinska M, Howe B, Suciu D. Data markets in the cloud: An opportunity for the database community[J]. Proceedings of the VLDB Endowment, 2011, 4(12): 1482−1485
5
Lin Bingrong, Kifer D. On arbitrage-free pricing for general data queries[J]. Proceedings of the VLDB Endowment, 2014, 7(9): 757−768
6
Upadhyaya P, Balazinska M, Suciu D. Price-optimal querying with data apis[J]. Proceedings of the VLDB Endowment, 2016, 9(14): 1695−1706
7
Deep S, Koutris P. The design of arbitrage-free data pricing schemes[C]//Proc of the 20th Int Conf on Database Theory (ICDT). Wadern: Schloss Dagstuhl, 2017: 12: 1−12: 18
8
Deep S, Koutris P. Qirana: A framework for scalable query pricing[C]//Proc of the 43rd ACM Int Conf on Management of Data. New York: ACM, 2017: 699−713
9
Deep S, Koutris P, Bidasaria Y. Qirana demonstration: Real time scalable query pricing[J]. Proceedings of the VLDB Endowment, 2017, 10(12): 1949−1952
10
Li Chao, Li Y D, Miklau G, et al. A theory of pricing private data[J]. ACM Transactions on Database System, 2014, 39(4): 1−28
11
Chen Chen, Yuan Ye, Wen Zhenyu, et al. GQP: A framework for scalable and effective graph query-based pricing[C]//Proc of the 38th IEEE Int Conf on Data Engineering. Piscataway, NJ: IEEE, 2022: 1573−1585
12
Haddadi S, Ghasemi A. Pricing-based Stackelberg game for spectrum trading in self-organised heterogeneous networks[J]. IET Communications, 2016, 10(11): 1374−1383
13
Xu Chengzhen, Zhu Kun, Yi Changyan, et al. Data pricing for blockchain- based car sharing: A stackelberg game approach[C/OL]//Proc of IEEE Global Communications Conf. Piscataway, NJ: IEEE, [2023-05-12]. https://ieeexplore.ieee.org/document/9322221
14
苑迎,王翠荣,王聪,等. 基于非完全信息博弈的云资源分配模型[J]. 计算机研究与发展,2016,53(6):1342−1351
Yuan Ying, Wang Cuirong, Wang Cong, et al. An uncompleted information game based resources allocation model for cloud computing[J]. Journal of Computer Research and Development, 2016, 53(6): 1342−1351(in Chinese)
15
Berz G. Game Theory Bargaining and Auction Strategies: Practical Examples from Internet Auctions to Unvestment Banking[M]. Berlin: Springer, 2016
16
Riederer C, Erramilli V, Chaintreau A, et al. For sale: your data: by: you[C]//Proc of the 10th ACM Workshop on Hot Topics in Networks. New York: ACM, 2011: 13: 1−13: 6
17
Susanto H, Zhang Honggang, Ho S Y, et al. Effective mobile data trading in secondary ad-hoc market with heterogeneous and dynamic environment[C]//Proc of the 37th IEEE Int Conf on Distributed Computing Systems (ICDCS). Los Alamitos, CA: IEEE Computer Society, 2017: 645−655
18
Ghosh A, Roth A. Selling privacy at auction[C]//Proc of the 12th ACM Conf on Electronic Commerce. New York: ACM, 2011: 199−208
19
Yang Jian, Zhao Chongchong, Xing Chunxiao. Big data market optimization pricing model based on data quality[J]. Complexity, 2019(2): 1−10
20
Li Xijun, Yao Jianguo, Liu Xue, et al. A first look at information entropy-based data pricing[C]//Proc of the 37th IEEE Int Conf on Distributed Computing Systems (ICDCS). Piscataway, NJ: IEEE, 2017: 2053−2060
21
Yu Haifei, Zhang Mengxiao. Data pricing strategy based on data quality[J]. Computers & Industrial Engineering, 2017(112): 1−10
22
Kaggle. Personal dataset [EB/OL]. [2023-04-11]. https://www.kaggle.com/ datasets/wangtaobo/personal-data-datasets-for-big-data-research
23
TPC. TPC-H benchmark[EB/OL]. [2023-10-11]. http://www.tpc.org/tpch/
2024年第61卷第12期
77
36
0
引用本文
BibTeX
文章信息
doi: 10.7544/issn1000-1239.202330791
  • 接收时间:2023-10-10
  • 首发时间:2026-11-17
  • 出版时间:2024-12-01
补充材料
相关文章
文章信息
作者
出版历史
  • 收稿日期:2023-10-10
  • 修回日期:2024-05-16
  • 录用日期:2024-05-30
基金
作者信息
    中南财经政法大学信息工程学院 武汉 430073

通讯作者:

参考文献
分享链接
https://castjournals.cast.org.cn/joweb/jsjyjyfz/CN/10.7544/issn1000-1239.202330791
分享至
全文二维码

扫描看全文

引用本文
BibTeX
本文的引用情况
2种不同金属材料的力学参数
科
Family
属数
Number of
genus
种数
Number of
species
占总种数比例
Percentage of
total species (%)
属
Genus
种数
Number of
species
占总种数比例
Percentage of total
species (%)
鹅膏菌科Amanitaceae 2 11 5.26 鹅膏菌属 Amanita 10 4.78
小菇科 Mycenaceae 2 12 5.74 丝盖伞属 Inocybe 5 2.39
多孔菌科 Polyporaceae 8 14 6.70 蜡蘑属 Laccaria 5 2.39
红菇科 Russulaceae 3 23 11.00 小皮伞属 Marasmius 6 2.87
小菇属 Mycena 11 5.26
光柄菇属 Pluteus 5 2.39
红菇属 Russula 17 8.13
栓菌属 Trametes 5 2.39
关闭全屏