Learning by imitation

Cataloged from PDF version of article.This paper introduces a learning algorithm that allows for imitation in recursive dynamic games. The Kiyotaki-Wright model of money is a well-known example of such decision environments. In this context, learning by experience has been studied before. Here, we introduce imitation as an additional channel for learning. In numerical simulations, we observe that the presence of imitation either speeds up social convergence to the theoretical Markov-Nash equilibrium or leads every agent of the same type to the same mode of suboptimal behavior. We observe an increase in the probability of convergence to equilibrium, as the incentives for optimal play become more pronounced

A low-power network search engine based on statistical partitioning

Network search engines based on Ternary CAMs are widely used in routers. However, due to parallel search nature of TCAMs power consumption becomes a critical issue. In this work we propose an architecture that partitions the lookup table into multiple TCAM chips based on individual TCAM cell status and achieves lower power figures