Please use this identifier to cite or link to this item:
Title: Infinite games with perfect information
Keywords: Determinacy, Effective Determinacy, Infinite Games, Games with Infinitely Many Players, Games with Perfect Information
Issue Date: 22-Dec-2006
Citation: ZHANG WENZHANG (2006-12-22). Infinite games with perfect information. ScholarBank@NUS Repository.
Abstract: This thesis studies infinite games with perfect information, i.e.,dynamic games in which players move sequentially. Chapter 1 introduces the subject. In Chapter 2 we consider the class of two-player perfect informationgames with characteristic payoff functions. We define a new solutionconcept for these games. The approach is axiomatic. We prove thedeterminacy for a whole class of perfect information games. In Chapter 3 we introduce infinite perfect-information games with aninfinite number of players. We also define a corresponding notion ofdeterminacy for these games. An application to a simple overlappinggeneration model predicts monetary equilibrium as the only outcomeof the economy. In Chapter 4 we consider an effective version of determinacy forinfinite games with perfect information by combining determinacywith the notion of computability by a Turing machine. We give acharacterization of the determinacy for the class of closed games.
Appears in Collections:Ph.D Theses (Open)

Show full item record
Files in This Item:
File Description SizeFormatAccess SettingsVersion 
thesis.pdf442.81 kBAdobe PDF



Page view(s)

checked on Oct 7, 2020


checked on Oct 7, 2020

Google ScholarTM


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