1986
DOI: 10.1016/0749-5978(86)90004-x
|View full text |Cite
|
Sign up to set email alerts
|

An adaptive approach to resource allocation

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
35
0

Year Published

1987
1987
2020
2020

Publication Types

Select...
8

Relationship

0
8

Authors

Journals

citations
Cited by 29 publications
(36 citation statements)
references
References 11 publications
0
35
0
Order By: Relevance
“…Experimental studies by Busemeyer et al (1986) and Busemeyer and Myung (1987) on resource allocation tasks with interdependencies found strong evidence for local hill-climbing behavior in both studies. Further, participants tend to select a similar direction in allocating resources if performance increased, while failure induced search in a new direction.…”
Section: Behavioral Plausibility Of Nk Models Downloaded By [Mcmastermentioning
confidence: 92%
“…Experimental studies by Busemeyer et al (1986) and Busemeyer and Myung (1987) on resource allocation tasks with interdependencies found strong evidence for local hill-climbing behavior in both studies. Further, participants tend to select a similar direction in allocating resources if performance increased, while failure induced search in a new direction.…”
Section: Behavioral Plausibility Of Nk Models Downloaded By [Mcmastermentioning
confidence: 92%
“…The complementarities among different elements of a fi rm's strategy (Milgrom and Roberts, 1990) result in a complex payoff landscape in which improvements in performance often come from changing multiple aspects of the strategy together. In other words, after some local adaptation to fi nd an internally consistent strategy, incremental changes in one aspect of the strategy are often not conducive to performance gains, so that the fi rm rests on a local peak of a rugged payoff landscape (Busemeyer et al, 1986;Levinthal, 1997).…”
Section: Introductionmentioning
confidence: 99%
“…In such cases, gradient descent learning algorithms predict that any trajectory passing through a local minimum will become trapped there, and asymptotic accuracy will, therefore, be suboptimal (White, 1989). In resource allocation tasks, it has been shown that observers are susceptible to local minima, in that information is sometimes combined in a manner that produces suboptimal performance even if the optimal performance criterion is known (Busemeyer et al, 1986). The use of the dynamical trajectory paradigm presented here could provide an extension of this research to category learning.…”
Section: Discussionmentioning
confidence: 99%
“…At the extreme, these models predict no further changes in w once w ϭ w*, because the probability-oferror surface is flat at w ϭ w* (since w* contains the coordinates of the minimum of the probability-of-error surface). In fact, empirical evidence for such decreases has been reported (Busemeyer, Swenson, & Lazarte, 1986). Even so, many category-learning models that incorporate gradient descent include an additional assumption that this decrease is even more severe than predicted by standard gradient descent.…”
Section: Dynamical Trajectoriesmentioning
confidence: 99%