A characterization of cooperative TU-games with large monotonic core

[cat] El concepte de joc cooperatiu amb large core és introduït per Sharkey (1982) i el de Population Monotonic Allocation Scheme és definit per Sprumont (1990). Inspirat en aquests conceptes, Moulin (1990) introdueix la noció de large monotonic core donant una caracterització per a jocs de tres jugadors. En aquest document provem que tots els jocs amb large monotonic core són convexes. A més, donem un criteri efectiu per determinar si un joc té large monotonic core o no, i daquí obtenim una caracterització pel cas de quatre jugadors.

A characterization of cooperative TU-games with large monotonic core

[cat] El concepte de joc cooperatiu amb large core és introduït per Sharkey (1982) i el de Population Monotonic Allocation Scheme és definit per Sprumont (1990). Inspirat en aquests conceptes, Moulin (1990) introdueix la noció de large monotonic core donant una caracterització per a jocs de tres jugadors. En aquest document provem que tots els jocs amb large monotonic core són convexes. A més, donem un criteri efectiu per determinar si un joc té large monotonic core o no, i daquí obtenim una caracterització pel cas de quatre jugadors.

Some Notes and Comments on the Efficient use of Information in Repeated Games with Poisson Signals

In the present paper we characterize the optimal use of Poisson signals to establish incentives in the "bad" and "good" news models of Abreu et al. [1]. In the former, for small time intervals the signals' quality is high and we observe a "selective" use of information; otherwise there is a "mass" use. In the latter, for small time intervals the signals' quality is low and we observe a "fine" use of information; otherwise there is a "non-selective" use. JEL: C73, D82, D86. KEYWORDS: Repeated Games, Frequent Monitoring, Public Monitoring, Infor- mation Characteristics.

Efficient bidding with externalities

We implement a family of efficient proposals to share benefits generated in environments with externalities. These proposals extend the Shapley value to games with externalities and are parametrized through the method by which the externalities are averaged. We construct two slightly different mechanisms: one for environments with negative externalities and the other for positive externalities. We show that the subgame perfect equilibrium outcomes of these mechanisms coincide with the sharing proposals.

Sequencing games without initial order

In this note we study uncertainty sequencing situations, i.e., 1-machine sequencing situations in which no initial order is specified. We associate cooperative games with these sequencing situations, study their core, and provide links with the classic sequencing games introduced by Curiel et al. (1989). Moreover, we propose and characterize two simple cost allocation rules for uncertainty sequencing situations with equal processing times.

Olimpismo, comunicación y cultura

Documento publicado como parte de la colección Working Papers con el propòsito de descubrir las exigencias de las nuevas políticas culturales para el deporte moderno y analizar el papel del Olimpismo en la actual sociedad de la información. Para ello se hace referencia a varias ediciones de los Juegos Olímpicos, pero especialmente, en los de Sydney 2000.

The Limits of Discrete Time Repeated Games:Some Notes and Comments

This paper studies the limits of discrete time repeated games with public monitoring. We solve and characterize the Abreu, Milgrom and Pearce (1991) problem. We found that for the "bad" ("good") news model the lower (higher) magnitude events suggest cooperation, i.e., zero punishment probability, while the highrt (lower) magnitude events suggest defection, i.e., punishment with probability one. Public correlation is used to connect these two sets of signals and to make the enforceability to bind. The dynamic and limit behavior of the punishment probabilities for variations in ... (the discount rate) and ... (the time interval) are characterized, as well as the limit payo¤s for all these scenarios (We also introduce uncertainty in the time domain). The obtained ... limits are to the best of my knowledge, new. The obtained ... limits coincide with Fudenberg and Levine (2007) and Fudenberg and Olszewski (2011), with the exception that we clearly state the precise informational conditions that cause the limit to converge from above, to converge from below or to degenerate. JEL: C73, D82, D86. KEYWORDS: Repeated Games, Frequent Monitoring, Random Pub- lic Monitoring, Moral Hazard, Stochastic Processes.

The role of role uncertainty in modified dictator games

We compare behavior in modified dictator games with and without role uncertainty. Subjectschoose between a selfish action, a costly surplus creating action (altruistic behavior) and acostly surplus destroying action (spiteful behavior). While costly surplus creating actions are themost frequent under role uncertainty (64%), selfish actions become the most frequent withoutrole uncertainty (69%). Also, the frequency of surplus destroying choices is negligible with roleuncertainty (1%) but not so without it (11%). A classification of subjects into four differenttypes of interdependent preferences (Selfish, Social Welfare maximizing, Inequity Averse andCompetitive) shows that the use of role uncertainty overestimates the prevalence of SocialWelfare maximizing preferences in the subject population (from 74% with role uncertainty to21% without it) and underestimates Selfish and Inequity Averse preferences. An additionaltreatment, in which subjects undertake an understanding test before participating in theexperiment with role uncertainty, shows that the vast majority of subjects (93%) correctlyunderstand the payoff mechanism with role uncertainty, but yet surplus creating actions weremost frequent. Our results warn against the use of role uncertainty in experiments that aim tomeasure the prevalence of interdependent preferences.

Choice of partners in multiple two-person prisoner's dilemma games: An experimental study

We examine the effect of unilateral and mutual partner selection in the context of prisoner's dilemmas experimentally. Subjects play simultaneously several finitely repeated two-person prisoner's dilemma games. We find that unilateral choice is the best system. It leads to low defection and fewer singles than with mutual choice. Furthermore, with the unilateral choice setup we are able to show that intendingdefectors are more likely to try to avoid a match than intending cooperators. We compare our results of multiple games with single game PD-experiments and find no difference in aggregate behavior. Hence the multiple game technique is robust and might therefore be an important tool in the future for testing the use of mixed strategies.

Measuring strategic uncertainty in coordination games

This paper explores three aspects of strategic uncertainty: its relation to risk, predictability of behavior and subjective beliefs of players. In a laboratory experiment we measure subjects certainty equivalents for three coordination games and one lottery. Behavior in coordination games is related to risk aversion, experience seeking, and age.From the distribution of certainty equivalents we estimate probabilities for successful coordination in a wide range of games. For many games, success of coordination is predictable with a reasonable error rate. The best response to observed behavior is close to the global-game solution. Comparing choices in coordination games with revealed risk aversion, we estimate subjective probabilities for successful coordination. In games with a low coordination requirement, most subjects underestimate the probability of success. In games with a high coordination requirement, most subjects overestimate this probability. Estimating probabilistic decision models, we show that the quality of predictions can be improved when individual characteristics are taken into account. Subjects behavior is consistent with probabilistic beliefs about the aggregate outcome, but inconsistent with probabilistic beliefs about individual behavior.

Max-convex decompositions for cooperative TU games

We show that any cooperative TU game is the maximum of a finite collection of convex games. This max-convex decomposition can be refined by using convex games with non-negative dividends for all coalitions of at least two players. As a consequence of the above results we show that the class of modular games is a set of generators of the distributive lattice of all cooperative TU games. Finally, we characterize zero-monotonic games using a strong max-convex decomposition

Max-convex decompositions for cooperative TU games

We show that any cooperative TU game is the maximum of a finite collection of convex games. This max-convex decomposition can be refined by using convex games with non-negative dividends for all coalitions of at least two players. As a consequence of the above results we show that the class of modular games is a set of generators of the distributive lattice of all cooperative TU games. Finally, we characterize zero-monotonic games using a strong max-convex decomposition

Axiomatization of the nucl eolus of assignment games

On the domain of general assignment games (with possible reservation prices) the core is axiomatized as the unique solution satisfying two consistency principles: projection consistency and derived consistency. Also, an axiomatic characterization of the nucleolus is given as the unique solution that satisfies derived consistency and equal maximum complaint between groups. As a consequence, we obtain a geometric characterization of the nucleolus. Maschler et al. (1979) provide a geometrical characterization for the intersection of the kernel and the core of a coalitional game, showing that those allocations that lie in both sets are always the midpoint of certain bargaining range between each pair of players. In the case of the assignment game, this means that the kernel can be determined as those core allocations where the maximum amount, that can be transferred without getting outside the core, from one agent to his / her optimally matched partner equals the maximum amount that he / she can receive from this partner, also remaining inside the core. We now prove that the nucleolus of the assignment game can be characterized by requiring this bisection property be satisfied not only for optimally matched pairs but also for optimally matched coalitions. Key words: cooperative games, assignment game, core, nucleolus

On reduced games and the lexmax solution

For a family of reduced games satisfying a monotonicity property, we introduced the reduced equal split-off set, an extension of the equal split-off set (Branzei et. al, 2006), and study its relation with the core. Regardless of the reduction operation we consider, the intersection between both sets is either empty or a singleton containing the lexmax solution (Arin et al., 2008). We also provide a procedure for computing the lexmax solution for a class of games that includes games with large core (Sharkey, 1982). [JEL Classification: C71]

Enjoying cooperative games: The R package GameTheory

This paper focuses on cooperative games with transferable utility. We propose the computation of two solutions, the Shapley value for n agents and the nucleolus with a maximum of four agents. The current approach is also focused on conflicting claims problems, a particular case of coalitional games. We provide the computation of the most well-known and used claims solutions: the proportional, the constrained equal awards, the constrained equal losses, the Talmud and the random arrival rules. Keywords: Cooperative game, Shapley value, nucleolus, claims problem, claims rule, bankruptcy.