On the Computational Complexity of Consumer Decision Rules.

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

Бүрэн тодорхойлолт

Номзүйн дэлгэрэнгүй
Үндсэн зохиолчид: Norman, A, Ahmed, A, Chou, J, Dalal, A, Fortson, K, Jindal, C, Kurz, C, Lee, H, Payne, J, Rando, R, Sheppard, K, Sublett, E, Sussman, J, White, I
Формат: Journal article
Хэл сонгох:English
Хэвлэсэн: Springer 2004
Тодорхойлолт
Тойм: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.

Ижил төстэй зүйлс