Leveraging Reviews: Learning to Price with Buyer and Seller Uncertainty

Published Online:

References

  • Acemoglu D, Makhdoumi A, Malekian A, Ozdaglar A (2022) Learning from reviews: The selection effect and the speed of learning. Econometrica 90(6):2857–2899.CrossrefGoogle Scholar
  • Ashlagi I, Daskalakis C, Haghpanah N (2023) Sequential mechanisms with ex-post participation guarantees. Oper. Res. 71(1):245–258.Google Scholar
  • Besbes O, Scarsini M (2018) On information distortions in online ratings. Oper. Res. 66(3):597–610.LinkGoogle Scholar
  • Bose S, Orosel G, Ottaviani M, Vesterlund L (2006) Dynamic monopoly pricing and herding. RAND J. Econom. 37(4):910–928.CrossrefGoogle Scholar
  • Boursier E, Perchet V, Scarsini M (2022) Social learning in non-stationary environments. Sanjoy D, Nika H, eds. Internat. Conf. Algorithmic Learn. Theory (PMLR, New York), 128–129.Google Scholar
  • Braverman M, Mao J, Schneider J, Weinberg M (2018) Selling to a no-regret buyer. Elkind E, Vohra R, eds. ACM Conf. Econom. Comput. (ACM, New York), 523–538.Google Scholar
  • Chamley C (2004) Rational Herds: Economic Models of Social Learning (Cambridge University Press, Cambridge, UK).Google Scholar
  • Chawla S, Devanur NR, Karlin AR, Sivan B (2022) Simple pricing schemes for consumers with evolving values. Games Econom. Behav. 134:344–360.CrossrefGoogle Scholar
  • Chen L, Papanastasiou Y (2021) Seeding the herd: Pricing and welfare effects of social learning manipulation. Management Sci. 67(11):6734–6750.LinkGoogle Scholar
  • Crapis D, Ifrach B, Maglaras C, Scarsini M (2017) Monopoly pricing in the presence of social learning. Management Sci. 63(11):3586–3608.LinkGoogle Scholar
  • Deng Y, Schneider J, Sivan B (2019) Prior-free dynamic auctions with low regret buyers. Wallach H, Larochelle H, Beygelzimer A, d’Alché-Buc F, Fox E, Garnett R, eds. Conf. Neural Inform. Processing Systems (Curran Associates Inc., Red Hook, NY).Google Scholar
  • Devanur NR, Peres Y, Sivan B (2019) Perfect Bayesian equilibria in repeated sales. Games Econom. Behav. 118:570–588.Google Scholar
  • Garivier A, Lattimore T, Kaufmann E (2016) On explore-then-commit strategies. Lee D, Sugiyama M, Luxburg U, Guyon I, Garnett R, eds. Conf. Neural Inform. Processing Systems (Curran Associates Inc., Red Hook, NY).Google Scholar
  • Han S, Anderson CK (2020) Customer motivation and response bias in online reviews. Cornell Hospitality Quart. 61(2):142–153.CrossrefGoogle Scholar
  • Hu N, Pavlou PA, Zhang JJ (2009) Why do online product reviews have a j-shaped distribution? Overcoming biases in online word-of-mouth communication. Comm. ACM 52(10):144–147.CrossrefGoogle Scholar
  • Ifrach B, Maglaras C, Scarsini M, Zseleva A (2019) Bayesian social learning from consumer reviews. Oper. Res. 67(5):1209–1221.LinkGoogle Scholar
  • Kakhbod A, Lanzani G, Xing H (2021) Heterogeneous learning in product markets. Preprint, submitted November 14, https://doi.org/10.2139/ssrn.3961223.Google Scholar
  • Kleinberg R, Leighton T (2003) The value of knowing a demand curve: Bounds on regret for on-line posted-price auctions. Sudan M, ed. Sympos. Foundations Comput. Sci. (IEEE, Piscataway, NJ), 594–605.Google Scholar
  • Mostagir M, Siderius J (2023) Strategic reviews. Management Sci. 69(2):904–921.LinkGoogle Scholar
  • Nekipelov D, Syrgkanis V, Tardos E (2015) Econometrics for learning agents. Feldman M, Schwarz M, eds. ACM Conf. Econom. Comput. (ACM, New York), 1–18.Google Scholar
  • Papadimitriou C, Pierrakos G, Psomas A, Rubinstein A (2022) On the complexity of dynamic mechanism design. Games Econom. Behav. 134:399–427.CrossrefGoogle Scholar
  • Zhao H, Chen W (2020) Stochastic one-sided full-information bandit. Promont E, Knobbe A, eds. Eur. Conf. Machine Learn. Principles Practice Knowledge Discovery Databases (Springer, Berlin), 150–166.Google Scholar
INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.