Results 221 to 230 of about 52,163 (250)

Sequent Calculi with Analytic Cut for Logics of Time and Knowledge with Perfect Recall

Lithuanian Mathematical Journal, 2004
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
exaly   +2 more sources

Perfect Recall on the Lernmatrix

2007
The Lernmatrix, which is the first known model of associative memory, is a hetereoassociative memory that presents the problem of incorrect pattern recall, even in the fundamental set, depending on the associations. In this work we propose a new algorithm and the corresponding theoretical support to improve the recalling capacity of the original model.
Israel Román-Godínez, Itzamá López-Yáñez, Cornelio Yáñez-Márquez   +2 more
openaire   +1 more source

Perfect recall of imperfect knowledge

Proceedings of the 13th Conference on Theoretical Aspects of Rationality and Knowledge, 2011
Perfect recall, intuitively the ability to remember all past mental states, has been predominantly studied in the context of interpreted systems and game theory, which mostly consider S5 systems (of "correct" knowledge). More recently, the notion has become of interest to the epistemic logic community, where weaker systems are not unusual.
openaire   +1 more source

On the Geometry of Perfect Recall

SSRN Electronic Journal, 2017
This paper investigates the relationship between the existence of equilibria in behavioral strategies, perfect recall, and notions of convexity in extensive form games. The central result is that players possess perfect recall if and only if their sets of behavioral strategies are behavioral convex, a novel generalized convexity condition.
openaire   +1 more source

On Games with Imperfect Recall and Games with Perfect Recall

SSRN Electronic Journal, 2014
In the context of finite extensive form games, we consider games of imperfect and perfect recall. We look briefly at the famous Kuhn theorem. However we are mainly concerned with imperfect recall games in which paths can intersect information sets in more than one node. Explicit examples are given to examine a number of issues.
openaire   +1 more source

ATL* With Truly Perfect Recall: Expressivity and Validities

2014
In alternating-time temporal logic ATL*, agents with perfect recall assign choices to sequences of states, i.e., to possible finite histories of the game. However, when a nested strategic modality is interpreted, the new strategy does not take into account the previous sequence of events. It is as if agents collect their observations in the nested game
Nils Bulling, Wojciech Jamroga, Matei Popovici   +2 more
openaire   +1 more source

Probabilistic Alternating-Time Temporal Logic of Incomplete Information and Synchronous Perfect Recall

Proceedings of the AAAI Conference on Artificial Intelligence, 2021
A probabilistic variant of ATL* logic is proposed to work with multi-player games of incomplete information and synchronous perfect recall. The semantics of the logic is settled over probabilistic interpreted system and partially observed probabilistic concurrent game structure.
Huang, Xiaowei, Su, Kaile, Zhang, Chenyi
openaire   +3 more sources

The Perfect Recalling Rate of Morphological Associative Memory

2006
Morphological associative memory is made up by replacing the sum of input signals by maximum or minimum operation. Ritter presented a procedure of associative memory, which utilizes associative memory matrix M and W sophisticatedly. This paper treats the recalling rate of associative memory. At first, conditions of perfect recalling are given. Then the
Ke Zhang, Sadayuki Murashima
openaire   +1 more source

On Money as a Substitute for Perfect Recall [PDF]

, 2001
In environments with no commitment and with a need for intertemporal trade, bounded recall is shown to be a sufficient friction for a receipt system (fiat money) to lead to improved allocations in an otherwise frictionless Walrasian model. The absence of other frictions makes price determination tractable, thus the model may be used for quantitative ...
Ted Temzelides, Jialin Yu
openaire  

Axioms for knowledge and time in distributed systems with perfect recall

Proceedings Ninth Annual IEEE Symposium on Logic in Computer Science, 2002
A distributed system, possibly asynchronous, is said to have perfect recall if at all times each processor's state includes a record of all its previous states. The completeness of a propositional modal logic of knowledge and time with respect to such systems is established.
openaire   +1 more source