Many markets without repeated seller–buyer relations feature third-party “monitors” that sell recommendations. We analyze the profit-maximizing recommendation policies of such monitors. In an infinitely repeated game with seller moral hazard and short-lived consumers, a monopolistic...

I consider repeated games on a network where players interact and communicate with their neighbors. At each stage, players choose actions and exchange private messages with their neighbors. The payoff of a player depends only on his own action and on the actions of his neighbors. At the end of...

A minimal requirement on allocative efficiency in the social sciences is Pareto optimality. In this paper, we identify a close structural connection between Pareto optimality and perfection that has various algorithmic consequences for coalition formation. Based on this insight, we formulate the...

We consider dynamic group formation in repeated n-person prisonerʼs dilemma. Agreements in coalitional bargaining are self-binding in that they are supported as subgame perfect equilibria of repeated games. Individuals are allowed to renegotiate the cooperating group agreement through a process...

We study cooperation in economies of indefinite duration. Participants faced a sequence of prisonerʼs dilemmas with anonymous opponents. We identify and characterize the strategies employed at the individual level. We report that (i) grim trigger does not describe well individual play and there...

Belief models capable of detecting 2- to 5-period patterns in repeated games by matching the current historical context to similar realizations of past play are presented. The models are implemented in a cognitive framework, ACT-R, and vary in how they implement similarity-based...

This paper proposes axiomatic foundations of expectation formation rules, by which deviating players anticipate the reaction of external players in a partition function game. The projection rule is the only rule satisfying subset consistency and responsiveness to the original partition of...

We address the common scenario where a group of agents wants to divide a set of items fairly, and at the same time seeks to optimize a global goal. Suppose that each item is a task and we want to find an allocation that minimizes the completion time of the last task in an envy-free manner, where...

A contract auction establishes a contract between a center and one of the bidders. As contracts may describe many terms, preferences over contracts typically display indifferences. The Qualitative Vickrey Auction (QVA) selects the best contract for the winner that is at least as good for the...