We argue that trust can be incentivised by measures which increase the ability of trusters to protect themselves against risk. We work within the framework originally established by Berg, Dickhaut, and McCabe (1995) in which trust is measured experimentally as the ability to generate reciprocity...

We study how players learn to make decisions if they face many different games. Games are drawn randomly from a set of either two or six games in each of 100 rounds. If either there are few games or if extensive summary information is provided (or both) convergence to the unique Nash equilibrium...

This paper addresses the question of whether our evolutionary history suggests that humans are likely to be individually selected selfish maximizers or group selected altruists. It surveys models from the literature of evolutionary biology in which groups are formed and dissolved and where the...

This volume contains eight papers written by Adam Brandenburger and his co-authors over a period of 25 years. These papers are part of a program to reconstruct game theory in order to make how players reason about a game a central feature of the theory. The program — now called epistemic game...

Sufficient conditions for Nash equilibrium in an n-person game are given in terms of what the players know and believe — about the game, and about each other's rationality, actions, knowledge, and beliefs. Mixed strategies are treated not as conscious randomizations, but as conjectures, on the...

AbstractWe exhibit a large class of simple rules of behavior, which we call adaptive heuristics, and show that they generate rational behavior in the long run. These adaptive heuristics are based on natural regret measures, and may be viewed as a bridge between rational and behavioral...

AbstractHart and Mas-Colell (2000) show that if all players play “regret matching” strategies, i.e., they play with probabilities proportional to the regrets, then the empirical distribution of play converges to the set of correlated equilibria, and the regrets of every player converge to...

Suppose that each player in a game is rational, each player thinks the other players are rational, and so on. Also, suppose that rationality is taken to incorporate an admissibility requirement — that is, the avoidance of weakly dominated strategies. Which strategies can be played? We provide...

Game-theoretic analysis often leads to consideration of an infinite hierarchy of beliefs for each player. Harsanyi suggested that such a hierarchy of beliefs could be summarized in a single entity, called the player's type. This chapter provides an elementary construction, complementary to the...

AbstractWe study the question of how long it takes players to reach a Nash equilibrium in uncoupled setups, where each player initially knows only his own payoff function. We derive lower bounds on the communication complexity of reaching a Nash equilibrium, i.e., on the number of bits that need...