|Appears in Collections:||Computing Science and Mathematics Journal Articles|
|Peer Review Status:||Refereed|
|Title:||Backward Induction and Repeated Games With Strategy Constraints: An Inspiration From the Surprise Exam Paradox|
repeated game theory
surprise exam paradox
|Citation:||Li J, Vasilakos A & Kendall G (2013) Backward Induction and Repeated Games With Strategy Constraints: An Inspiration From the Surprise Exam Paradox, IEEE Transactions on Computational Intelligence and AI in Games, 5 (3), pp. 242-250.|
|Abstract:||Backward induction has led to some controversy in specific games, the surprise exam paradox and iterated prisoner’s dilemma for example, despite its wide use in solving finitely repeated games with complete information. In this paper, a typical misuse of backward induction is revealed by analyzing the surprise exam paradox, and the reason why backward induction may fail is investigated. The surprise exam paradox represents a set of repeated games with strategy constraints and has not been fully investigated in game theory. The agents in real-world activities always face constraints in decision making, for example, a budget limitation. In a repeated game with strategy constraints, the players’ choices in different stages are not independent and later choices depend on previous choices because of the strategy constraints. Backward induction cannot be applied in its normal use and it needs to be combined with Bayes’ theorem in solving these kinds of problems. We also investigate how the strategy constraints influence the equilibrium and show how to solve repeated games with strategy constraints by analyzing a repeated battle of the sexes game with a budget constraint.|
|Rights:||The publisher does not allow this work to be made publicly available in this Repository. Please use the Request a Copy feature at the foot of the Repository record to request a copy directly from the author. You can only request a copy if you wish to use this work for your own research or private study.|
|06514088.pdf||1.92 MB||Adobe PDF||Under Embargo until 31/12/2999 Request a copy|
Note: If any of the files in this item are currently embargoed, you can request a copy directly from the author by clicking the padlock icon above. However, this facility is dependant on the depositor still being contactable at their original email address.
This item is protected by original copyright
Items in the Repository are protected by copyright, with all rights reserved, unless otherwise indicated.
If you believe that any material held in STORRE infringes copyright, please contact firstname.lastname@example.org providing details and we will remove the Work from public display in STORRE and investigate your claim.