Consumer Optimization Problem Solving

Alfred L Norman
Additional contact information
Alfred L Norman: The University of Texas at Austin, USA

in World Scientific Books from World Scientific Publishing Co. Pte. Ltd.

Abstract: What algorithms are tractable depends on the speed of the processor. Given the speed of digital computers, polynomial algorithms are considered tractable. But, a human can take several seconds to make one binary comparison between two pens. Given this slow speed, sublinear algorithms are considered tractable for an unaided human and this defines Simon's concept of bounded rationality.

Keywords: Microeconomics; Consumer Behaviour; Consumer Optimization; Decision Making (search for similar items in EconPapers)
Date: 2015
ISBN: 9789814635288
References: Add references at CitEc
Citations:

Downloads: (external link)
https://www.worldscientific.com/worldscibooks/10.1142/9393 (text/html)
Ebook Access is available upon purchase

Chapters in this book:

Ch 1 Introduction , pp 1-10

Alfred L Norman

Ch 2 Computational Complexity , pp 11-27

Alfred L Norman

Ch 3 Ordering , pp 29-47

Alfred L Norman

Ch 4 Computational Complexity: Decision Rules , pp 49-70

Alfred L Norman

Ch 5 Repeated Price Search , pp 71-90

Alfred L Norman

Ch 6 Repeated Item Search: Forecasting , pp 91-113

Alfred L Norman

Ch 7 Repeated Item Search: Choice , pp 115-137

Alfred L Norman

Ch 8 Budgeting , pp 139-163

Alfred L Norman

Ch 9 How Close to Optimal? , pp 165-187

Alfred L Norman

Ch 10 Improving Consumer Performance , pp 189-222

Alfred L Norman

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:wsi:wsbook:9393

Ordering information: This item can be ordered from

Access Statistics for this book

More books in World Scientific Books from World Scientific Publishing Co. Pte. Ltd.
Bibliographic data for series maintained by Tai Tone Lim ().