We found a match
Your institution may have access to this item. Find your institution then sign in to continue.
- Title
Repeated Price Search.
- Authors
Norman, A.; Berman, J.; Brehm, K.; Drake, M.; Dyer, A.; Frisby, J.; Govil, C.; Hinchey, C.; Heuer, L.; Ke, J.; Kejriwal, S.; Kuang, K.; Keyburn, S.; Ler, S.; Powers, K.; Robertson, A.; Sanghai, J.; Schulze, C.; Schieck, J.; Sussman, J.
- Abstract
Consumers check few sites in online purchases. Previous research and experiments we perform demonstrate that consumers can not calculate the optimal strategy for price search. They use heuristics whose performance is better than random and less than optimal. To investigate online price search performance we survey student online textbook purchases. Students achieve good performance because they start with a good strategy and online market organization of marketplace and meta-search sites. An important factor is that algorithms at sites searched perform calculations that reduce the computational complexity of the search.
- Subjects
HEURISTIC algorithms; INTERNET marketing; COMPUTATIONAL complexity; MARKET prices; INTERNET searching; MARKETPLACES; META-analysis; PERFORMANCE evaluation
- Publication
Computational Economics, 2012, Vol 39, Issue 3, p243
- ISSN
0927-7099
- Publication type
Article
- DOI
10.1007/s10614-011-9276-9