A Computational study of strategy switching in large games [HBNI Th 40]

DSpace/Manakin Repository

A Computational study of strategy switching in large games [HBNI Th 40]

Show simple item record

dc.contributor.author Soumya Paul
dc.date.accessioned 2012-07-05T06:12:58Z
dc.date.available 2012-07-05T06:12:58Z
dc.date.issued 2012-07-05T06:12:58Z
dc.date.submitted 2012
dc.identifier.uri http://hdl.handle.net/123456789/315
dc.description.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. It is argued 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 dynamically 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. The notion of strategy switching in games is formally studied. en_US
dc.publisher.publisher
dc.subject Computaional Study en_US
dc.subject Games Strategy en_US
dc.subject Strategy Switching en_US
dc.title A Computational study of strategy switching in large games [HBNI Th 40] en_US
dc.type.degree Ph.D en_US
dc.type.institution HBNI en_US
dc.description.advisor Ramanujam, R.
dc.description.pages 194p. en_US
dc.type.mainsub Computer Science en_US

Files in this item

Files Size Format View
HBNI Th40.pdf 1.272Mb PDF View/Open

This item appears in the following Collection(s)

Show simple item record

Search DSpace


Advanced Search

Browse

My Account