Individuals repeatedly face a multi-decision task with unknown payoff distributions. They have minimal memory and update their strategy by observing previous play (and not strategy) of someone else. We select behavior rules that increase average payoffs as often as possible in a large population...

We analyze the evolution of behavioral rules for learning how to play a two-armed bandit. Individuals have no information about the underlying pay-off distributions and have limited memory about their own past experience. Instead they must rely on information obtained trough observing the...

The effect that exogenous mistakes, made by players choosing their strategies, have on the dynamic stability for the replicator dynamic is analyzed for both asymmetric and symmetric normal form games. Through these perturbed games, the dynamic solution concept of limit asymptotic stability is...

There are only few "positive" results concerning multi-person games with the fictitious play property, that is, games in which every fictitious play process approaches the set of equilibria. In this paper we characterize classes of multi-person games with the fictitious play property. We...

The analysis of the replicator dynamic in generic perfect information games yields the following results. In the long run, players play a Nash equilibrium provided that initially all strategies are present. There is at most one ``stable'' component (formally, an interior asymptotically stable...

A model of a population with a Local Interaction structure is presented. Individuals interact with others in a given Inter- action neighborhood to obtain their payof. Individuals either imitate or else they die and are replaced by one of their neigh- bors in another neighborhood- the Propagation...

A network payoff function assigns a utility to all participants in a (social) network. In this paper we discuss properties of such network payoff functions that guarantee the existence of certain types of pairwise stable networks and the convergence of certain network formation processes. In...

In the present introductory work we propose an original analytical model of coopetitive game. We suggest possible general and feasible solutions; in particular, from a coopetitive perspective, we suggest compromise solutions - for our coopetitive game, by using Kalai-Smorodinsky method.

This paper studies network formation in settings where players are heterogeneous with respect to benefits as well as the costs of forming links. Our results demonstrate that centrality, center-sponsorship and short network diameter are robust features of equilibrium networks. We find that in a...