Showing 1 - 4 of 4
whether a natural definition of a tree can be given, where nodes are sets of states. We show that, indeed, trees can be …
Persistent link: https://www.econbiz.de/10010292783
In a large family of solution concepts for boundedly rational players - allowing players to be imperfect optimizers, but requiring that better responses are chosen with probabilities at least as high as those of worse responses - most of Thompson's inessential transformations for the strategic...
Persistent link: https://www.econbiz.de/10010281206
We use an extensive form, universal type space to provide the following epistemic characterisation of extensive form rationalisability. Say that player i strongly believes event E if i is certain of E conditional on each of her information sets consistent with E. Our main contribution is to show...
Persistent link: https://www.econbiz.de/10011608489
polynomial-time solution algorithm to solve the problem on trees. The algorithm is based on dynamic programming and reveals the … be elaborately generated and relies on the theoretical results presented in this article. As a result, trees are the …
Persistent link: https://www.econbiz.de/10014501376