The Internet Archive has a preservation copy of this work in our general collections.
The file type is application/pdf
.
Proof-theoretic Analysis of Rationality for Strategic Games with Arbitrary Strategy Sets
[article]
2010
arXiv
pre-print
In the context of strategic games, we provide an axiomatic proof of the statement Common knowledge of rationality implies that the players will choose only strategies that survive the iterated elimination of strictly dominated strategies. Rationality here means playing only strategies one believes to be best responses. This involves looking at two formal languages. One is first-order, and is used to formalise optimality conditions, like avoiding strictly dominated strategies, or playing a best
arXiv:1006.4926v1
fatcat:4hfobhkfmncpxftlxkyq2ilj4y