On the Computational Complexity of Consumer Decision Rules

A. Norman (), A. Ahmed, J. Chou, A. Dalal, K. Fortson, M. Jindal, C. Kurz, H. Lee, K. Payne, R. Rando, Kevin Sheppard (), E. Sublett, J. Sussman and I. White
Authors registered in the RePEc Author Service: Adnan Ahmed and Adam

Computational Economics, 2004, vol. 23, issue 2, 173-192

Abstract: A consumer entering a new bookstore can face more than 250,000 alternatives. The efficiency of compensatory and noncompensatory decision rules for finding a preferred item depends on the efficiency of their associated information operators. At best, item-by-item information operators lead to linear computational complexity; set information operators, on the other hand, can lead to constant complexity. We perform an experiment demonstrating that subjects are approximately rational in selecting between sublinear and linear rules. Many markets are organized by attributes that enable consumers to employ a set-selection-by-aspect rule using set information operations. In cyberspace decision rules are encoded as decision aids.

Date: 2004
References: Add references at CitEc
Citations: View citations in EconPapers (4)

Downloads: (external link)
http://journals.kluweronline.com/issn/0927-7099/contents (text/html)
Access to the full text of the articles in this series is restricted.

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:compec:v:23:y:2004:i:2:p:173-192

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

Access Statistics for this article

Computational Economics is currently edited by Hans Amman

More articles in Computational Economics from Springer, Society for Computational Economics Contact information at EDIRC.
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().