Secondly, by redefining a concept of rationality, we show that the common knowledge of the rationality characterizes the algorithm of Iterated Admissibility, ...
Abstract. Iterated dominance is perhaps the most basic principle in game theory. The epistemic foundation of this principle is based on.
Secondly, by redefining a concept of rationality, we show that the common knowledge of the rationality characterizes the algorithm of Iterated Admissibility, ...
Roughly speaking, our characterization shows that iterated admissibility captures the intuition that "all the agent knows" is that agents satisfy the ...
The main contribution of this paper is to characterize the algorithm of iterated admissibility in Probabilistic Epistemic Game Logic (PEGL). Firstly, on the ...
Apr 25, 2024 · https://dblp.org/rec/conf/lori/CuiGT09 · Jianying Cui, Meiyun Guo, Xiaojia Tang: Characterizations of Iterated Admissibility Based on PEGL.
Characterizations of iterated admissibility based on PEGL ... Iterated dominance is perhaps the most basic principle in game theory. The epistemic foundation of ...
Characterizations of iterated admissibility based on PEGL. Abstract: Iterated dominance is perhaps the most basic principle in game theory. The epistemic ...
May 29, 2020 · This characterization covers the "assumption of rationality" (of other players) part of the definition. Notice again that this requires to take ...
Missing: PEGL. | Show results with:PEGL.
https://dblp.org/rec/conf/lori/CuiGT09 · Jianying Cui, Meiyun Guo, Xiaojia Tang: Characterizations of Iterated Admissibility Based on PEGL. 76-89. view.