The complexity of shelflisting
- 41 Downloads
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.
KeywordsBounded rationality Choice from lists Computational complexity Product arrangement Top cycle
We are grateful to two anonymous referees for their helpful comments and suggestions.
- Cormen, T. H., Leiserson, C. E., Rivest, R. L., & Stein, C. (2009). Introduction to algorithms (3rd ed.). Cambridge: MIT Press.Google Scholar
- Garey, M. R., & Johnson, D. S. (1979). Computers and intractability: A guide to the theory of NP-completeness. New York: W. H. Freeman.Google Scholar
- Gigerenzer, G., Todd, P. M., & Group AR. (1999). Simple heuristics that make us smart. Oxford: Oxford University Press.Google Scholar
- Leininger, W. (1993). The fatal vote: Berlin versus Bonn. FinanzArchiv, 50(1), 1–20.Google Scholar
- Rubinstein, A., & Salant, Y. (2006). A model of choice from lists. Theoretical Economics, 1(1), 3–17.Google Scholar
- Salant, Y. (2003). Limited computational resources favor rationality. Discussion Paper.Google Scholar
- Spiegler, R. (2014). Competitive framing. American Economic Journal: Microeconomics, 6(3), 35–58.Google Scholar