{"title":"优势策略与贝叶斯多物品拍卖:最大收益决定与比较","authors":"A. Yao","doi":"10.1145/3033274.3085120","DOIUrl":null,"url":null,"abstract":"We address two related unanswered questions in maximum revenue multi-item auctions. Is dominant-strategy implementation equivalent to the semantically less stringent Bayesian one (as in the case of Myerson's 1-item auction)? Can one find explicit solutions for non-trivial families of multi-item auctions (as in the 1-item case)? In this paper, we present such natural families whose explicit solutions exhibit a revenue gap between the two implementations. More precisely, consider the k-item n-buyer maximum revenue auction where k, n >1 with additive valuation in the independent setting (i.e., the buyers i have independent private distributions Fij on items j). We derive exact formulas for the maximum revenue when k=2 and Fij are any IID distributions on support of size 2, for both the dominant-strategy (DIC) and the Bayesian (BIC) implementations. The formulas lead to the simple characterization that, the two models have identical maximum revenue if and only if selling-separately is optimal for the distribution. Our results also give the first demonstration, in this setting, of revenue gaps between the two models. For instance, if k=n=2 and Pr{X{F = 1} = Pr{XF =2 } = 1/2, then the maximum revenue in the Bayesian implementation exceeds that in the dominant-strategy by exactly 2%; the same gap exists for the continuous uniform distribution XF over [a, a+1] ∪ [2a, 2a+1] for all large a.","PeriodicalId":287551,"journal":{"name":"Proceedings of the 2017 ACM Conference on Economics and Computation","volume":"156 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-06-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"30","resultStr":"{\"title\":\"Dominant-Strategy versus Bayesian Multi-item Auctions: Maximum Revenue Determination and Comparison\",\"authors\":\"A. Yao\",\"doi\":\"10.1145/3033274.3085120\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We address two related unanswered questions in maximum revenue multi-item auctions. Is dominant-strategy implementation equivalent to the semantically less stringent Bayesian one (as in the case of Myerson's 1-item auction)? Can one find explicit solutions for non-trivial families of multi-item auctions (as in the 1-item case)? In this paper, we present such natural families whose explicit solutions exhibit a revenue gap between the two implementations. More precisely, consider the k-item n-buyer maximum revenue auction where k, n >1 with additive valuation in the independent setting (i.e., the buyers i have independent private distributions Fij on items j). We derive exact formulas for the maximum revenue when k=2 and Fij are any IID distributions on support of size 2, for both the dominant-strategy (DIC) and the Bayesian (BIC) implementations. The formulas lead to the simple characterization that, the two models have identical maximum revenue if and only if selling-separately is optimal for the distribution. Our results also give the first demonstration, in this setting, of revenue gaps between the two models. For instance, if k=n=2 and Pr{X{F = 1} = Pr{XF =2 } = 1/2, then the maximum revenue in the Bayesian implementation exceeds that in the dominant-strategy by exactly 2%; the same gap exists for the continuous uniform distribution XF over [a, a+1] ∪ [2a, 2a+1] for all large a.\",\"PeriodicalId\":287551,\"journal\":{\"name\":\"Proceedings of the 2017 ACM Conference on Economics and Computation\",\"volume\":\"156 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2017-06-20\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"30\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the 2017 ACM Conference on Economics and Computation\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/3033274.3085120\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 2017 ACM Conference on Economics and Computation","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3033274.3085120","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Dominant-Strategy versus Bayesian Multi-item Auctions: Maximum Revenue Determination and Comparison
We address two related unanswered questions in maximum revenue multi-item auctions. Is dominant-strategy implementation equivalent to the semantically less stringent Bayesian one (as in the case of Myerson's 1-item auction)? Can one find explicit solutions for non-trivial families of multi-item auctions (as in the 1-item case)? In this paper, we present such natural families whose explicit solutions exhibit a revenue gap between the two implementations. More precisely, consider the k-item n-buyer maximum revenue auction where k, n >1 with additive valuation in the independent setting (i.e., the buyers i have independent private distributions Fij on items j). We derive exact formulas for the maximum revenue when k=2 and Fij are any IID distributions on support of size 2, for both the dominant-strategy (DIC) and the Bayesian (BIC) implementations. The formulas lead to the simple characterization that, the two models have identical maximum revenue if and only if selling-separately is optimal for the distribution. Our results also give the first demonstration, in this setting, of revenue gaps between the two models. For instance, if k=n=2 and Pr{X{F = 1} = Pr{XF =2 } = 1/2, then the maximum revenue in the Bayesian implementation exceeds that in the dominant-strategy by exactly 2%; the same gap exists for the continuous uniform distribution XF over [a, a+1] ∪ [2a, 2a+1] for all large a.