Results 241 to 250 of about 3,160,175 (292)
A Theory of Targeted Search [PDF]
We present a theory of targeted search, where people with a nite information processing capacity search for a match. Our theory explicitly accounts for both the quantity and the quality of matches. It delivers a unique equilibrium that resides in between the random matching and the directed search outcomes. The equilibrium that emerges from this middle
Cheremukhin, Anton A. +2 more
openaire +2 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
The Review of Economic Studies, 1982
A consumer faces list prices for commodities, but can buy one at a discount. Discounts vary randomly between sellers. The number of quotations sought depends on list prices, search costs and wealth. This function is homogeneous of degree zero, and, provided some sufficient conditions are satisfied, is; increasing in wealth; decreasing in search cost ...
Manning, R., Morgan, P. B.
openaire +1 more source
A consumer faces list prices for commodities, but can buy one at a discount. Discounts vary randomly between sellers. The number of quotations sought depends on list prices, search costs and wealth. This function is homogeneous of degree zero, and, provided some sufficient conditions are satisfied, is; increasing in wealth; decreasing in search cost ...
Manning, R., Morgan, P. B.
openaire +1 more source
Biometrika, 1971
SUMMARY Stochastic models are developed to study the success of a search by what is termed a predator for randomly or contagiously located points, called prey. The model is specified by giving the distribution of the searching time to locate a prey, school or cluster of prey and the joint distribution of handling time and numbers caught from each ...
openaire +2 more sources
SUMMARY Stochastic models are developed to study the success of a search by what is termed a predator for randomly or contagiously located points, called prey. The model is specified by giving the distribution of the searching time to locate a prey, school or cluster of prey and the joint distribution of handling time and numbers caught from each ...
openaire +2 more sources
Introduction to Search Theory and Applications
Journal of Economic Theory, 2010zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Giuseppe Moscarini, Randall Wright
openaire +1 more source
2017
Local search is a widely used method to solve combinatorial optimization problems. As many relevant combinatorial optimization problems are NP-hard, we often may not expect to find an algorithm that is guaranteed to return an optimal solution in a reasonable amount of time, i.e., in polynomial time.
Michiels, W., Aarts, E.H.L., Korst, Jan
openaire +1 more source
Local search is a widely used method to solve combinatorial optimization problems. As many relevant combinatorial optimization problems are NP-hard, we often may not expect to find an algorithm that is guaranteed to return an optimal solution in a reasonable amount of time, i.e., in polynomial time.
Michiels, W., Aarts, E.H.L., Korst, Jan
openaire +1 more source
Operations Research, 1968
Y TASK of preparing a survey of search theory has been eased by having access to two bibliographies. ENSLOW[81 t has prepared a bibliography, with abstracts, of Search Theory and Reconnaissance Theory that partially serves the purpose of a survey. S. M.
openaire +1 more source
Y TASK of preparing a survey of search theory has been eased by having access to two bibliographies. ENSLOW[81 t has prepared a bibliography, with abstracts, of Search Theory and Reconnaissance Theory that partially serves the purpose of a survey. S. M.
openaire +1 more source
Operations Research, 1957
This is Part III, concluding the series of three papers on The Theory of Search Part I, Kinematic Bases, appeared in Opns. Res. 4, 324–346 (1956) and Part II, Target Detection, in 4, 503–531 (1956). The present paper, while similar in content and results to the third chapter of Search and Screening (O.E.G. Report No.
openaire +1 more source
This is Part III, concluding the series of three papers on The Theory of Search Part I, Kinematic Bases, appeared in Opns. Res. 4, 324–346 (1956) and Part II, Target Detection, in 4, 503–531 (1956). The present paper, while similar in content and results to the third chapter of Search and Screening (O.E.G. Report No.
openaire +1 more source
British Journal of Music Therapy, 2009
This paper is a version of a talk originally given at the 3rd International Symposium of Nordoff Robbins Music Therapists in 2006. It is a personal account of my own development as a music therapist over more than 15 years working with children and adults.
openaire +1 more source
This paper is a version of a talk originally given at the 3rd International Symposium of Nordoff Robbins Music Therapists in 2006. It is a personal account of my own development as a music therapist over more than 15 years working with children and adults.
openaire +1 more source
2013
Search games and rendezvous problems have received growing attention in computer science within the past few years. Rendezvous problems emerge naturally, for instance, to optimize performance and convergence of mobile robots. This gives a new algorithmic point of view to the theory.
openaire +1 more source
Search games and rendezvous problems have received growing attention in computer science within the past few years. Rendezvous problems emerge naturally, for instance, to optimize performance and convergence of mobile robots. This gives a new algorithmic point of view to the theory.
openaire +1 more source
The Theory of Search: Optimum Distribution of Search Effort
Management Science, 1958This paper will be concerned with formulating the optimum allocation of search effort as a problem in convex programming so that their solutions may be made amenable to treatment by the adjacent extreme point methods of linear programming. Attention will be concentrated on discrete (statistical) distributions because this class of cases admits of the ...
A. Charnes, W. W. Cooper
openaire +1 more source

