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 Edit this on Wikidata


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




Cites Work


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)