Bounded computational capacity equilibrium

Bounded computational capacity equilibrium

DSpace Repository

Bounded computational capacity equilibrium

Show full item record

View       (583.9Kb)

Hernández, Penélope; Solan, Eilon
This document is a artículoDate2014

Este documento está disponible también en :
A celebrated result of Abreu and Rubinstein states that in repeated games, when the players are restricted to playing strategies that can be implemented by finite automata and they have lexicographic preferences, the set of equilibrium payoffs is a strict subset of the set of feasible and individually rational payoffs. In this paper we explore the limitations of this result. We prove that if memory size is costly and players can use mixed automata, then a folk theorem obtains and the set of equilibrium payoff is once again the set of feasible and individually rational payoffs. Our result emphasizes the role of memory cost and of mixing when players have bounded computational power.

    Hernández, Penélope Solan, Eilon 2014 Bounded computational capacity equilibrium Working papers ERI-CES 03/2014

This item appears in the following Collection(s)

Show full item record

Search DSpace

Advanced Search