The complexity of shelflisting

Theory and Decision 86 (1):123-141 (2019)
  Copy   BIBTEX

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.

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 101,337

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

The Computational Complexity of Choice Sets.Felix Brandt, Felix Fischer & Paul Harrenstein - 2009 - Mathematical Logic Quarterly 55 (4):444-459.
On the complexity of the pancake problem.Fuxiang Yu - 2007 - Mathematical Logic Quarterly 53 (4):532-546.

Analytics

Added to PP
2018-10-12

Downloads
17 (#1,152,036)

6 months
4 (#1,249,230)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations