Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
481568 | European Journal of Operational Research | 2009 | 18 Pages |
Abstract
In this paper we shall deal with search games in which the strategic situation is developed on a lattice. The main characteristic of these games is that the points in each column of the lattice have a specific associated weight which directly affects the payoff function. Thus, the points in different columns represent points of different strategic value. We solve three different types of games. The first involves search, ambush and mixed situations, the second is a search and inspection game and the last is related to the accumulative games.
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science (General)
Authors
N. Zoroa, P. Zoroa, M.J. Fernández-Sáez,