Bounded Computational Capacity Equilibrium

Details Bounded Computational Capacity Equilibrium Bounded Computational Capacity Equilibrium

2010-08-16

arxiv.org/abs/1008.2632v1

Mathematics

Probability

Scientific paper

We study repeated games played by players with bounded computational power, where, in contrast to Abreu and Rubisntein (1988), the memory is costly. We prove a folk theorem: the limit set of equilibrium payoffs in mixed strategies, as the cost of memory goes to 0, includes the set of feasible and individually rational payoffs. This result stands in sharp contrast to Abreu and Rubisntein (1988), who proved that when memory is free, the set of equilibrium payoffs in repeated games played by players with bounded computational power is a strict subset of 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.

Affiliated with

Also associated with

No associations

Rating

Bounded Computational Capacity Equilibrium does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Bounded Computational Capacity Equilibrium, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Bounded Computational Capacity Equilibrium will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-177443