23 search results - page 4 / 5 » anor 2002 |
ANOR
2002
13 years 8 months ago
2002
A subgame perfection refinement of Nash equilibrium is suggested for games of the following type: each of an infinite number of identical players selects an action using his privat...
ANOR
2002
13 years 8 months ago
2002
Classical approaches to location problems are based on the minimization of the average distance (the median concept) or the minimization of the maximum distance (the center concept...
ANOR
2002
13 years 8 months ago
2002
We consider an inspection game played on a continuous finite time interval. The inspector wishes to detect a violation as soon as possible after it has been made by the operator. T...
ANOR
2002
13 years 8 months ago
2002
Abstract. This paper presents a hybridization of a Constraint Programming (CP) model and search techniques with Local Search (LS) and some ideas borrowed from Genetic Algorithms (G...
ANOR
2002
13 years 8 months ago
2002
Locating a facility is often modeled as either the maxisum or the minisum problem, reflecting whether the facility is undesirable (obnoxious) or desirable. But many facilities are ...