{"title":"关于圣彼得堡悖论","authors":"T. Cover","doi":"10.1109/ISIT.2011.6033850","DOIUrl":null,"url":null,"abstract":"We<sup>1</sup> ask what is the appropriate price c to pay to receive an amount X ≥ 0; X ∼ F(x). This is known as the St. Petersburg paradox if Pr{X = 2<sup>k</sup>} = 2<sup>−k</sup>, k = 1, 2, … Here EX = ∞. Is any price c aceptable? We consider this distribution as well as the distribution Pr{X = 2<sup>2k</sup>} = 2<sup>−k</sup>, k = 1, 2, …, which might be called the super St. Petersburg paradox in which not only is EX equal to infinity, but E log X is infinity as well. Let μ<inf>r</inf> = (EX<sup>r</sup>)<sup>1/r</sup> denote the r<sup>th</sup> mean of X. We identify three critical costs, μ<inf>−1</inf> = 1/E(1/X), μ<inf>0</inf> = e<sup>E lnX</sup>, and μ<inf>1</inf> = EX, and conclude that we want some of X if c ≤ μ<inf>1</inf>, and that taking all of X is growth optimal if c ≤ μ<inf>−1</inf>. Thus all prices c are attractive in the St. Petersburg game.","PeriodicalId":208375,"journal":{"name":"2011 IEEE International Symposium on Information Theory Proceedings","volume":"10 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-10-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"49","resultStr":"{\"title\":\"On the St. Petersburg paradox\",\"authors\":\"T. Cover\",\"doi\":\"10.1109/ISIT.2011.6033850\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We<sup>1</sup> ask what is the appropriate price c to pay to receive an amount X ≥ 0; X ∼ F(x). This is known as the St. Petersburg paradox if Pr{X = 2<sup>k</sup>} = 2<sup>−k</sup>, k = 1, 2, … Here EX = ∞. Is any price c aceptable? We consider this distribution as well as the distribution Pr{X = 2<sup>2k</sup>} = 2<sup>−k</sup>, k = 1, 2, …, which might be called the super St. Petersburg paradox in which not only is EX equal to infinity, but E log X is infinity as well. Let μ<inf>r</inf> = (EX<sup>r</sup>)<sup>1/r</sup> denote the r<sup>th</sup> mean of X. We identify three critical costs, μ<inf>−1</inf> = 1/E(1/X), μ<inf>0</inf> = e<sup>E lnX</sup>, and μ<inf>1</inf> = EX, and conclude that we want some of X if c ≤ μ<inf>1</inf>, and that taking all of X is growth optimal if c ≤ μ<inf>−1</inf>. Thus all prices c are attractive in the St. Petersburg game.\",\"PeriodicalId\":208375,\"journal\":{\"name\":\"2011 IEEE International Symposium on Information Theory Proceedings\",\"volume\":\"10 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2011-10-03\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"49\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2011 IEEE International Symposium on Information Theory Proceedings\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISIT.2011.6033850\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 IEEE International Symposium on Information Theory Proceedings","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISIT.2011.6033850","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
We1 ask what is the appropriate price c to pay to receive an amount X ≥ 0; X ∼ F(x). This is known as the St. Petersburg paradox if Pr{X = 2k} = 2−k, k = 1, 2, … Here EX = ∞. Is any price c aceptable? We consider this distribution as well as the distribution Pr{X = 22k} = 2−k, k = 1, 2, …, which might be called the super St. Petersburg paradox in which not only is EX equal to infinity, but E log X is infinity as well. Let μr = (EXr)1/r denote the rth mean of X. We identify three critical costs, μ−1 = 1/E(1/X), μ0 = eE lnX, and μ1 = EX, and conclude that we want some of X if c ≤ μ1, and that taking all of X is growth optimal if c ≤ μ−1. Thus all prices c are attractive in the St. Petersburg game.