The complexity of shelflisting
From MaRDI portal
Publication:2633440
DOI10.1007/S11238-018-9675-7zbMATH Open1411.91369arXiv1611.03995OpenAlexW2579556438WikidataQ129157740 ScholiaQ129157740MaRDI QIDQ2633440FDOQ2633440
Authors: Yongjie Yang, Dinko Dimitrov
Publication date: 8 May 2019
Published in: Theory and Decision (Search for Journal in Brave)
Abstract: 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.
Full work available at URL: https://arxiv.org/abs/1611.03995
Recommendations
- On the computational complexity of consumer decision rules
- The location and allocation of products and product families on retail shelves
- Approximation algorithms for product framing and pricing
- Shelf space dimensioning and product allocation in retail stores
- An optimization model for product placement on product listing pages
Decision theory (91B06) Analysis of algorithms and problem complexity (68Q25) Consumer behavior, demand theory (91B42)
Cites Work
- Introduction to algorithms.
- Title not available (Why is that?)
- Depth-First Search and Linear Graph Algorithms
- A strong-connectivity algorithm and its applications in data flow analysis
- Title not available (Why is that?)
- Rational choice with status quo bias
- Total Ordering Problem
- Consideration sets and competitive marketing
- (A,f): Choice with Frames1
- Beyond revealed preference: choice-theoretic foundations for behavioral welfare economics
- The computational complexity of rationalizing behavior
Cited In (2)
This page was built for publication: The complexity of shelflisting
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2633440)