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

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Computational economics Ročník 23; číslo 2; s. 173 - 192
Hlavní autoři: 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.
Médium: Journal Article
Jazyk:angličtina
Vydáno: Dordrecht Society for Computational Economics 01.03.2004
Springer Nature B.V
Edice:Computational Economics
Témata:
ISSN:0927-7099, 1572-9974
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí: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.
Bibliografie:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ISSN:0927-7099
1572-9974
DOI:10.1023/B:CSEM.0000021676.64701.12