In this paper, we consider a variant of the cascade model of customer behavior, where the customer browses through a multi-page menu, scanning each page from top to the bottom predominantly. Each page is assigned items belonging to a specific class out of a set of such classes. He/she adopts the first most attractive content, which generates some revenue. We aim at maximizing the total revenue by finding an optimal index-based policy for ranking the content when the customer preferences and patience levels are known. When we have no prior information about the customer, we design the Online Greedy Algorithm (OGA) which we prove to be asymptotically converging to the optimal solution with probability one. We also provide high probability finite-time convergence bounds for the same.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.
hi@scite.ai
10624 S. Eastern Ave., Ste. A-614
Henderson, NV 89052, USA
Copyright © 2024 scite LLC. All rights reserved.
Made with 💙 for researchers
Part of the Research Solutions Family.