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 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.
If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.
Volume (Year): 23 (2004)
Issue (Month): 2 (03)
|Contact details of provider:|| Web page: http://www.springer.com|
|Order Information:||Web: http://www.springer.com/economics/economic+theory/journal/10614/PS2|
When requesting a correction, please mention this item's handle: RePEc:kap:compec:v:23:y:2004:i:2:p:173-192. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Sonal Shukla)or (Rebekah McClure)
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If references are entirely missing, you can add them using this form.
If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.
Please note that corrections may take a couple of weeks to filter through the various RePEc services.