Adaptive Algorithms for Ordinal Optimisation and Dynamic Pricing in E-commerce

Adaptive Algorithms for Ordinal Optimisation and Dynamic Pricing in E-commerce

by Dongwook Shin

Browse books you can read free on Readfeed

No club is reading this yet — be the first to start one

Start a club free
About
In Chapters 2 and 3, given a finite number of populations, henceforth referred to as systems, we are concerned with the problem of dynamically learning the statistical characteristics of the systems to ultimately select the best system. This is an instance of ordinal optimization where probability distributions governing each system's performance are not known, but can be learned via sequential sampling. In Chapter 2 we study the classical setting where the ultimate goal is to choose the system with the highest mean, while in Chatper 3 the systems are compared based on quantiles. The latter setting is appropriate when downside or upside risk is more crucial than the mean performance. In both settings, we use large deviations theory to derive key structural insights on near-optimal allocation of the sampling budget, which are leveraged to design dynamic sampling policies that are practically implementable. We rigorously provide (asymptotic) performance guarantees for these policies. Further, we show via numerical testing that the proposed (nonparametric) policies perform competitively compared to other benchmark policies. In Chapter 4, we investigate how the presence of product reviews affects a dynamic-pricing monopolist. A salient feature of our problem is that the demand function evolves over time in conjunction with the dynamics of the review system. The monopolist strives to maximize its total expected revenue over a finite horizon by adjusting prices in response to the review dynamics. To formulate the problem in tractable form, we study a fluid model, which is a good approximation when the volume of sales is large. This formulation lends itself to key structural insights, which are leveraged to design a well-performing pricing policy for the underlying revenue maximization problem. The proposed policy allows a closed-form expression for price and its performance is asymptotically near-optimal. We show via simulation and counterfactual analysis the effectiveness of the proposed policy in online markets with product reviews.

Discuss Adaptive Algorithms for Ordinal Optimisation and Dynamic Pricing in E-commerce with other readers

Join or start a book club for Adaptive Algorithms for Ordinal Optimisation and Dynamic Pricing in E-commerce on Readfeed. Live chat, shared reading progress, and AI discussion questions — free to get started.

Frequently asked questions

How do I join a book club for Adaptive Algorithms for Ordinal Optimisation and Dynamic Pricing in E-commerce?

Sign up free on Readfeed, then browse public clubs or start your own club with Adaptive Algorithms for Ordinal Optimisation and Dynamic Pricing in E-commerce as the current read. Invite friends with a share link and discuss together with live chat and AI discussion questions.

Can I discuss Adaptive Algorithms for Ordinal Optimisation and Dynamic Pricing in E-commerce with other readers online?

Yes. Readfeed book clubs let you chat live, share progress, and join discussions about Adaptive Algorithms for Ordinal Optimisation and Dynamic Pricing in E-commerce with readers worldwide — whether your club is virtual, in-person, or hybrid.

Is Readfeed free?

Yes. Creating an account and joining book clubs is free. Sign up to find readers who love the same books and start discussing today.