We introduce a new solution concept for models of coalition formation, called the myopic stable set. The myopic stable set is defined for a very general class of social environments and allows for an infinite state space. We show that the myopic stable set exists and is non-empty. Under minor...

J. Harsanyi introduced structural polymorphism in game theory, that is, there are many possible agent types such as 'low productivity' or high productivity' with corresponding probability but all operating under one behavioral type, strict rationality. In this paper, we introduce behavioral...

This study presents how selection of equilibrium in a game with many equilibria can be made possible when the common knowledge assumption (CKA) is replaced by the notion of common belief. Essentially, this idea of pinning down an equilibrium by weakening the CKA is the central feature of the...

The model of time-inconsistent procrastination by O'Donoughe and Rabin shows that individuals who are not aware of their present-bias (naïve) procrastinate more than individuals who are aware of it (sophisticated) or are not present-biased (time-consistent). This paper tests this prediction. We...

We experimentally investigate how reputational concerns affect behavior in repeated Tullock contests by comparing expenditures of participants interacting in fixed groups with the expenditures of participants interacting with randomly changing opponents. When participants receive full...

Theoretical models have had difficulties to account, at the same time, for the most important stylized facts observed in experiments of the Voluntary Contribution Mechanism. A recent approach tackling that gap is Arifovic and Ledyard (2012), which implements social preferences in tandem with an...

This study explores mechanism design for networks of interpersonal relationships. Agents' social (i.e., altruistic or spiteful) preferences and private payoffs are all subject to asymmetric information; utility is (quasi-)linear, types are independent. I show that any network of at least three...

Games that appear to be independent, involving none of the same players, may be related by emotions of reciprocity between the members of the same groups. In the real world, individuals are members of groups and want to reward or punish those groups whose members have been kind or unkind to...

We study Pareto efficient mechanisms in matching markets when the number of agents is large and individual preferences are randomly drawn from a class of distributions, allowing for both common and idiosyncratic shocks. We provide a broad set of circumstances under which, as the market grows...

Distributional constraints are common features in many real matching markets, such as medical residency matching, school admissions, and teacher assignment. We develop a general theory of matching mechanisms under distributional constraints. We identify the necessary and sufficient condition on...