The complexity of shelflisting

DOI10.1007/S11238-018-9675-7MaRDI QIDQ2633440zbMATH OpenOpenAlexWikidataFDO

Authors Yongjie Yang, Dinko Dimitrov

Publication date 8 May 2019

Published in Theory and Decision (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1611.03995

zbMATH Keywords

computational complexitybounded rationalitytop cyclechoice from listsproduct arrangement

Mathematics Subject Classification ID

Decision theory (91B06) Analysis of algorithms and problem complexity (68Q25) Consumer behavior, demand theory (91B42)

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.

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

Cites work

• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 1330033 (Why is no real title available?)
• (A,f): Choice with Frames¹
• A strong-connectivity algorithm and its applications in data flow analysis
• Beyond revealed preference: choice-theoretic foundations for behavioral welfare economics
• Consideration sets and competitive marketing
• Depth-First Search and Linear Graph Algorithms
• Introduction to algorithms.
• Rational choice with status quo bias
• The computational complexity of rationalizing behavior
• Total Ordering Problem

Cited in

(2)

• An optimization model for product placement on product listing pages
• On the computational complexity of consumer decision rules

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)