scholarly journals Folk Theorems with Bounded Recall Under (Almost) Perfect Monitoring

2008 ◽  
Author(s):  
George J. Mailath ◽  
Wojciech Olszewski
Keyword(s):  
Folk Theorems ◽  
Bounded Recall ◽  
Perfect Monitoring

scholarly journals Folk theorems with bounded recall under (almost) perfect monitoring

2011 ◽  
Vol 71 (1) ◽  
pp. 174-192 ◽  
Author(s):  
George J. Mailath ◽  
Wojciech Olszewski
Keyword(s):  
Folk Theorems ◽  
Bounded Recall ◽  
Perfect Monitoring

scholarly journals Estimating Dynamic Games of Electoral Competition to Evaluate Term Limits in US Gubernatorial Elections

2017 ◽  
Vol 107 (7) ◽  
pp. 1824-1857 ◽  
Author(s):  
Holger Sieg ◽  
Chamna Yoon
Keyword(s):  
Political Economy ◽  
Empirical Analysis ◽  
Dynamic Games ◽  
Electoral Competition ◽  
Term Limits ◽  
Relative Importance ◽  
Political Candidates ◽  
Trade Off ◽  
Perfect Monitoring ◽  
The Empirical Analysis

This paper shows how to identify and estimate, using standard semi-parametric techniques, a class of dynamic games with perfect monitoring, that have been at the frontier of recent research in political economy. The empirical analysis provides novel quantitative insights into the trade-off that voters face between ideology and ability, the differences in ability and ideology among parties and states, and the differences in preferences between political candidates and voters. We analyze the consequences of term limits and quantify their relative importance. Specifically, we characterize conditions under which term limits improve voters' welfare. (JEL C57, C73, D72)

scholarly journals Model Checking Temporal Epistemic Logic under Bounded Recall

2020 ◽  
Vol 34 (05) ◽  
pp. 7071-7078
Author(s):  
Francesco Belardinelli ◽  
Alessio Lomuscio ◽  
Emily Yu
Keyword(s):  
Model Checking ◽  
Incomplete Information ◽  
Epistemic Logic ◽  
Upper Bounds ◽  
Experimental Results ◽  
Model Checker ◽  
Multi Agent Systems ◽  
Agent Systems ◽  
Multi Agent ◽  
Bounded Recall

We study the problem of verifying multi-agent systems under the assumption of bounded recall. We introduce the logic CTLKBR, a bounded-recall variant of the temporal-epistemic logic CTLK. We define and study the model checking problem against CTLK specifications under incomplete information and bounded recall and present complexity upper bounds. We present an extension of the BDD-based model checker MCMAS implementing model checking under bounded recall semantics and discuss the experimental results obtained.

scholarly journals Uniform folk theorems in repeated anonymous random matching games

2016 ◽  
Vol 100 ◽  
pp. 1-23 ◽  
Author(s):  
Joyee Deb ◽  
Julio González-Díaz ◽  
Jérôme Renault
Keyword(s):  
Random Matching ◽  
Matching Games ◽  
Folk Theorems

On composition of bounded-recall plans

2020 ◽  
Vol 289 ◽  
pp. 103399
Author(s):  
Kaya Deuser ◽  
Pavel Naumov
Keyword(s):  
Bounded Recall
Sign in / Sign up

Export Citation Format

Share Document