This note provides a way to translate an n-person strategic game to a characteristic cooperative game assuming that the set of players of the cooperative game is the set of pure actions of the strategic game. The Core is characterized through coalitions generated with only one action for each...

In many economic situations, a player pursues coordination or anti-coordination with her neighbors on a network, but she also has intrinsic preferences among the available options. We here introduce a model which allows to analyze this issue by means of a simple framework in which players...

This paper constructs the equilibrium for a specific code that can be seen as a “universal grammar” in a class of common interest Sender–Receiver games where players communicate through a noisy channel. We propose a Senderʼs signaling strategy which does not depend on either the game...

This article shows the results of experiments where subjects play the Schelling’s spatial proximity model. Two types of experiments are conducted: one in which choices are made sequentially and a variation of the first where the decision making is simultaneous. The results of the...

We examine the interplay between a person's individual preference and the social influence others exert. We provide a model of network relationships with conflicting preferences, where individuals are better off coordinating with those around them, but not all prefer the same action. We test our...

This paper studies implementation of cooperative payoffs in finitely repeated games when players implement their strategies by finite automata of big sizes. Specifically, we analyze how much we have to depart from fully rational behavior to achieve the Folk Theorem payoffs, i.e., which are the...

This paper is a note in which we prove that Cellular Automata are suitable tools to model multi-agent interactive procedures. In particular, we apply the argument to validate results from simulation tools obtained for the classical model of segregation of Thomas Schelling (1971a).

The main contribution of this paper is to present a new procedure to reach cooperation through pseudorandom schemes in the finitely repeated Prisoner's Dilemma game, when strategies are implemented by automata. The equilibrium path consists of a communication process followed by a coordinated...