An information theoretic representation of agent dynamics as set intersections

Authors:
Samuel Epstein;Margrit Betke
Affiliations:
Boston University, Boston, MA;Boston University, Boston, MA
Venue:
AGI'11 Proceedings of the 4th international conference on Artificial general intelligence
Year:
2011

Citing 7
Cited 0

Elements of information theory

Elements of information theory
Universal Artificial Intelligence: Sequential Decisions Based On Algorithmic Probability

Universal Artificial Intelligence: Sequential Decisions Based On Algorithmic Probability
Artificial General Intelligence (Cognitive Technologies)

Artificial General Intelligence (Cognitive Technologies)
An Introduction to Kolmogorov Complexity and Its Applications

An Introduction to Kolmogorov Complexity and Its Applications
Artificial Intelligence: A Modern Approach

Artificial Intelligence: A Modern Approach
Rate distortion and denoising of individual data using Kolmogorov complexity

IEEE Transactions on Information Theory
Algorithmic statistics

IEEE Transactions on Information Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

We represent agents as sets of strings. Each string encodes a potential interaction with another agent or environment. We represent the total set of dynamics between two agents as the intersection of their respective strings, we prove complexity properties of player interactions using Algorithmic Information Theory. We show how the proposed construction is compatible with Universal Artificial Intelligence, in that the AIXI model can be seen as universal with respect to interaction.