Cooperació i teoria de jocs, el programari lliure o el #15m, dos exemples per l'universitat

Xerrada de cloenda de la Setmana internacional d'accés obert 2011 a la UOC, a càrrec de l'advocat Josep Jover. Per què les estratègies altruistes guanyen les egoistes en el programari lliure i en el #15m? El moviment #15m, igual que el programari, a diferència dels béns materials, no es pot posseir, ja que en pot gaudir (formant-ne part) un nombre indeterminat de persones sense que per això hagi de privar ningú de tenir-lo al seu torn. I això porta a girar com un mitjó la manera com manegen la informació les universitats, i quina és la missió de la universitat en la nova societat. En el futur immediat, valorarem les universitats no per la informació que guarden, que fora sempre serà millor i més extensa, sinó per la capacitat de crear masses crítiques, sia de recerca de coneixement, de capacitació humana, d'enllaç entre iguals... Les universitats hauran d'implantar el model o quedaran relegades.

Welfare Maximizing Contest Success Functions when the Planner Cannot Commit

We analyze how a contest organizer chooses optimally the winner when the contestants' efforts are already exerted and commitment to the use of a given contest success function is not possible. We de…ne the notion of rationalizability in mixed-strategies to capture such a situation. Our approach allows to derive different contest success functions depending on the aims and attitudes of the decider. We derive contest success functions which are closely related to commonly used functions providing new support for them. By taking into account social welfare considerations our approach bridges the contest literature and the recent literature on political economy. Keywords: Endogenous Contests, Contest Success Function, Mixed-Strategies. JEL Classi…cation: C72 (Noncooperative Games), D72 (Economic Models of Political Processes: Rent-Seeking, Elections), D74 (Conflict; Conflict Resolution; Alliances)

A Folk Theorem for Games when Frequent Monitoring Decreases Noise

This paper studies frequent monitoring in an infinitely repeated game with imperfect public information and discounting, where players observe the state of a continuous time Brownian process at moments in time of length _. It shows that a limit folk theorem can be achieved with imperfect public monitoring when players monitor each other at the highest frequency, i.e., _. The approach assumes that the expected joint output depends exclusively on the action profile simultaneously and privately decided by the players at the beginning of each period of the game, but not on _. The strong decreasing effect on the expected immediate gains from deviation when the interval between actions shrinks, and the associated increase precision of the public signals, make the result possible in the limit. JEL: C72/73, D82, L20. KEYWORDS: Repeated Games, Frequent Monitoring, Public Monitoring, Brownian Motion.

Public Monitoring with Uncertainty in the Time Repetitions

This paper study repeated games where the time repetitions of the stage game are not known or controlled by the players. We call this feature random monitoring. Kawamori's (2004) shows that perfect random monitoring is always better than the canonical case. Surprisingly, when the monitoring is public, the result is less clear-cut and does not generalize in a straightforward way. Unless the public signals are sufficiently informative about player's actions and/or players are patient enough. In addition to a discount effect, that tends to consistently favor the provision of incentives, we found an information effect, associated with the time uncertainty on the distribution of public signals. Whether payoff improvements are or not possible, depends crucially on the direction and strength of these effects. JEL: C73, D82, D86. KEYWORDS: Repeated Games, Frequent Monitoring, Random Public Monitoring, Moral Hazard, Stochastic Processes.

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.

Bayesian nash equilibrium in ''linear'' cournot models with private information about costs

Calculating explicit closed form solutions of Cournot models where firms have private information about their costs is, in general, very cumbersome. Most authors consider therefore linear demands and constant marginal costs. However, within this framework, the nonnegativity constraint on prices (and quantities) has been ignored or not properly dealt with and the correct calculation of all Bayesian Nash equilibria is more complicated than expected. Moreover, multiple symmetric and interior Bayesianf equilibria may exist for an open set of parameters. The reason for this is that linear demand is not really linear, since there is a kink at zero price: the general ''linear'' inverse demand function is P (Q) = max{a - bQ, 0} rather than P (Q) = a - bQ.

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

On the monotonic core

The monotonic core of a cooperative game with transferable utility (T.U.-game) is the set formed by all its Population Monotonic Allocation Schemes. In this paper we show that this set always coincides with the core of a certain game associated to the initial game.

On the dimension of the core of the assignment game

The set of optimal matchings in the assignment matrix allows to define a reflexive and symmetric binary relation on each side of the market, the equal-partner binary relation. The number of equivalence classes of the transitive closure of the equal-partner binary relation determines the dimension of the core of the assignment game. This result provides an easy procedure to determine the dimension of the core directly from the entries of the assignment matrix and shows that the dimension of the core is not as much determined by the number of optimal matchings as by their relative position in the assignment matrix.

Single-valued solutions for the Böhm-Bawerk horse market game

Single-valued solutions for the case of two-sided market games without product differentiation, also known as Böhm-Bawerk horse market games, are analyzed. The nucleolus is proved to coincide with the tau-value, and is thus the midpoint of the core. Moreover a characterization of this setof games in terms of the assignment matrix is provided.

Time consistent Pareto solutions in common access resource gameswith asymmetric players

In the analysis of equilibrium policies in a di erential game, if agents have different time preference rates, the cooperative (Pareto optimum) solution obtained by applying the Pontryagin's Maximum Principle becomes time inconsistent. In this work we derive a set of dynamic programming equations (in discrete and continuous time) whose solutions are time consistent equilibrium rules for N-player cooperative di erential games in which agents di er in their instantaneous utility functions and also in their discount rates of time preference. The results are applied to the study of a cake-eating problem describing the management of a common property exhaustible natural resource. The extension of the results to a simple common property renewable natural resource model in in nite horizon is also discussed.

A characterization of a new value and an existing value for cooperative games with levels structure of cooperation

En aquest treball presentem dues caracteritzacions de dos valors diferents en el marc dels jocs coalicionals amb cooperació restringida. Les restriccions són introduïdes com una seqüència finita de particions del conjunt del jugadors, de manera que cada una d'elles eés més grollera que l'anterior, formant així una estructura amb diferents nivells d'unions a priori.

Multi-sided Böhm-Bawerk assignment markets: the nucleolus and the core-center

En aquest treball mostrem que, a diferència del cas bilateral, per als mercats multilaterals d'assignació coneguts amb el nom de Böhm-Bawerk assignment games, el nucleolus i el core-center, i. e. el centre de masses del core, no coincideixen en general. Per demostrar-ho provem que donant un m-sided Böhm-Bawerk assignment game les dues solucions anteriors poden obtenir-se respectivament del nucleolus i el core-center d'un joc convex definit en el conjunt format pels m sectors. Encara més, provem que per calcular el nucleolus d'aquest últim joc només les coalicions formades per un jugador o m-1 jugadors són importants. Aquests resultats simplifiquen el càlcul del nucleolus d'un multi-sided ¿¿ohm-Bawerk assignment market amb un número molt elevat d'agents.

Von Neumann-Morgenstern solution and convex descompositions of TU games

We study under which conditions the core of a game involved in a convex decomposition of another game turns out to be a stable set of the decomposed game. Some applications and numerical examples, including the remarkable Lucas¿ five player game with a unique stable set different from the core, are reckoning and analyzed.