Optimal shelflisting invites profit maximization to become sensitive to the ways in which purchasing decisions are order-dependent. We study the computational complexity of the corresponding product arrangement problem when consumers are either rational maximizers, use a satisficing procedure, or apply successive choice. The complexity results we report are shown to crucially depend on the size of the top cycle in consumers’ preferences over products and on the direction in which alternatives on the shelf are encountered.
This is a preview of subscription content, log in to check access.
Buy single article
Instant access to the full article PDF.
Price includes VAT for USA
Subscribe to journal
Immediate online access to all issues from 2019. Subscription will auto renew annually.
This is the net price. Taxes to be calculated in checkout.
Apesteguia, J., & Ballester, M. A. (2010). The computational complexity of rationalizing behavior. Journal of Mathematical Economics, 46(3), 356–363.
Ausiello, G., Protasi, M., Marchetti-Spaccamela, A., Gambosi, G., Crescenzi, P., & Kann, V. (1999). Complexity and approximation: Combinatorial Optimization Problems and their approximability properties. Secaucus, NJ: Springer.
Bernheim, B. D., & Rangel, A. (2009). Beyond revealed preference: Choice-theoretic foundations for behavioral welfare economics. Quarterly Journal of Economics, 124(1), 51–104.
Cormen, T. H., Leiserson, C. E., Rivest, R. L., & Stein, C. (2009). Introduction to algorithms (3rd ed.). Cambridge: MIT Press.
Eliaz, K., & Spiegler, R. (2011). Consideration sets and competitive marketing. Review of Economic Studies, 78(1), 235–262.
Garey, M. R., & Johnson, D. S. (1979). Computers and intractability: A guide to the theory of NP-completeness. New York: W. H. Freeman.
Gigerenzer, G., Todd, P. M., & Group AR. (1999). Simple heuristics that make us smart. Oxford: Oxford University Press.
Leininger, W. (1993). The fatal vote: Berlin versus Bonn. FinanzArchiv, 50(1), 1–20.
Manrai, A. K., & Sinha, P. (1989). Elimination-by-cutoffs. Marketing Science, 8(2), 133–152.
Masatlioglu, Y., & Ok, E. A. (2005). Rational choice with a status-quo bias. Journal of Economic Theory, 121(1), 1–29.
Opatrny, J. (1979). Total ordering problem. SIAM Journal on Computing, 8(1), 111–114.
Rubinstein, A., & Salant, Y. (2006). A model of choice from lists. Theoretical Economics, 1(1), 3–17.
Salant, Y. (2003). Limited computational resources favor rationality. Discussion Paper.
Salant, Y. (2011). Procedural analysis of choice rules with applications to bounded rationality. American Economic Review, 101(2), 724–748.
Salant, Y., & Rubinstein, A. (2008). (A, f): Choice with frames. Review of Economic Studies, 75(4), 1287–1296.
Sharir, M. (1981). A strong-connectivity algorithm and its applications in data flow analysis. Computers & Mathematics with Applications, 7(1), 67–72.
Simon, H. A. (1955). A behavioral model of rational choice. Quarterly Journal of Economics, 69(1), 99–118.
Spiegler, R. (2014). Competitive framing. American Economic Journal: Microeconomics, 6(3), 35–58.
Tarjan, R. (1972). Depth-first search and linear graph algorithms. SIAM Journal on Computing, 1(2), 146–160.
Tovey, C. A. (2002). Tutorial on computational complexity. Interfaces, 32(3), 30–61.
Valenzuela, A., & Raghubir, P. (2009). Position-biased beliefs: The center-stage efect. Journal of Consumer Psychology, 19(2), 185–196.
Valenzuela, A., Raghubir, P., & Mitakakis, C. (2013). Shelf space schemes: Myth or reality? Journal of Business Research, 66(7), 881–888.
We are grateful to two anonymous referees for their helpful comments and suggestions.
About this article
Cite this article
Yang, Y., Dimitrov, D. The complexity of shelflisting. Theory Decis 86, 123–141 (2019). https://doi.org/10.1007/s11238-018-9675-7
- Bounded rationality
- Choice from lists
- Computational complexity
- Product arrangement
- Top cycle