The theory of search games and rendezvous:
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Book |
| Language: | English |
| Published: |
Boston [u.a.]
Kluwer
2003
|
| Series: | International series in operations research and management science
55 |
| Subjects: | |
| Online Access: | Inhaltsverzeichnis |
| Physical Description: | XIV, 319 S. graph. Darst. |
| ISBN: | 0792374681 |
Staff View
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV025518354 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t | ||
| 008 | 100417s2003 d||| |||| 00||| eng d | ||
| 015 | |a GBA309862 |2 dnb | ||
| 020 | |a 0792374681 |9 0-7923-7468-1 | ||
| 035 | |a (OCoLC)249141740 | ||
| 035 | |a (DE-599)BVBBV025518354 | ||
| 040 | |a DE-604 |b ger |e rakwb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-11 | ||
| 082 | 0 | |a 003 | |
| 084 | |a SK 970 |0 (DE-625)143276: |2 rvk | ||
| 100 | 1 | |a Alpern, Steve |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a The theory of search games and rendezvous |c by Steve Alpern ; Shmuel Gal |
| 264 | 1 | |a Boston [u.a.] |b Kluwer |c 2003 | |
| 300 | |a XIV, 319 S. |b graph. Darst. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a International series in operations research and management science |v 55 | |
| 650 | 0 | 7 | |a Suchtheorie |0 (DE-588)4233396-9 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Spieltheorie |0 (DE-588)4056243-8 |2 gnd |9 rswk-swf |
| 655 | 7 | |0 (DE-588)4151278-9 |a Einführung |2 gnd-content | |
| 689 | 0 | 0 | |a Suchtheorie |0 (DE-588)4233396-9 |D s |
| 689 | 0 | 1 | |a Spieltheorie |0 (DE-588)4056243-8 |D s |
| 689 | 0 | |5 DE-604 | |
| 700 | 1 | |a Gal, Shmul |e Verfasser |4 aut | |
| 830 | 0 | |a International series in operations research and management science |v 55 |w (DE-604)BV011630976 |9 55 | |
| 856 | 4 | 2 | |m GBV Datenaustausch |q application/pdf |u http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=020127199&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |3 Inhaltsverzeichnis |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-020127199 | ||
Record in the Search Index
| _version_ | 1804142694056853504 |
|---|---|
| adam_text | THE THEORY OF SEARCH GAMES AND RENDEZVOUS BY STEVE ALPERN LONDON SCHOOL
OF ECONOMICS, UK SHMUEL GAL UNIVERSITY OF HAIFA, ISRAEL (IN ALPHABETICAL
ORDER) KLUWER ACADEMIC PUBLISHERS BOSTON / DORDRECHT / LONDON CONTENTS
PREFACE XI FREQUENTLY USED NOTATIONS XIII ACKNOWLEDGMENT XV BOOK I
SEARCH GAMES 1 INTRODUCTION TO SEARCH GAMES 3 PART ONE SEARCH GAMES IN
COMPACT SPACES 7 2 GENERAL FRAMEWORK 9 3 SEARCH FOR AN IMMOBILE HIDER 13
3.1 INTRODUCTION 13 3.2 SEARCH IN A NETWORK 17 3.3 SEARCH ON A TREE 21
3.4 WHEN IS THE RANDOM CHINESE POSTMAN TOUR OPTIMAL? 25 3.4.1 SEARCHING
WEAKLY CYCLIC NETWORKS 25 3.4.2 SEARCHING WEAKLY EULERIAN NETWORKS 27
3.5 SIMPLE NETWORKS REQUIRING COMPLICATED STRATEGIES 31 3.6 USING
DYNAMIC PROGRAMMING FOR FINDING OPTIMAL RESPONSE SEARCH TRAJECTORIES 36
3.7 SEARCH IN A MULTIDIMENSIONAL REGION 39 3.7.1 INHOMOGENEOUS SEARCH
SPACES 42 4 SEARCH FOR A MOBILE HIDER 45 4.1 INTRODUCTION 45 4.2 SEARCH
ON K ARCS 48 4.3 SEARCH ON A CIRCLE 52 4.4 QUICKLY SEARCHED NETWORKS 53
4.4.1 THE FIGURE EIGHT NETWORK 55 4.5 THE PRINCESS AND THE MONSTER IN
TWO DIMENSIONS 58 4.5.1 GENERAL FRAMEWORK 58 4.5.2 STRATEGY OF THE
SEARCHER 59 4.5.3 STRATEGY OF THE HIDER 67 VI CONTENTS 4.6 MODIFICATIONS
AND EXTENSIONS 73 4.6.1 A NON-LOCALIZED SEARCH STRATEGY 73 4.6:2
SEARCH IN NON-CONVEX REGIONS 74 4.6.3 MULTIDIMENSIONAL EXTENSIONS 74
4.6.4 THE CASE OF SEVERAL SEARCHERS 74 4.6.5 THE CASE OF AN ARBITRARY
STARTING POINT 75 4.6.6 LOITERING STRATEGIES 75 4.6.7 NON-HOMOGENEOUS
SEARCH SPACES 75 4.6.8 A GENERAL COST FUNCTION 76 5 MISCELLANEOUS SEARCH
GAMES 79 5.1 SEARCH IN A MAZE 79 5.2 HIGH-LOW SEARCH 84 5.2.1 CONTINUOUS
HIGH-LOW SEARCH 84 5.2.2 ECONOMIC APPLICATIONS 89 5.2.3 DISCRETE
HIGH-LOW SEARCH 91 5.3 INFILTRATION GAMES 92 5.4 SEARCHING IN DISCRETE
LOCATIONS 95 PART TWO SEARCH GAMES IN UNBOUNDED DOMAINS 99 6 GENERAL
FRAMEWORK 101 6.1 ONE-DIMENSIONAL SEARCH GAMES * 101 6.2
MULTIDIMENSIONAL SEARCH GAMES 104 7 ON MINIMAX PROPERTIES OF GEOMETRIC
TRAJECTORIES 107 7.1 INTRODUCTION 107 7.2 MINIMAX THEOREMS 109 7.2.1
MINIMAX THEOREMS FOR THE CONTINUOUS CASE 116 7.3 UNIQUENESS OF THE
MINIMAX STRATEGY 117 8 SEARCH ON THE INFINITE LINE 123 8.1 INTRODUCTION
123 8.2 THE LINEAR SEARCH PROBLEM AS A SEARCH GAME 124 8.2.1 THE MINIMAX
SEARCH TRAJECTORY 126 8.2.2 MINIMAX TRAJECTORY ON A HALF-LINE 128 8.3
OPTIMAL STRATEGIES 129 8.4 SEARCH WITH A TURNING COST 132 8.5 SEARCH FOR
A MOVING HIDER 134 8.6 SEARCH WITH UNCERTAIN DETECTION 137 8.6.1 SEARCH
WITH A DELAY 138 8.6.2 GEOMETRIC DETECTION PROBABILITY 139 8.7 A DYNAMIC
PROGRAMMING ALGORITHM FOR THE LSP 139 9 STAR AND PLAN SEARCH 145 9.1
INTRODUCTION 145 CONTENTS VII 9.2 STAR SEARCH 145 9.3 SEARCH ON THE
BOUNDARY OF A REGION 154 9.4 SEARCH FOR A POINT IN THE PLANE 157 9.5
SWIMMING IN A FOG PROBLEMS 159 9.6 SEARCHING FOR A SUBMARINE WITH A
KNOWN INITIAL LOCATION 161 BOOK II RENDEZVOUS THEORY 10 INTRODUCTION TO
RENDEZVOUS SEARCH 165 10.1 RELATION TO COORDINATION GAMES 167 10.2
REAL-LIFE RENDEZVOUS 168 10.3 RENDEZVOUS STRATEGIES 170 10.4 OUTLINE OF
BOOK II 171 11 ELEMENTARY RESULTS AND EXAMPLES 173 11.1 SYMMETRIC
RENDEZVOUS ON THE LINE 173 11.2 MULTI-RENDEZVOUS ON THE CIRCLE 175 11.3
FOCAL STRATEGIES ON THE LINE 176 11.4 RENDEZVOUS IN TWO CELLS 177 PART
THREE RENDEZVOUS SEARCH ON COMPACT SPACES 179 12 RENDEZVOUS VALUES OF A
COMPACT SYMMETRIC REGION 181 12.1 PLAYER SYMMETRY 182 12.2 SPATIAL
SYMMETRY 182 12.3 AN EXAMPLE: THE CIRCLE 184 12.4 THE ASYMMETRIC
RENDEZVOUS VALUE R A 185 12.5 THE SYMMETRIC RENDEZVOUS VALUE R S 187
12.6 PROPERTIES OF OPTIMAL STRATEGIES AND RENDEZVOUS VALUES 188 13
RENDEZVOUS ON LABELED NETWORKS 191 13.1 NETWORKS AND H-NETWORKS 191 13.2
RENDEZVOUS ON H-NETWORKS 193 13.3 THE INTERVAL H-NETWORK 197 13.3.1
NONDECREASING INITIAL DISTRIBUTIONS 198 13.4 THE CIRCLE AND THE CIRCLE
H-NETWORK 201 13.4.1 SYMMETRIC RENDEZVOUS ON THE LABELED CIRCLE 201
13.4.2 ASYMMETRIC RENDEZVOUS ON THE LABELED CIRCLE 204 14 ASYMMETRIC
RENDEZVOUS ON AN UNLABELED CIRCLE 205 14.1 ONE-SIDED SEARCH ON THE
CIRCLE 208 14.2 ASYMMETRIC RENDEZVOUS ON A DIRECTED CIRCLE 211 14.3
ASYMMETRIC RENDEZVOUS ON AN UNDIRECTED CIRCLE: FORMALIZATION .... 213
14.4 ALTERNATING SEARCH ON TWO CIRCLES 215 14.5 OPTIMAL RENDEZVOUS ON
THE UNDIRECTED CIRCLE 217 14.5.1 MONOTONE DENSITIES 218 VIII CONTENTS
14.5.2 SLOWLY VARYING DENSITIES 220 14.5.3 ARBITRARY DISTRIBUTIONS 221
15 RENDEZVOUS ON A GRAPH 223 15.1 ASYMMETRIC RENDEZVOUS 225 15.2
SYMMETRIC RENDEZVOUS 227 15.3 SYMMETRIC RENDEZVOUS ON A COMPLETE GRAPH
227 15.3.1 REVEALED ACTIONS 230 15.4 SYMMETRIC SEARCH ON C N 231 15.4.1
SYMMETRIC MARKOVIAN STRATEGIES 231 PART FOUR RENDEZVOUS SEARCH ON
UNBOUNDED DOMAINS 235 16 ASYMMETRIC RENDEZVOUS ON THE LINE (ARPL) 237
16.1 ASYMMETRIC RENDEZVOUS VALUE R A (F) 238 16.2 FINITENESSOF/? A (F)
240 16.3 THE DOUBLE LINEAR SEARCH PROBLEM (DLSP) 241 16.4
MEETING-PROBABILITY MAXIMIZATION 242 16.5 ATOMIC DISTRIBUTION 243 16.6
DISCRETE DISTRIBUTIONS 246 16.7 ARBITRARY DISTRIBUTIONS 247 16.8 CONVEX
DISTRIBUTIONS 248 17 OTHER RENDEZVOUS PROBLEMS ON THE LINE 251 17.1
UNEQUAL SPEEDS 252 17.2 PLAYER SYMMETRY 254 17.3 BOUNDED RESOURCES *.
256 17.3.1 EXPECTED TIME MINIMIZATION FOR 3A + 5B 15D 256 17.3.2
PROBABILITY MAXIMIZATION 259 17.4 UNKNOWN INITIAL DISTRIBUTION 264
17.4.1 ASYMMETRIC STRATEGIES 264 17.4.2 SYMMETRIC STRATEGIES 267 17.5
MULTIPLAYER RENDEZVOUS 267 17.5.1 EXPECTED TIME MINIMIZATION 268 17.5.2
MAXIMUM TIME MINIMIZATION 270 17.6 ASYMMETRIC INFORMATION 273 18
RENDEZVOUS IN HIGHER DIMENSIONS 277 18.1 ASYMMETRIC RENDEZVOUS ON A
PLANAR LATTICE 277 18.2 THE N-DIMENSIONAL LATTICE Z 284 18.2.1
ASYMMETRIC RENDEZVOUS 284 18.2.2 SYMMETRIC RENDEZVOUS 286 18.3
CONTINUOUS RENDEZVOUS IN THE PLANE 288 18.3.1 COMMON NOTION OF DIRECTION
288 18.3.2 ASYMMETRIC INFORMATION 289 18.3.3 ASYMMETRIC SPEED AND
DETECTION RADIUS 290 CONTENTS IX APPENDICES A A MINIMAX THEOREM FOR
ZERO-SUM GAMES 291 B THEORY OF ALTERNATING SEARCH 295 B.I ARBITRARY
REGIONS 297 C RENDEZVOUS-EVASION PROBLEMS 299 BIBLIOGRAPHY 303 INDEX 317
|
| any_adam_object | 1 |
| author | Alpern, Steve Gal, Shmul |
| author_facet | Alpern, Steve Gal, Shmul |
| author_role | aut aut |
| author_sort | Alpern, Steve |
| author_variant | s a sa s g sg |
| building | Verbundindex |
| bvnumber | BV025518354 |
| classification_rvk | SK 970 |
| ctrlnum | (OCoLC)249141740 (DE-599)BVBBV025518354 |
| dewey-full | 003 |
| dewey-hundreds | 000 - Computer science, information, general works |
| dewey-ones | 003 - Systems |
| dewey-raw | 003 |
| dewey-search | 003 |
| dewey-sort | 13 |
| dewey-tens | 000 - Computer science, information, general works |
| discipline | Informatik Mathematik |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01617nam a2200409 cb4500</leader><controlfield tag="001">BV025518354</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">100417s2003 d||| |||| 00||| eng d</controlfield><datafield tag="015" ind1=" " ind2=" "><subfield code="a">GBA309862</subfield><subfield code="2">dnb</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">0792374681</subfield><subfield code="9">0-7923-7468-1</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)249141740</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV025518354</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-11</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">003</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">SK 970</subfield><subfield code="0">(DE-625)143276:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Alpern, Steve</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">The theory of search games and rendezvous</subfield><subfield code="c">by Steve Alpern ; Shmuel Gal</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Boston [u.a.]</subfield><subfield code="b">Kluwer</subfield><subfield code="c">2003</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">XIV, 319 S.</subfield><subfield code="b">graph. Darst.</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="1" ind2=" "><subfield code="a">International series in operations research and management science</subfield><subfield code="v">55</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Suchtheorie</subfield><subfield code="0">(DE-588)4233396-9</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Spieltheorie</subfield><subfield code="0">(DE-588)4056243-8</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="655" ind1=" " ind2="7"><subfield code="0">(DE-588)4151278-9</subfield><subfield code="a">Einführung</subfield><subfield code="2">gnd-content</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Suchtheorie</subfield><subfield code="0">(DE-588)4233396-9</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="1"><subfield code="a">Spieltheorie</subfield><subfield code="0">(DE-588)4056243-8</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Gal, Shmul</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">International series in operations research and management science</subfield><subfield code="v">55</subfield><subfield code="w">(DE-604)BV011630976</subfield><subfield code="9">55</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="m">GBV Datenaustausch</subfield><subfield code="q">application/pdf</subfield><subfield code="u">http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=020127199&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA</subfield><subfield code="3">Inhaltsverzeichnis</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-020127199</subfield></datafield></record></collection> |
| genre | (DE-588)4151278-9 Einführung gnd-content |
| genre_facet | Einführung |
| id | DE-604.BV025518354 |
| illustrated | Illustrated |
| indexdate | 2024-07-09T22:35:50Z |
| institution | BVB |
| isbn | 0792374681 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-020127199 |
| oclc_num | 249141740 |
| open_access_boolean | |
| owner | DE-11 |
| owner_facet | DE-11 |
| physical | XIV, 319 S. graph. Darst. |
| publishDate | 2003 |
| publishDateSearch | 2003 |
| publishDateSort | 2003 |
| publisher | Kluwer |
| record_format | marc |
| series | International series in operations research and management science |
| series2 | International series in operations research and management science |
| spelling | Alpern, Steve Verfasser aut The theory of search games and rendezvous by Steve Alpern ; Shmuel Gal Boston [u.a.] Kluwer 2003 XIV, 319 S. graph. Darst. txt rdacontent n rdamedia nc rdacarrier International series in operations research and management science 55 Suchtheorie (DE-588)4233396-9 gnd rswk-swf Spieltheorie (DE-588)4056243-8 gnd rswk-swf (DE-588)4151278-9 Einführung gnd-content Suchtheorie (DE-588)4233396-9 s Spieltheorie (DE-588)4056243-8 s DE-604 Gal, Shmul Verfasser aut International series in operations research and management science 55 (DE-604)BV011630976 55 GBV Datenaustausch application/pdf http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=020127199&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA Inhaltsverzeichnis |
| spellingShingle | Alpern, Steve Gal, Shmul The theory of search games and rendezvous International series in operations research and management science Suchtheorie (DE-588)4233396-9 gnd Spieltheorie (DE-588)4056243-8 gnd |
| subject_GND | (DE-588)4233396-9 (DE-588)4056243-8 (DE-588)4151278-9 |
| title | The theory of search games and rendezvous |
| title_auth | The theory of search games and rendezvous |
| title_exact_search | The theory of search games and rendezvous |
| title_full | The theory of search games and rendezvous by Steve Alpern ; Shmuel Gal |
| title_fullStr | The theory of search games and rendezvous by Steve Alpern ; Shmuel Gal |
| title_full_unstemmed | The theory of search games and rendezvous by Steve Alpern ; Shmuel Gal |
| title_short | The theory of search games and rendezvous |
| title_sort | the theory of search games and rendezvous |
| topic | Suchtheorie (DE-588)4233396-9 gnd Spieltheorie (DE-588)4056243-8 gnd |
| topic_facet | Suchtheorie Spieltheorie Einführung |
| url | http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=020127199&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |
| volume_link | (DE-604)BV011630976 |
| work_keys_str_mv | AT alpernsteve thetheoryofsearchgamesandrendezvous AT galshmul thetheoryofsearchgamesandrendezvous |