The complexity of shelflisting

DOI10.1007/s11238-018-9675-7zbMath1411.91369arXiv1611.03995OpenAlexW2579556438MaRDI QIDQ2633440

Dinko Dimitrov, Yongjie Yang

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

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The computational complexity of rationalizing behavior
• A strong-connectivity algorithm and its applications in data flow analysis
• Rational choice with status quo bias
• Consideration Sets and Competitive Marketing
• (A,f): Choice with Frames¹
• Total Ordering Problem
• Depth-First Search and Linear Graph Algorithms
• Beyond Revealed Preference: Choice-Theoretic Foundations for Behavioral Welfare Economics^*

This page was built for publication: The complexity of shelflisting