17 pages matching game is solvable in this book
Results 1-3 of 17
What people are saying - Write a review
We haven't found any reviews in the usual places.
Natural Games and Turing Machines
1 other sections not shown
2n+l act rationally Anderlini Anthony Horsley Ariel Rubinstein Avner Shaked behaviour best reply checking algorithm chooses a strategy Church's thesis construct solution machines Cutland defined demon dominant strategy Douglas Gale effectively denumerable Eric Maskin find a machine finite alphabet finite number finite sequence follows g is solvable g is strongly game g game is solvable Godel number Hence implements the checking information set input John Moore John Sutton Joseph Stiglitz Ken Binmore machine is rational Market mimics Monopolistic Competition Nash equilibrium natural game natural numbers Oliver Hart opposing machine optimal Partha Dasgupta payoff play a best procedurally rational machines published in Review Rafael Repullo rational number rational player set of machines set of natural set of rational solution concepts solvable games strategy choice strategy for player strong Nash strategy strongly Nash solvable subset substantive rationality Suppose g suppose the game symbols tape Theorem 13 universal Turing machine zn+i