Feature-Based Dynamic Pricing

References

• Abbasi-Yadkori Y, Pál D, Szepesvári C (2011) Improved algorithms for linear stochastic bandits. Advances in Neural Information Processing Systems, vol. 24 (Curran Associates, Red Hook, NY), 2312–2320.Google Scholar
• Agrawal S, Devanur NR (2016) Linear contextual bandits with knapsacks. Advances in Neural Information Processing Systems, vol. 29 (Curran Associates, Red Hook, NY), 3458–3467.Google Scholar
• Agrawal S, Devanur NR (2019) Bandits with global convex constraints and objective. Oper. Res. 67(5):1486–1502.Google Scholar
• Agrawal S, Devanur NR, Li L (2016) An efficient algorithm for contextual bandits with knapsacks, and an extension to concave objectives. Proc. Machine Learn. Res. (PMLR), 49:4–18.Google Scholar
• Agarwal A, Hsu D, Kale S, Langford J, Li L, Schapire RE (2014) Taming the monster: A fast and simple algorithm for contextual bandits. Proc. 31st Internat. Conf. Machine Learn., Beijing, China, 1638–1646.Google Scholar
• Amin K, Kearns M, Syed U (2011) Bandits, query learning, and the haystack dimension. Proc. 24th Annual Conf. Learn. Theory 19:87–106.Google Scholar
• Amin K, Rostamizadeh A, Syed U (2014) Repeated contextual auctions with strategic buyers. Advances in Neural Information Processing Systems, vol. 27 (Curran Associates, Red Hook, NY), 622–630.Google Scholar
• Amin K, Cummings R, Dworkin L, Kearns M, Roth A (2015) Online learning and profit maximization from revealed preferences. Proc. 29th AAAI Conf. Artificial Intelligence, Austin, Texas, 770–776.Google Scholar
• Araman VF, Caldentey R (2009) Dynamic pricing for nonperishable products with demand learning. Oper. Res. 57(5):1169–1188.Link, Google Scholar
• Auer P (2003) Using confidence bounds for exploitation-exploration trade-offs. Proc. Machine Learn. Res. (PMLR), 3:397–422.Google Scholar
• Auer, P, Cesa-Bianchi N, Freund Y, Schapire RE (2002) The nonstochastic multiarmed bandit problem. SIAM J. Comput. 32(1):48–77.Crossref, Google Scholar
• Babaioff M, Dughmi S, Kleinberg R, Slivkins A (2015) Dynamic pricing with limited supply. ACM Trans. Econ. Comput. 3(1):4.Crossref, Google Scholar
• Badanidiyuru A, Langford J, Slivkins A (2014) Resourceful contextual bandits. Proc. Machine Learn. Res. (PMLR), 35:1109–1134.Google Scholar
• Badanidiyuru A, Kleinberg R, Slivkins A (2018) Bandits with knapsacks. J. ACM 65(3):Article 13.Google Scholar
• Bertsimas D, O’Hair A (2013) Learning preferences under noise and loss aversion: An optimization approach. Oper. Res. 61(5):1190–1199.Link, Google Scholar
• Bertsimas D, Vayanos P (2015) Data-driven learning in dynamic pricing using adaptive optimization. Working paper, Massachusetts Institute of Technology, Cambridge.Google Scholar
• Besbes O, Zeevi A (2009) Dynamic pricing without knowing the demand function: Risk bounds and near-optimal algorithms. Oper. Res. 57(6):1407–1420.Link, Google Scholar
• Besbes O, Zeevi A (2015) On the (surprising) sufficiency of linear models for dynamic pricing with demand learning. Management Sci. 61(4):723–739.Link, Google Scholar
• Bland, RG, Goldfarb D, Todd MJ (1981) The ellipsoid method: A survey. Oper. Res. 29(6):1039–1091.Link, Google Scholar
• Boutilier C, Patrascu R, Poupart P, Schuurmans D (2006) Constraint-based optimization and utility elicitation using the minimax decision criterion. Artificial Intelligence 170(8–9):686–713.Crossref, Google Scholar
• Bray J (2017) The price is right. Accessed May 28, 2019, https://airbnb.design/smart-pricing-how-we-used-host-feedback-to-build-personalized-tools.Google Scholar
• Broder J, Rusmevichientong P (2012) Dynamic pricing under a general parametric choice model. Oper. Res. 60(4):965–980.Link, Google Scholar
• Bubeck S, Cesa-Bianchi N (2012) Regret analysis of stochastic and nonstochastic multi-armed bandit problems. Foundation Trends Machine Learn. 5(1):1–122.Google Scholar
• Bubeck S, Slivkins A (2012) The best of both worlds: stochastic and adversarial bandits. Proc. Machine Learn. Res. (PMLR), 23:42.1–42.23.Google Scholar
• Chakrabarti D, Agarwal D, Josifovski V (2008) Contextual advertising by combining relevance with click feedback. Proc. 17th Internat. Conf. World Wide Web (ACM, New York), 417–426.Google Scholar
• Chen Y, Farias VF (2013) Simple policies for dynamic pricing with imperfect forecasts. Oper. Res. 61(3):612–624.Link, Google Scholar
• Chu W, Li L, Reyzin L, Schapire RE (2011) Contextual bandits with linear payoff functions. Proc. Machine Learn. Res. (PMLR), 15:208–214.Google Scholar
• den Boer AV, Zwart B (2013) Simultaneously learning and optimizing using controlled variance pricing. Management Sci. 60(3):770–783.Link, Google Scholar
• Dudik M, Hsu D, Kale S, Karampatziakis N, Langford J, Reyzin L, Zhang T (2011) Efficient optimal learning for contextual bandits. Preprint, submitted June 13, https://arxiv.org/abs/1106.2369.Google Scholar
• Golub GH (1973) Some modified matrix eigenvalue problems. SIAM Rev. 15(2):318–334.Crossref, Google Scholar
• Grötschel M, Lovász L, Schrijver A (1993) Geometric Algorithms and Combinatorial Optimization, 2nd ed. (Springer, Berlin)Crossref, Google Scholar
• Harrison, JM, Keskin NB, Zeevi A (2012) Bayesian dynamic pricing policies: Learning and earning under a binary prior distribution. Management Sci. 58(3):570–586.Link, Google Scholar
• Hazan E, Kale S (2011) Better algorithms for benign bandits. Proc. Machine Learn. Res. (PMLR), 12:1287–1311.Google Scholar
• Keskin NB, Zeevi A (2014) Dynamic pricing with an unknown linear demand model: asymptotically optimal semi-myopic policies. Oper. Res. 62(5):1142–1167.Link, Google Scholar
• Khachiyan LG (1979) A polynomial algorithm in linear programming. Dokl. Akad. Nauk SSSR. 244(1):1093–1096.Google Scholar
• Kleinberg R, Leighton T (2003) The value of knowing a demand curve: Bounds on regret for online posted-price auctions. Proc. 44th Annual IEEE Sympos. Foundations Comput. Sci. (IEEE, Washington, DC), 594–605.Google Scholar
• Kleinberg R, Slivkins A, Upfal E (2013) Bandits and experts in metric spaces. Preprint, submitted December 4, https://arxiv.org/abs/1312.1277.Google Scholar
• Lykouris T, Mirrokni V, Leme RP (2018) Stochastic bandits robust to adversarial corruptions. Proc. 50th Annual ACM SIGACT Sympos. Theory Comput. (ACM, New York), 114–122.Google Scholar
• Malpezzi S (2002) Hedonic pricing models: A selective and applied review. O'Sullivan T, Gibb K, eds. Housing Economics and Public Policy (Wiley, Hoboken, NJ), 67–89.Google Scholar
• Milon, JW, Gressel J, Mulkey D (1984) Hedonic amenity valuation and functional form specification. Land Econom. 60(4):378–387.Crossref, Google Scholar
• Phillips RL (2005) Pricing and Revenue Optimization. (Stanford University Press, Stanford, CA)Crossref, Google Scholar
• Qiang S, Bayati M (2016) Dynamic pricing with demand covariates. Working paper, Stanford University, Palo Alto, CA.Google Scholar
• Richardson M, Dominowska E, Ragno R (2007) Predicting clicks: estimating the click-through rate for new ads. Proc. 16th Internat. Conf. World Wide Web (ACM, New York), 521–530.Google Scholar
• Roth A, Ullman J, Wu ZS (2016) Watch and learn: Optimizing from revealed preferences feedback. Proc. 48th Annual ACM Sympos. Theory Comput. (ACM, New York), 949–962.Google Scholar
• Roth A, Slivkins A, Ullman J, Wu ZS (2017) Multidimensional dynamic pricing for welfare maximization. Proc. 2017 ACM Conf. Econom. Comput. (ACM, New York), 519–536.Google Scholar
• Rothschild M (1974) A two-armed bandit theory of market pricing. J. Econom. Theory. 9(2):185–202.Crossref, Google Scholar
• Sirmans S, Macpherson D, Zietz E (2005) The composition of hedonic pricing models. J. Real Estate Literature 13(1):1–44.Crossref, Google Scholar
• Syrgkanis V, Krishnamurthy A, Schapire R (2016a) Efficient algorithms for adversarial contextual learning. JMLR 48:2159–2168.Google Scholar
• Syrgkanis V, Luo H, Krishnamurthy A, Schapire RE (2016b) Improved regret bounds for oracle-based adversarial contextual bandits. Advances in Neural Information Processing Systems, vol. 29 (Curran Associates, Red Hook, NY), 3135–3143.Google Scholar
• Toubia O, Hauser J, Garcia R (2007) Probabilistic polyhedral methods for adaptive choice-based conjoint analysis: Theory and application. Marketing Sci. 26(5):596–610.Link, Google Scholar
• Toubia, O, Hauser JR, Simester DI (2004) Polyhedral methods for adaptive choice-based conjoint analysis. J. Marketing Res. 41(1):116–131.Crossref, Google Scholar
• Toubia, O, Simester DI, Hauser JR, Dahan E (2003) Fast polyhedral adaptive conjoint estimation. Marketing Sci. 22(3):273–303.Link, Google Scholar
• Viappiani P, Boutilier C (2009) Regret-based optimal recommendation sets in conversational recommender systems. Proc. 3rd ACM Conf. Recommender Systems (ACM, New York), 101–108.Google Scholar
• Wilkinson JH (1965) The Algebraic Eigenvalue Problem (Clarendon Press, Oxford).Google Scholar
• Ye P, Qian J, Chen J, Chen-hung W, Zhou Y, De Mars S, Yang F, Zhang L (2018) Customized regression model for Airbnb dynamic pricing. Proc. 24th ACM SIGKDD Internat. Conf. Knowledge Discovery Data Mining (ACM, New York), 932–940.Google Scholar