The complexity of shelflisting

Yongjie Yang and Dinko Dimitrov
Additional contact information
Yongjie Yang: Saarland University

Theory and Decision, 2019, vol. 86, issue 1, No 7, 123-141

Abstract: 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.

Keywords: Bounded rationality; Choice from lists; Computational complexity; Product arrangement; Top cycle (search for similar items in EconPapers)
Date: 2019
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s11238-018-9675-7 Abstract (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:kap:theord:v:86:y:2019:i:1:d:10.1007_s11238-018-9675-7

Ordering information: This journal article can be ordered from
http://www.springer. ... ry/journal/11238/PS2

DOI: 10.1007/s11238-018-9675-7

Access Statistics for this article

Theory and Decision is currently edited by Mohammed Abdellaoui

More articles in Theory and Decision from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().