首页 | 本学科首页   官方微博 | 高级检索  
     

基于博弈和网络流的任务打包定价模型
引用本文:杨焕煜,邵子朋,高汉成,沙超,王汝传.基于博弈和网络流的任务打包定价模型[J].计算机技术与发展,2021(2):14-19.
作者姓名:杨焕煜  邵子朋  高汉成  沙超  王汝传
作者单位:南京邮电大学计算机学院、软件学院、网络空间安全学院
基金项目:国家自然科学基金(61872194,61872196);江苏省“六大人才高峰”(JNHB-095)。
摘    要:"拍照赚钱"是移动互联网下的一种自助式服务模式.用户下载APP,注册成为APP的会员,然后从APP上领取需要拍照的任务,赚取APP对任务所标定的酬金.它为企业提供各种商品检查的信息,能够大大节省调查成本,保证调查数据真实性,缩短调查的周期.该模式的核心要素是任务的定价.然而,如果定价不够合理,将会造成有的任务无人问津,...

关 键 词:"拍照赚钱"  贝叶斯-纳什均衡  价格博弈  网络流  最小费用最大流

Task Packaging Pricing Model Based on Game and Network Flow
YANG Huan-yu,SHAO Zi-peng,GAO Han-cheng,SHA Chao,WANG Ru-chuan.Task Packaging Pricing Model Based on Game and Network Flow[J].Computer Technology and Development,2021(2):14-19.
Authors:YANG Huan-yu  SHAO Zi-peng  GAO Han-cheng  SHA Chao  WANG Ru-chuan
Affiliation:(School of Computer Science,Software and Cyberspace Security,Nanjing University of Posts and Telecommunications,Nanjing 210003,China)
Abstract:“Make money by taking photos”is a self-service mode of the mobile Internet.The user downloads the APP,registers as a member of the APP,and then receives tasks that require photos from the APP to earn the APP’s remuneration for the tasks.It provides companies with various product inspection information,which can greatly reduce the cost of surveys,ensure the authenticity of survey data and shorten the survey cycle.Core element of the task is price.If the pricing is not reasonable,some tasks will be left unattended,which will lead to the failure of product inspection.Therefore,we propose a task packaging pricing model based on games and network flows.First,the Bayesian-Nash equilibrium theory is introduced to establish a task pricing scheme,and then based on the idea of minimum cost and maximum flow,a network flow model is established,and the tasks are packaged and released to further increase the task completion rate.By establishing this model,the company can minimize the remuneration while ensuring the completion rate of the task.
Keywords:“make money by taking photos”  Bayes-Nash equilibrium  price game  network flow  minimum cost maximum flow
本文献已被 维普 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号