Verkauf durch Sack Fachmedien

Garnaev

Search Games and Other Applications of Game Theory

Medium: Buch
ISBN: 978-3-540-67195-4
Verlag: Springer Berlin Heidelberg
Erscheinungstermin: 06.05.2000
Lieferfrist: bis zu 10 Tage
This book is on applications of game theory. The title of this book is not "Game Theory and its Applications" because it does not construct a general theory for considered games. The book contains a lot of examples of applica­ tion of game theory together with the background of those games considered and a list of unsolved problems. Also we consider only the game where the optimal strategies of the players are found in closed form. This book is an attempt to carryon the approach developed in nice books "Search Games" by Gal and "Geometric Games and their Applications" by Ruckle. The first chapter of this book supplies the required definitions and theorems from game theory. The second chapter deals with discrete search games where both players act simultaneously: the games of protection of a channel from infiltration of a submarine, the submarine versus helicopter game, the matrix search games and others. The third chapter considers the game where the players allocate their contin­ uousefforts. In these games players face up an alternative either not to come into contest if the cost of efforts seems too high, or come into it. In the last case the player have to decide how much resources they can afford to spend. The allocation models of search, antiballistic protection and marketing are investigated.

Produkteigenschaften


  • Artikelnummer: 9783540671954
  • Medium: Buch
  • ISBN: 978-3-540-67195-4
  • Verlag: Springer Berlin Heidelberg
  • Erscheinungstermin: 06.05.2000
  • Sprache(n): Englisch
  • Auflage: 2000
  • Serie: Lecture Notes in Economics and Mathematical Systems
  • Produktform: Kartoniert, Paperback
  • Gewicht: 252 g
  • Seiten: 150
  • Format (B x H x T): 155 x 233 x 9 mm
  • Ausgabetyp: Kein, Unbekannt

Autoren/Hrsg.

Autoren

Garnaev, Andrey

1 Preliminary Results from Game Theory.- 1.1 Zero-sum Games.- 1.2 Non-zero-sum Games.- 2 Ambush Games.- 2.1 An Infiltration Game with a Cable.- 2.2 An Infiltration Game with Two Cables.- 2.3 Further Reading.- 2.4 Number Hides Game.- 2.5 Matrix Search Games.- 2.6 Helicopter Versus Submarine Game.- Problems.- 3 Allocation Games.- 3.1 One-Sided Allocation Game Without Search Cost.- 3.2 One-Sided Allocation Game with Search Cost.- 3.3 Further Reading.- 3.4 Two-Sided Allocation Game Without Search Cost.- 3.5 Two-Sided Allocation Game with Search Cost.- 3.6 A Non-Zero Sum Two-Sided Allocation Game.- 3.7 One Person Search Game.- 3.8 Marketing Games Without Taking into Acount Expenses.- 3.9 Marketing Games Taking into Acount Expenses.- Problems.- 4 Dynamic Infiltration and Inspection Games.- 4.1 A Multi—Stage Infiltration Game with a Bunker.- 4.2 A Multi—Stage Customs and Smuggler Game.- 4.3 Further Reading.- Problems.- 4.4 Inspection Game.- 4.5 Game with a Safe Zone, I.- 4.6 Game with a SafeZone, II.- 4.7 Game Without Safe Zone.- 4.8 Further Reading.- Problems.- 5 Games of Timing.- 5.1 Non-zero Sum Silent Duel.- 5.2 Non-zero Sum Noisy Duel.- 5.3 Non-zero Sum Silent-Noisy Duel.- 5.4 A Duel with Random Termination Time.- 5.5 A Noisy Duel with Random Termination Time.- 5.6 A Silent-Noisy Duel with Random Termination Time.- 5.7 A Duel over a Cake.- 5.8 R & D Game.- Problems.- 6 Parlour Games.- 6.1 Cover-up Game.- 6.2 Exchange Games.- 6.3 Poker Games.- 6.4 One-Person Games with a Threshold.- 6.5 Two-Person Games.