Let µ be a rational distribution over a finite alphabet, and ( ) be a n-periodic sequences which first n elements are drawn i.i.d. according to µ. We consider automata of bounded size that input and output at stage t. We prove the existence of a constant C such that, whenever , with...

This paper presents a model of network formation with costly links. We endogenize the amount of cost born by each player involved in a bilateral link by considering that these shares result from bargaining. We analyze this feature in a context of coordination games. We show that, if the cost of...

This paper presents a model in which players interact via the formation of costly links and the benefits of bilateral interactions are determined by a coordination game. A novel contribution of this paper is that the fraction of the cost borne by each player involved in a bilateral link is not...