scholarly journals Imperfect Recall: In So Many Words

2020 ◽  
Author(s):  
Tom Denlinger
Keyword(s):  
Imperfect Recall

scholarly journals Automated construction of bounded-loss imperfect-recall abstractions in extensive-form games

2020 ◽  
Vol 282 ◽  
pp. 103248
Author(s):  
Jiří Čermák ◽  
Viliam Lisý ◽  
Branislav Bošanský
Keyword(s):  
Extensive Form ◽  
Extensive Form Games ◽  
Imperfect Recall

Dynamic Consistency and Imperfect Recall

1997 ◽  
Vol 20 (1) ◽  
pp. 31-50 ◽  
Author(s):  
Pierpaolo Battigalli
Keyword(s):  
Dynamic Consistency ◽  
Imperfect Recall

scholarly journals ABSENT–MINDED DRIVERS IN THE LAB: TESTING GILBOA'S MODEL

2002 ◽  
Vol 04 (04) ◽  
pp. 435-448 ◽  
Author(s):  
STEFFEN HUCK ◽  
WIELAND MÜLLER
Keyword(s):  
Experimental Economics ◽  
Strong Support ◽  
Point Of View ◽  
Decision Problems ◽  
Agent Based ◽  
Standard Methods ◽  
Imperfect Recall ◽  
Ex Ante ◽  
Empirical Point

This note contributes to the discussion of decision problems with imperfect recall from an empirical point of view. We argue that, using standard methods of experimental economics, it is impossible to induce (or control for) absent–mindedness of subjects. Nevertheless, it is possible to test Gilboa's (1997) agent–based approach to games with imperfect recall. We implement his model of the absent–minded driver problem in an experiment and find, if subjects are repeatedly randomly rematched, strong support for the equilibrium prediction which coincides with Piccione and Rubinstein's (1997) ex ante solution of the driver's problem.

scholarly journals Probabilistic Strategy Logic

2019 ◽  
Author(s):  
Benjamin Aminof ◽  
Marta Kwiatkowska ◽  
Bastien Maubert ◽  
Aniello Murano ◽  
Sasha Rubin
Keyword(s):  
Model Checking ◽  
Nash Equilibria ◽  
Stochastic Systems ◽  
Solution Concepts ◽  
Imperfect Recall ◽  
Double Exponential ◽  
Temporal Operator ◽  
Standard Solution ◽  
Strategy Logic ◽  
Exponential Space

We introduce Probabilistic Strategy Logic, an extension of Strategy Logic for stochastic systems. The logic has probabilistic terms that allow it to express many standard solution concepts, such as Nash equilibria in randomised strategies, as well as constraints on probabilities, such as independence. We study the model-checking problem for agents with perfect- and imperfect-recall. The former is undecidable, while the latter is decidable in space exponential in the system and triple-exponential in the formula. We identify a natural fragment of the logic, in which every temporal operator is immediately preceded by a probabilistic operator, and show that it is decidable in space exponential in the system and the formula, and double-exponential in the nesting depth of the probabilistic terms. Taking a fixed nesting depth, this gives a fragment that still captures many standard solution concepts, and is decidable in exponential space.

Sign in / Sign up

Export Citation Format

Share Document