{"title":"基于战略客户的稳健动态定价","authors":"Yiwei Chen, V. Farias","doi":"10.1145/2764468.2764530","DOIUrl":null,"url":null,"abstract":"We consider the canonical problem of revenue management (RM) wherein a seller must sell an inventory of some product over a finite horizon via an anonymous, posted price mechanism. Unlike typical models in RM, we assume that customers are forward looking. In particular, customers arrive randomly over time, and strategize about their time of purchase. The private valuations of these customers decay over time and the customers incur monitoring costs; both the rate of decay and these monitoring costs are private information. Moreover, customer valuations and monitoring costs are potentially correlated. This setting has proven to be a difficult one for the design of optimal dynamic mechanisms heretofore. Optimal pricing schemes -- an almost necessary mechanism format for practical RM considerations -- have been similarly elusive. We propose a class of pricing policies, and a simple to compute policy within this class, that is guaranteed to achieve expected revenues that are at least within 29% of those under an optimal (not necessarily posted price) dynamic mechanism. Moreover, the seller can compute this pricing policy without any knowledge of the distribution of customer discount factors and monitoring costs. Our scheme can be interpreted as solving a dynamic pricing problem for myopic customers with the additional requirement of a novel --restricted submartingale constraint on prices. Numerical experiments suggest that the policy is, for all intents, near optimal.","PeriodicalId":376992,"journal":{"name":"Proceedings of the Sixteenth ACM Conference on Economics and Computation","volume":"5 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-06-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"74","resultStr":"{\"title\":\"Robust Dynamic Pricing With Strategic Customers\",\"authors\":\"Yiwei Chen, V. Farias\",\"doi\":\"10.1145/2764468.2764530\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We consider the canonical problem of revenue management (RM) wherein a seller must sell an inventory of some product over a finite horizon via an anonymous, posted price mechanism. Unlike typical models in RM, we assume that customers are forward looking. In particular, customers arrive randomly over time, and strategize about their time of purchase. The private valuations of these customers decay over time and the customers incur monitoring costs; both the rate of decay and these monitoring costs are private information. Moreover, customer valuations and monitoring costs are potentially correlated. This setting has proven to be a difficult one for the design of optimal dynamic mechanisms heretofore. Optimal pricing schemes -- an almost necessary mechanism format for practical RM considerations -- have been similarly elusive. We propose a class of pricing policies, and a simple to compute policy within this class, that is guaranteed to achieve expected revenues that are at least within 29% of those under an optimal (not necessarily posted price) dynamic mechanism. Moreover, the seller can compute this pricing policy without any knowledge of the distribution of customer discount factors and monitoring costs. Our scheme can be interpreted as solving a dynamic pricing problem for myopic customers with the additional requirement of a novel --restricted submartingale constraint on prices. Numerical experiments suggest that the policy is, for all intents, near optimal.\",\"PeriodicalId\":376992,\"journal\":{\"name\":\"Proceedings of the Sixteenth ACM Conference on Economics and Computation\",\"volume\":\"5 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2015-06-15\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"74\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the Sixteenth ACM Conference on Economics and Computation\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/2764468.2764530\",\"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 Sixteenth ACM Conference on Economics and Computation","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/2764468.2764530","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
We consider the canonical problem of revenue management (RM) wherein a seller must sell an inventory of some product over a finite horizon via an anonymous, posted price mechanism. Unlike typical models in RM, we assume that customers are forward looking. In particular, customers arrive randomly over time, and strategize about their time of purchase. The private valuations of these customers decay over time and the customers incur monitoring costs; both the rate of decay and these monitoring costs are private information. Moreover, customer valuations and monitoring costs are potentially correlated. This setting has proven to be a difficult one for the design of optimal dynamic mechanisms heretofore. Optimal pricing schemes -- an almost necessary mechanism format for practical RM considerations -- have been similarly elusive. We propose a class of pricing policies, and a simple to compute policy within this class, that is guaranteed to achieve expected revenues that are at least within 29% of those under an optimal (not necessarily posted price) dynamic mechanism. Moreover, the seller can compute this pricing policy without any knowledge of the distribution of customer discount factors and monitoring costs. Our scheme can be interpreted as solving a dynamic pricing problem for myopic customers with the additional requirement of a novel --restricted submartingale constraint on prices. Numerical experiments suggest that the policy is, for all intents, near optimal.