Essays on Rationalizability
Tai‐Wei Hu, 胡台威
Abstract
Tai‐Wei Hu, 胡台威
Abstract
Three essays on rationalizability are included in this thesis. The first one concerns the main attempt of this solution concept --- to capture strategic implications of the common certainty of rationality. I show that the attempt is achieved in a sense with some technical conditions. The second one provides two extensions of rationalizability: (1) to strategic implications of common p-belief of rationality and (2) to games with incomplete information. Finally I show the robustness of rationalizable sets for strategic form games with or without complete information.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
Three essays on rationalizability are included in this thesis. The first one concerns the main attempt of this solution concept --- to capture strategic implications of the common certainty of rationality. I show that the attempt is achieved in a sense with some technical conditions. The second one provides two extensions of rationalizability: (1) to strategic implications of common p-belief of rationality and (2) to games with incomplete information. Finally I show the robustness of rationalizable sets for strategic form games with or without complete information.
Key concepts: Rationalizability, Rationality, Robustness (evolution), Mathematical economics, Certainty, Complete information, Solution concept, Computer science