My Account Log in

2 options

Consumer optimization problem solving / Alfred L Norman, The University of Texas at Austin, USA.

EBSCOhost Ebook Business Collection Available online

View online

EBSCOhost eBook Community College Collection Available online

View online
Format:
Book
Author/Creator:
Norman, A. L. (Alfred L.), author.
Language:
English
Subjects (All):
Consumer behavior--Econometric models.
Consumer behavior.
Consumption (Economics)--Econometric models.
Consumption (Economics).
Physical Description:
1 online resource (250 p.)
Place of Publication:
New Jersey : World Scientific, [2015]
Language Note:
English
Summary:
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. Humans make simplifications to solve the intractable consumer optimization problem. Consumers search for goods and services item-by-item, which greatly reduces the number of alternatives to consider. In addition, consumers have operators that can process a set in a single operation. Also, consumers budget by incremental adjustment. In considering consumer performance the question to ask is how close to optimal is consumer performance and not whether consumers optimize as a yes/no question. Given the ordinal nature of utility theory this creates a basic measurement problem. The book presents a review of the literature on consumer performance. This is an opportune time to study consumer procedures because the Internet provides a media to make substantial improvements in consumer performance. The book includes a case study comparing the performance of a digital camera selection code with the advice of sales people. A field experiment demonstrates that the software code provides better advice.
Contents:
Preface
Acknowledgement
Introduction
Computational complexity
Ordering
Computational complexity : decision rules
Repeated price search
Repeated item search : forecasting
Budgeting
How close to optimal?
Improving consumer performance
Appendix A CC of the discrete two-stage budgeting problem
Bibliography
Index.
Notes:
Bibliographic Level Mode of Issuance: Monograph
Includes bibliographical references and index.
Description based on print version record.
ISBN:
981-4635-29-4
OCLC:
900633243

The Penn Libraries is committed to describing library materials using current, accurate, and responsible language. If you discover outdated or inaccurate language, please fill out this feedback form to report it and suggest alternative language.

Find

Home Release notes

My Account

Shelf Request an item Bookmarks Fines and fees Settings

Guides

Using the Find catalog Using Articles+ Using your account