Please use this identifier to cite or link to this item:
Title: A computational study of strategy switching in large games
Researcher: Paul, Soumya
Guide(s): Jam
Keywords: switching
Mathematical Science
Upload Date: 24-Sep-2012
University: Homi Bhabha National Institute
Completed Date: n.d.
Abstract: The aim of this work is to study large games: games with a large number of players and/or with a large temporal, spatial or logical structure, using techniques from automata theory, logic and game theory. We argue that the traditional way of analysing games is not only unwieldy but also cannot be properly motivated for such games. As a lot of uncertainties are present in such a game, players usually do not strategise in a single go but do so dy- namically as they observe the outcomes of the game. They compose simple strategies to build more and more complex ones. They also employ several heuristic strategies. Switching between strategies forms a central part in such compositions. We formally study the notion of strategy switching in games. We start off by introducing strategy switching in a few classical games: extensive form, parity and Muller and explore the running time complex- ity of the algorithms that compute the winning strategy in these games. Switching strategies naturally comes with a cost and we explore repeated strategic form games where the players incur a cost on every strategy switch they make. We then give a logical foundation to strategy switching by players. We introduce a simple logic in which the composition of strategies by players can be described and formally studied. We study the eventual behaviour of games where the strategies of the players are specified in this logic. Dynamic strategising by players may lead to some actions being sparingly played by them. These actions then become too expensive to maintain in the arena and hence get removed. This in turn forces the players to change their strategies. The process is mutually recursive and leads to interesting dynamic phenomena. We study games which change dynamically and intrinsically as the play progresses and show that the eventual behaviour can be decided.We then study imitation as a heuristic strategy in games. We look at games where the players are divided into ?imitators? and optimisers?.
Pagination: 194p.
Appears in Departments:Department of Mathematical Sciences

Files in This Item:
File Description SizeFormat 
01_title.pdfAttached File68.22 kBAdobe PDFView/Open
02_certificate.pdf29.02 kBAdobe PDFView/Open
03_declaration.pdf20.36 kBAdobe PDFView/Open
04_abstract.pdf27.11 kBAdobe PDFView/Open
05_acknowledgements.pdf27.18 kBAdobe PDFView/Open
06_dedication.pdf17 kBAdobe PDFView/Open
07_contents.pdf45.04 kBAdobe PDFView/Open
08_list of figures.pdf65.78 kBAdobe PDFView/Open
09_chapter 1.pdf247.55 kBAdobe PDFView/Open
10_chapter 2.pdf194.76 kBAdobe PDFView/Open
11_chapter 3.pdf314.06 kBAdobe PDFView/Open
12_chapter 4.pdf268.35 kBAdobe PDFView/Open
13_chapter 5.pdf255.03 kBAdobe PDFView/Open
14_chapter 6.pdf219.49 kBAdobe PDFView/Open
15_chapter 7.pdf264.47 kBAdobe PDFView/Open
16_chapter 8.pdf134.02 kBAdobe PDFView/Open
17_bibliography.pdf82.28 kBAdobe PDFView/Open
18_summary.pdf93.37 kBAdobe PDFView/Open

Items in Shodhganga are protected by copyright, with all rights reserved, unless otherwise indicated.

Altmetric Badge: