Markus Kinateder

Repeated Games Played in a Network

Delayed perfect monitoring in an infinitely repeated discounted game is modelled by allocating the players to a connected and undirected network. Players observe their immediate neighbors’ behavior only, but communicate over time the repeated game’s history truthfully throughout the network. The Folk Theorem extends to this setup, although for a range of discount factors strictly below 1, the set of sequential equilibria and the corresponding payoff set may be reduced. A general class of games is analyzed without imposing restrictions on the dimensionality of the payoff space. Due to this and the bilateral communication structure, truthful communication arises endogenously only under additional conditions. The model also produces a network result; namely, the level of cooperation in this setup depends on the network’s diameter, and not on its clustering coefficient as in other models.

Delayed perfect monitoring in repeated games

Delayed perfect monitoring in an infinitely repeated discounted game is studied. A player perfectly observes any other player’s action choice with a fixed and finite delay. The observational delays between different pairs of players are heterogeneous and asymmetric. The Folk theorem extends to this setup. As is shown for an example, for a range of discount factors, the set of perfect public equilibria is reduced under certain conditions and efficiency improves when the players take into account private information. This model applies to many situations in which there is a heterogeneous delay between information generation and the players’ reaction.

Sequential decisions in the Diamond-Dybvig banking model

We study the Diamond-Dybvig model of financial intermediation (JPE, 1983) under the assumption that depositors have information about previous decisions. Depositors decide sequentially whether to withdraw their funds or continue holding them in the bank. If depositors observe the history of all previous decisions, we show that there are no bank runs in equilibrium independently of whether the realized type vector selected by nature is of perfect or imperfect information.

The Repeated Prisoner’s Dilemma in a Network

Imperfect private monitoring in an infinitely repeated discounted Prisoner’s Dilemma played on a communication network is studied. Players observe their direct neighbors’ behavior only, but communicate strategically the repeated game’s history throughout the network. The delay in receiving this information requires the players to be more patient to sustain the same level of cooperation as in a complete network, although a Folk Theorem obtains when the players are patient enough. All equilibria under exogenously imposed truth-telling extend to strategic communication, and additional ones arise due to richer communication. There are equilibria in which a player lies. The flow of information is related with network centrality measures.

Would Depositors Like to Show Others that They Do Not Withdraw? Theory and Experiment

There is an asymmetry regarding what previous decisions depositors may observe when choosing whether to withdraw or keep the money deposited: it is more likely that withdrawals are observed. We study how decision-making changes if depositors are able to make their decision to keep their funds in the bank visible to subsequent depositors at a cost. We show theoretically in a Diamond-Dybvig setup that without this signaling option multiple equilibria are possible, while signaling makes the no-run outcome the unique equilibrium. We test if the theoretical predicitions hold in a lab experiment. We find that indeed when signaling is available, bank runs are less likely to arise and signaling is extensively used.

Team Formation in a Network

Two project leaders (or entrepreneurs) in a network, which captures social relations, recruit players in a strategic, competitive and time-limited process. Each team has an optimal size depending on the project’s quality. This is a random variable with a commonly known distribution. Only the corresponding project leader observes its realization. Any decision is only observed by the involved agents. The set of pure strategy Sequential Equilibria is characterized by giving an algorithm that selects one equilibrium at a time. An agent’s expected payoff is related to his position in the network, though no centrality measure in the literature captures this relation. A social planner frequently would achieve a higher welfare.