On the Computational Complexity of Consumer Decision Rules

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...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Computational economics Jg. 23; H. 2; S. 173 - 192
Hauptverfasser: Norman, A., Ahmed, A., Chou, J., Dalal, A., Fortson, K., Jindal, M., Kurz, C., Lee, H., Payne, K., Rando, R., Sheppard, K., Sublett, E., Sussman, J., White, I.
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Dordrecht Society for Computational Economics 01.03.2004
Springer Nature B.V
Schriftenreihe:Computational Economics
Schlagworte:
ISSN:0927-7099, 1572-9974
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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.
Bibliographie:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ISSN:0927-7099
1572-9974
DOI:10.1023/B:CSEM.0000021676.64701.12