Search

Sets closed under rational behavior were introduced by Basu and Weibull (1991) as subsets of the strategy space that contain all best replies to all strategy profiles in the set. We here consider a more restrictive notion of closure under rational behavior: a subset of the strategy space is strongly closed under rational behavior, or sCURB, if it contains all best replies to all probabilistic beliefs over the set. We present an algorithm that computes all minimal sCURB sets in any given finite game. Runtime measurements on two-player games (where the concepts of CURB and sCURB coincide) show that the algorithm is considerably faster than the earlier developed algorithm, that of Benisch et al. (2006).

Language is arguably a powerful coordination device in real-life interactions. We here develop a game-theoretic model of two-sided pre-play communication that generalizes the cheap-talk approach by way of introducing a meaning correspondence between messages and actions, and postulating two axioms met by natural languages. Deviations from this correspondence are called dishonest and players have a lexicographic preference for honesty, second to material payoffs. The model is first applied to finite and symmetric two-player games and we establish that, in generic and symmetric n x n -coordination games, a Nash equilibrium component in such a lexicographic communication game is evolutionarily stable if and only if it results in the unique Pareto efficient outcome of the underlying game. We discus Aumann’s (1990) example of a Pareto efficient equilibrium that is not self-enforcing. We also extend the approach to one-sided communication.

This paper provides a definition of epistemic stability of sets of strategy profiles, and uses it to characterize variants of curb sets in finite games, including the set of rationalizable strategies and minimal curb sets.

We analyze how family ties affect incentives, with focus on the strategic interaction between two mutually altruistic siblings. The siblings exert effort to produce output under uncertainty, and they may transfer output to each other. With equally altruistic siblings, their equilibrium effort is nonmonotonic in the common degree of altruism, and it depends on the harshness of the environment. We define a notion of local evolutionary stability of degrees of sibling altruism and show that this degree is lower than the kinship-relatedness factor. Numerical simulations show how family ties vary with the environment, and how this affects economic outcomes. (JEL D13, D64, J12, Z13)

In most economics textbooks there is a gap between the non-existence of utility functions and the existence of continuous utility functions, although upper semi-continuity is sufficient for many purposes. Starting from a simple constructive approach for countable domains and combining this with basic measure theory, we obtain necessary and sufficient conditions for the existence of upper semi-continuous utility functions on a wide class of domains. Although links between utility theory and measure theory have been pointed out before, to the best of our knowledge this is the first time that the present route has been taken.

We consider a group or committee that faces a binary decision under uncertainty. Each member holds some private information. Members agree which decision should be taken in each state of nature, had this been known, but they may attach different values to the two types of mistake that may occur. Most voting rules have a plethora of uninformative equilibria, and informative voting may be incompatible with equilibrium. We analyze an anonymous randomized majority rule that has a unique equilibrium. This equilibrium is strict, votes are informative, and the equilibrium implements the optimal decision with probability one in the limit as the committee size goes to infinity. We show that this also holds for the usual majority rule under certain perturbations of the behavioral assumptions: (i) a slight preference for voting according to one's conviction, and (ii) transparency and a slight preference for esteem. We also show that a slight probability for voting mistakes strengthens the incentive for informative voting.

v3 du halshs-00121741; We consider a group or committee that faces a binary decision under uncertainty. Each member holds some private information. Members agree which decision should be taken in each state of nature, had this been known, but they may attach different values to the two types of mistake that may occur. Most voting rules have a plethora of uninformative equilibria, and informative voting may be incompatible with equilibrium. We analyze an anonymous randomized majority rule that has a unique equilibrium. This equilibrium is strict, votes are informative, and the equilibrium implements the optimal decision with probability one in the limit as the committee size goes to infinity. We show that this also holds for the usual majority rule under certain perturbations of the behavioral assumptions: (i) a slight preference for voting according to one's conviction, and (ii) transparency and a slight preference for esteem. We also show that a slight probability for voting mistakes strengthens the incentive for informative voting.

We analyze how family ties affect incentives, with focus on the strategic interaction between a pair of mutually altruistic siblings. Each sibling exerts effort to produce output under uncertainty and the siblings may transfer output to each other. With equally altruistic siblings, their equilibrium effort is nonmonotonic in the common degree of altruism and depends on the harshness of the environment. We define a notion of local evolutionary robustness of degrees of sibling altruism, and show that this degree is less than one half, the kinship relatedness factor. By way of numerical simulations we show that family ties are weaker in harsher environments.