Kooperation im Gefangenen-Dilemma durch endogenes Lernen

Cooperation, Prisoner's Dilemma, evolutionary game theory, replicator dynamics, experimental economics, learning

Equilibrium play and best response to (Stated) beliefs in constant sum games

We report experimental results on one-shot two person 3x3 constant sum games played by non-economists without previous experience in the laboratory. Although strategically our games are very similar to previous experiments in which game theory predictions fail dramatically, 80% of actions taken in our experiment coincided with the prediction of the unique Nash equilibrium in pure strategies and 73% of actions were best responses to elicited beliefs. We argue how social preferences, presentation effects and belief elicitation procedures may influence how subjects play in simple but non trivial games and explain the diferences we observe with respect to previous work.

Personal relations and their effect on behavior in an organizational setting: an experimental study

We study how personal relations affect performance in organizations. In the experimental game we use a manager has to assign different degrees of decision power to two employees. These two employees then have to make distributive decisions which affect themselves and the manager. Our focus is on the effects on managers' assignment of decision power and on employees' distributive decisions of one of the employees and the manager knowing each other personally. Our evidence shows that managers tend to favor employees that they personally know and that these employees tend, more than other employees, to favor the manager in their distributive decisions. However, this behavior does not affect the performance of the employees that do not know the manager. All these effects are independent of whether the employees that know the manager are more or less productive than those who do not know the manager. The results shed light on discrimination and nepotism and its consequences for the performance of family firms and other organizations.

Coevolution of adaptive technology, maladaptive culture and population size in a producer-scrounger game.

Technology (i.e. tools, methods of cultivation and domestication, systems of construction and appropriation, machines) has increased the vital rates of humans, and is one of the defining features of the transition from Malthusian ecological stagnation to a potentially perpetual rising population growth. Maladaptations, on the other hand, encompass behaviours, customs and practices that decrease the vital rates of individuals. Technology and maladaptations are part of the total stock of culture carried by the individuals in a population. Here, we develop a quantitative model for the coevolution of cumulative adaptive technology and maladaptive culture in a 'producer-scrounger' game, which can also usefully be interpreted as an 'individual-social' learner interaction. Producers (individual learners) are assumed to invent new adaptations and maladaptations by trial-and-error learning, insight or deduction, and they pay the cost of innovation. Scroungers (social learners) are assumed to copy or imitate (cultural transmission) both the adaptations and maladaptations generated by producers. We show that the coevolutionary dynamics of producers and scroungers in the presence of cultural transmission can have a variety of effects on population carrying capacity. From stable polymorphism, where scroungers bring an advantage to the population (increase in carrying capacity), to periodic cycling, where scroungers decrease carrying capacity, we find that selection-driven cultural innovation and transmission may send a population on the path of indefinite growth or to extinction.

The genetical theory of social behaviour.

We survey the population genetic basis of social evolution, using a logically consistent set of arguments to cover a wide range of biological scenarios. We start by reconsidering Hamilton's (Hamilton 1964 J. Theoret. Biol. 7, 1-16 (doi:10.1016/0022-5193(64)90038-4)) results for selection on a social trait under the assumptions of additive gene action, weak selection and constant environment and demography. This yields a prediction for the direction of allele frequency change in terms of phenotypic costs and benefits and genealogical concepts of relatedness, which holds for any frequency of the trait in the population, and provides the foundation for further developments and extensions. We then allow for any type of gene interaction within and between individuals, strong selection and fluctuating environments and demography, which may depend on the evolving trait itself. We reach three conclusions pertaining to selection on social behaviours under broad conditions. (i) Selection can be understood by focusing on a one-generation change in mean allele frequency, a computation which underpins the utility of reproductive value weights; (ii) in large populations under the assumptions of additive gene action and weak selection, this change is of constant sign for any allele frequency and is predicted by a phenotypic selection gradient; (iii) under the assumptions of trait substitution sequences, such phenotypic selection gradients suffice to characterize long-term multi-dimensional stochastic evolution, with almost no knowledge about the genetic details underlying the coevolving traits. Having such simple results about the effect of selection regardless of population structure and type of social interactions can help to delineate the common features of distinct biological processes. Finally, we clarify some persistent divergences within social evolution theory, with respect to exactness, synergies, maximization, dynamic sufficiency and the role of genetic arguments.

Rational reasoning or adaptive behavior? Evidence from two-person beauty contest games

Many experiments have shown that human subjects do not necessarily behave in line with game theoretic assumptions and solution concepts. The reasons for this non-conformity are multiple. In this paper we study the argument whether a deviation from game theory is because subjects are rational, but doubt that others are rational as well, compared to the argument that subjects, in general, are boundedly rational themselves. To distinguish these two hypotheses, we study behavior in repeated 2-person and many-person Beauty-Contest-Games which are strategically different from one another. We analyze four different treatments and observe that convergence toward equilibrium is driven by learning through the information about the other player s choice and adaptation rather than self-initiated rational reasoning.

The evolution of punishment through reputation.

Punishment of non-cooperators has been observed to promote cooperation. Such punishment is an evolutionary puzzle because it is costly to the punisher while beneficial to others, for example, through increased social cohesion. Recent studies have concluded that punishing strategies usually pay less than some non-punishing strategies. These findings suggest that punishment could not have directly evolved to promote cooperation. However, while it is well established that reputation plays a key role in human cooperation, the simple threat from a reputation of being a punisher may not have been sufficiently explored yet in order to explain the evolution of costly punishment. Here, we first show analytically that punishment can lead to long-term benefits if it influences one's reputation and thereby makes the punisher more likely to receive help in future interactions. Then, in computer simulations, we incorporate up to 40 more complex strategies that use different kinds of reputations (e.g. from generous actions), or strategies that not only include punitive behaviours directed towards defectors but also towards cooperators for example. Our findings demonstrate that punishment can directly evolve through a simple reputation system. We conclude that reputation is crucial for the evolution of punishment by making a punisher more likely to receive help in future interactions, and that experiments investigating the beneficial effects of punishment in humans should include reputation as an explicit feature.

Vocal sib-sib interactions: how siblings adjust signaling level to each other

Game theory states that iterative interactions between individuals are necessary to adjust behaviour optimally to one another. Although our understanding of the role of begging signals in the resolution of parent-offspring conflict over parental investment rests on game theory implying repeated interactions between family members, empiricists usually consider interactions at the exact moment when parents allocate food among the brood. Therefore, the mechanisms by which siblings adjust signalling level to one another remain unclear. We tackled this issue in the barn owl, Tyto alba. In the absence of parents, hungry nestlings signal vocally to siblings their intention to contest vigorously the next, indivisible, food item. Such behaviour deters siblings from competing and begging when parents return to the nest. In experimental two-chick broods, nestlings producing the longest calls in the absence of parents, a signal of hunger level, were more successful at monopolizing the food item at the first parental feeding visit of the night. Moreover, nestlings increased (versus decreased) call duration when their sibling produced longer (versus shorter) calls, and an individual was more likely to call again if its sibling began to vocalize before or just after it had ended its previous call. These results are in agreement with the hypothesis that siblings challenge each other vocally to reinforce the honesty of sib-sib communication and to resolve conflicts over which individual will have priority of access to the next delivered food item. Siblings challenge each other vocally to confirm that the level of signalling accurately reflects motivation.

On the dimension of the core of the assignment game

The set of optimal matchings in the assignment matrix allows to define a reflexive and symmetric binary relation on each side of the market, the equal-partner binary relation. The number of equivalence classes of the transitive closure of the equal-partner binary relation determines the dimension of the core of the assignment game. This result provides an easy procedure to determine the dimension of the core directly from the entries of the assignment matrix and shows that the dimension of the core is not as much determined by the number of optimal matchings as by their relative position in the assignment matrix.

Single-valued solutions for the Böhm-Bawerk horse market game

Single-valued solutions for the case of two-sided market games without product differentiation, also known as Böhm-Bawerk horse market games, are analyzed. The nucleolus is proved to coincide with the tau-value, and is thus the midpoint of the core. Moreover a characterization of this setof games in terms of the assignment matrix is provided.

An axiomatization of the nucleolus of the assignment game

[cat] En el domini dels jocs bilaterals d’assignació, es presenta una axiomàtica del nucleolus com l´unica solució que compleix les propietats de consistència respecte del joc derivat definit per Owen (1992) i monotonia de les queixes dels sectors respecte de la seva cardinalitat. Com a conseqüència obtenim una caracterització geomètrica del nucleolus mitjançant una propietat de bisecció més forta que la que satisfan els punts del kernel (Maschler et al, 1979).

A note on the coincidence between Stackelberg and Nash equilibria in a differential game between government and firms

[cat] A Navas i Marín Solano es va demostrar la coincidència entre els equilibris de Nash i de Stackelberg per a una versi´o modificada del joc diferencial proposat por Lancaster (1973). Amb l’objectiu d’obtenir una solució interior, es van imposar restriccions importants sobre el valors dels paràmetres del model. En aquest treball estenem aquest resultat, en el límit en que la taxa de descompte és igual a zero, eliminant les restriccions i considerant totes les solucions possibles.

The assignment game: core bounds for mixed-pair coalitions

In the assignment game framework, we try to identify those assignment matrices in which no entry can be increased without changing the coreof the game. These games will be called buyer¿seller exact games and satisfy the condition that each mixed¿pair coalition attains the corresponding matrix entry in the core of the game. For a given assignment game, a unique buyerseller exact assignment game with the same core is proved to exist. In order to identify this matrix and to provide a characterization of those assignment games which are buyer¿seller exact in terms of the assignment matrix, attainable upper and lower core bounds for the mixed¿pair coalitions are found. As a consequence, an open question posed in Quint (1991) regarding a canonical representation of a ¿45o¿lattice¿ by means of the core of an assignment game can now be answered

The extreme core allocations of the assignment game

Although assignment games are hardly ever convex, in this paper a characterization of their set or extreme points of the core is provided, which is also valid for the class of convex games. For each ordering in the player set, a payoff vector is defined where each player receives his marginal contribution to a certain reduced game played by his predecessors. We prove that the whole set of reduced marginal worth vectors, which for convex games coincide with the usual marginal worth vectors, is the set of extreme points of the core of the assignment game

The extreme core allocations of the assignment game

Although assignment games are hardly ever convex, in this paper a characterization of their set or extreme points of the core is provided, which is also valid for the class of convex games. For each ordering in the player set, a payoff vector is defined where each player receives his marginal contribution to a certain reduced game played by his predecessors. We prove that the whole set of reduced marginal worth vectors, which for convex games coincide with the usual marginal worth vectors, is the set of extreme points of the core of the assignment game