Skip to Main Content
ASME Press Select Proceedings

International Conference on Instrumentation, Measurement, Circuits and Systems (ICIMCS 2011)

Chen Ming
Chen Ming
Search for other works by this author on:
No. of Pages:
ASME Press
Publication date:

In the process of seeking for game-theoretic solutions, players are supposed to be rational which means that they all tend to maximize their expected payoffs. However, there is no a definitely definition of rationality in game theory. Usual assumption of mutual knowledge of individual rationality to be common knowledge is coarse and maybe too strong, especially when the game is finite. The nested degree of interactive knowledge of individual rationality, in fact, is a fixed number which we will give out in this paper. In addition we modify two game-theoretic solution algorithms for the need of computer programming and formalize the special rationality conditions for each solution algorithm that we modified. On the other hand, we propose a feasible algorithm-solution which in correspondence with strong rationality. Moreover, we will show that iterated announcement of the rationality we defined could arrive exactly at the algorithm-solution, correspondingly.

This content is only available via PDF.
Close Modal
This Feature Is Available To Subscribers Only

Sign In or Create an Account

Close Modal
Close Modal