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

济贫问题的随机分配模型
引用本文:梁满发,栾长福.济贫问题的随机分配模型[J].华南理工大学学报(自然科学版),2004,32(5):80-83.
作者姓名:梁满发  栾长福
作者单位:华南理工大学,应用数学系,广东,广州,510640;华南理工大学,应用数学系,广东,广州,510640
基金项目:国家自然科学基金资助项目 (1990 2 0 0 5 )
摘    要:对美国Columbia大学Herbert Robbins教授提出的济贫问题进行了研究,该问题要求计算每个人获得的钱数的方差.先将此问题转换为非齐次马尔可夫链模型,推导出一步转移概率矩阵,依此证明了当钱数趋于无穷大时,方差趋于零;给出了计算K=3和N=4时问题的精确解;最后给出了N,K为更大数值的Monte—Carlo模拟解,并检验了模拟解和精确解的一致性.

关 键 词:济贫问题  随机分配模型  方差  非齐次  马尔可夫链
文章编号:1000-565X(2004)05-0080-04
修稿时间:2003年6月4日

Stochastic Assigning Model of Aiding the Poor Game
Liang Man-fa,Luan Chang-fu.Stochastic Assigning Model of Aiding the Poor Game[J].Journal of South China University of Technology(Natural Science Edition),2004,32(5):80-83.
Authors:Liang Man-fa  Luan Chang-fu
Abstract:The problem of Aiding the Poor Game put forward by Prof.Herbert Robbins at Columbia University of the USA was researched.In this problem,the variance of the money provided for each individual needs to be calculated.In this research,the problem was transformed into a non-homogeneous Markov chain model,and the one-step transition probability matrix was deduced,thus proving that the variance approaches zero when the money approaches infinite.Moreover,the accuracy solution of the problem,when K=3 and N=4,was given.The Monte-Carlo simulation solution,when N and K are both comparatively great,was finally given and the coherence of the simulation solution and accurate solution was verified.
Keywords:Aiding the Poor Game  stochastic assigning model  variance  non-homogeneous  Markov chain
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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