The Theory of Search Games and Rendezvous [electronic resource] /

The Theory of Search Games and Rendezvous [electronic resource] /

Show other versions (1)

Search Theory is one of the original disciplines within the field of Operations Research. It deals with the problem faced by a Searcher who wishes to minimize the time required to find a hidden object, or “target. ” The Searcher chooses a path in the “search space” and finds the target when he is sufficiently close to it. Traditionally, the target is assumed to have no motives of its own regarding when it is found; it is simply stationary and hidden according to a known distribution (e. g. , oil), or its motion is determined stochastically by known rules (e. g. , a fox in a forest). The problems dealt with in this book assume, on the contrary, that the “target” is an independent player of equal status to the Searcher, who cares about when he is found. We consider two possible motives of the target, and divide the book accordingly. Book I considers the zero-sum game that results when the target (here called the Hider) does not want to be found. Such problems have been called Search Games (with the “ze- sum” qualifier understood). Book II considers the opposite motive of the target, namely, that he wants to be found. In this case the Searcher and the Hider can be thought of as a team of agents (simply called Player I and Player II) with identical aims, and the coordination problem they jointly face is called the Rendezvous Search Problem.

Saved in:
Bibliographic Details
Main Authors: Alpern, Steve. author., Gal, Shmuel. author., SpringerLink (Online service)
Format: Texto biblioteca
Language:eng
Published: Boston, MA : Springer US, 2003
Subjects:Mathematics., Operations research., Decision making., Game theory., Calculus of variations., Probabilities., Economic theory., Calculus of Variations and Optimal Control; Optimization., Game Theory, Economics, Social and Behav. Sciences., Economic Theory/Quantitative Economics/Mathematical Methods., Probability Theory and Stochastic Processes., Operation Research/Decision Theory.,
Online Access:http://dx.doi.org/10.1007/b100809
Tags: Add Tag
No Tags, Be the first to tag this record!
id KOHA-OAI-TEST:203822
record_format koha
institution COLPOS
collection Koha
country México
countrycode MX
component Bibliográfico
access En linea
En linea
databasecode cat-colpos
tag biblioteca
region America del Norte
libraryname Departamento de documentación y biblioteca de COLPOS
language eng
topic Mathematics.
Operations research.
Decision making.
Game theory.
Calculus of variations.
Probabilities.
Economic theory.
Mathematics.
Calculus of Variations and Optimal Control; Optimization.
Game Theory, Economics, Social and Behav. Sciences.
Economic Theory/Quantitative Economics/Mathematical Methods.
Probability Theory and Stochastic Processes.
Operation Research/Decision Theory.
Mathematics.
Operations research.
Decision making.
Game theory.
Calculus of variations.
Probabilities.
Economic theory.
Mathematics.
Calculus of Variations and Optimal Control; Optimization.
Game Theory, Economics, Social and Behav. Sciences.
Economic Theory/Quantitative Economics/Mathematical Methods.
Probability Theory and Stochastic Processes.
Operation Research/Decision Theory.
spellingShingle Mathematics.
Operations research.
Decision making.
Game theory.
Calculus of variations.
Probabilities.
Economic theory.
Mathematics.
Calculus of Variations and Optimal Control; Optimization.
Game Theory, Economics, Social and Behav. Sciences.
Economic Theory/Quantitative Economics/Mathematical Methods.
Probability Theory and Stochastic Processes.
Operation Research/Decision Theory.
Mathematics.
Operations research.
Decision making.
Game theory.
Calculus of variations.
Probabilities.
Economic theory.
Mathematics.
Calculus of Variations and Optimal Control; Optimization.
Game Theory, Economics, Social and Behav. Sciences.
Economic Theory/Quantitative Economics/Mathematical Methods.
Probability Theory and Stochastic Processes.
Operation Research/Decision Theory.
Alpern, Steve. author.
Gal, Shmuel. author.
SpringerLink (Online service)
The Theory of Search Games and Rendezvous [electronic resource] /
description Search Theory is one of the original disciplines within the field of Operations Research. It deals with the problem faced by a Searcher who wishes to minimize the time required to find a hidden object, or “target. ” The Searcher chooses a path in the “search space” and finds the target when he is sufficiently close to it. Traditionally, the target is assumed to have no motives of its own regarding when it is found; it is simply stationary and hidden according to a known distribution (e. g. , oil), or its motion is determined stochastically by known rules (e. g. , a fox in a forest). The problems dealt with in this book assume, on the contrary, that the “target” is an independent player of equal status to the Searcher, who cares about when he is found. We consider two possible motives of the target, and divide the book accordingly. Book I considers the zero-sum game that results when the target (here called the Hider) does not want to be found. Such problems have been called Search Games (with the “ze- sum” qualifier understood). Book II considers the opposite motive of the target, namely, that he wants to be found. In this case the Searcher and the Hider can be thought of as a team of agents (simply called Player I and Player II) with identical aims, and the coordination problem they jointly face is called the Rendezvous Search Problem.
format Texto
topic_facet Mathematics.
Operations research.
Decision making.
Game theory.
Calculus of variations.
Probabilities.
Economic theory.
Mathematics.
Calculus of Variations and Optimal Control; Optimization.
Game Theory, Economics, Social and Behav. Sciences.
Economic Theory/Quantitative Economics/Mathematical Methods.
Probability Theory and Stochastic Processes.
Operation Research/Decision Theory.
author Alpern, Steve. author.
Gal, Shmuel. author.
SpringerLink (Online service)
author_facet Alpern, Steve. author.
Gal, Shmuel. author.
SpringerLink (Online service)
author_sort Alpern, Steve. author.
title The Theory of Search Games and Rendezvous [electronic resource] /
title_short The Theory of Search Games and Rendezvous [electronic resource] /
title_full The Theory of Search Games and Rendezvous [electronic resource] /
title_fullStr The Theory of Search Games and Rendezvous [electronic resource] /
title_full_unstemmed The Theory of Search Games and Rendezvous [electronic resource] /
title_sort theory of search games and rendezvous [electronic resource] /
publisher Boston, MA : Springer US,
publishDate 2003
url http://dx.doi.org/10.1007/b100809
work_keys_str_mv AT alpernsteveauthor thetheoryofsearchgamesandrendezvouselectronicresource
AT galshmuelauthor thetheoryofsearchgamesandrendezvouselectronicresource
AT springerlinkonlineservice thetheoryofsearchgamesandrendezvouselectronicresource
AT alpernsteveauthor theoryofsearchgamesandrendezvouselectronicresource
AT galshmuelauthor theoryofsearchgamesandrendezvouselectronicresource
AT springerlinkonlineservice theoryofsearchgamesandrendezvouselectronicresource
_version_ 1756267890618662912
spelling KOHA-OAI-TEST:2038222018-07-30T23:31:54ZThe Theory of Search Games and Rendezvous [electronic resource] / Alpern, Steve. author. Gal, Shmuel. author. SpringerLink (Online service) textBoston, MA : Springer US,2003.engSearch Theory is one of the original disciplines within the field of Operations Research. It deals with the problem faced by a Searcher who wishes to minimize the time required to find a hidden object, or “target. ” The Searcher chooses a path in the “search space” and finds the target when he is sufficiently close to it. Traditionally, the target is assumed to have no motives of its own regarding when it is found; it is simply stationary and hidden according to a known distribution (e. g. , oil), or its motion is determined stochastically by known rules (e. g. , a fox in a forest). The problems dealt with in this book assume, on the contrary, that the “target” is an independent player of equal status to the Searcher, who cares about when he is found. We consider two possible motives of the target, and divide the book accordingly. Book I considers the zero-sum game that results when the target (here called the Hider) does not want to be found. Such problems have been called Search Games (with the “ze- sum” qualifier understood). Book II considers the opposite motive of the target, namely, that he wants to be found. In this case the Searcher and the Hider can be thought of as a team of agents (simply called Player I and Player II) with identical aims, and the coordination problem they jointly face is called the Rendezvous Search Problem.Search Games -- to Search Games -- Search Games in Compact Spaces -- General Framework -- Search for an Immobile Hider -- Search for a Mobile Hider -- Miscellaneous Search Games -- Search Games in Unbounded Domains -- General Framework -- On Minimax Properties of Geometric Trajectories -- Search on the Infinite Line -- Star and Plan Search -- Rendezvous Search -- to Rendezvous Search -- Elementary Results and Examples -- Rendezvous Search on Compact Spaces -- Rendezvous Values of a Compact Symmetric Region -- Rendezvous on Labeled Networks -- Asymmetric Rendezvous on an Unlabeled Circle -- Rendezvous on a Graph -- Rendezvous Search on Unbounded Domains -- Asymmetric Rendezvous on the Line (ARPL) -- Other Rendezvous Problems on the Line -- Rendezvous in Higher Dimensions.Search Theory is one of the original disciplines within the field of Operations Research. It deals with the problem faced by a Searcher who wishes to minimize the time required to find a hidden object, or “target. ” The Searcher chooses a path in the “search space” and finds the target when he is sufficiently close to it. Traditionally, the target is assumed to have no motives of its own regarding when it is found; it is simply stationary and hidden according to a known distribution (e. g. , oil), or its motion is determined stochastically by known rules (e. g. , a fox in a forest). The problems dealt with in this book assume, on the contrary, that the “target” is an independent player of equal status to the Searcher, who cares about when he is found. We consider two possible motives of the target, and divide the book accordingly. Book I considers the zero-sum game that results when the target (here called the Hider) does not want to be found. Such problems have been called Search Games (with the “ze- sum” qualifier understood). Book II considers the opposite motive of the target, namely, that he wants to be found. In this case the Searcher and the Hider can be thought of as a team of agents (simply called Player I and Player II) with identical aims, and the coordination problem they jointly face is called the Rendezvous Search Problem.Mathematics.Operations research.Decision making.Game theory.Calculus of variations.Probabilities.Economic theory.Mathematics.Calculus of Variations and Optimal Control; Optimization.Game Theory, Economics, Social and Behav. Sciences.Economic Theory/Quantitative Economics/Mathematical Methods.Probability Theory and Stochastic Processes.Operation Research/Decision Theory.Springer eBookshttp://dx.doi.org/10.1007/b100809URN:ISBN:9780306482120

Similar Items