A geometric chracterization of the nucleolus of the assignment game

Maschler et al. (1979) caracteritzen geomètricament la intersecció del kernel i del core en els jocs cooperatius, demostrant que les distribucions que pertanyen a ambdós conjunts es troben en el punt mig d’un cert rang de negociació entre parelles de jugadors. En el cas dels jocs d’assignació, aquesta caracterització vol dir que el kernel només conté aquells elements del core on el màxim que un jugador pot transferir a una parella òptima és igual al màxim que aquesta parella li pot transferir, sense sortir-se’n del core. En aquest treball demostrem que el nucleolus d’un joc d’assignació queda caracteritzat si requerim que aquesta propietat de bisecció es compleixi no només per parelles, sinó també per coalicions entre sectors aparellades òptimament.

A geometric chracterization of the nucleolus of the assignment game

Maschler et al. (1979) caracteritzen geomètricament la intersecció del kernel i del core en els jocs cooperatius, demostrant que les distribucions que pertanyen a ambdós conjunts es troben en el punt mig d’un cert rang de negociació entre parelles de jugadors. En el cas dels jocs d’assignació, aquesta caracterització vol dir que el kernel només conté aquells elements del core on el màxim que un jugador pot transferir a una parella òptima és igual al màxim que aquesta parella li pot transferir, sense sortir-se’n del core. En aquest treball demostrem que el nucleolus d’un joc d’assignació queda caracteritzat si requerim que aquesta propietat de bisecció es compleixi no només per parelles, sinó també per coalicions entre sectors aparellades òptimament.

Does bounded rationality lead to individual heterogeneity? The impact of the experimentation process and of memory constraints

In this paper we explore the effect of bounded rationality on the convergence of individual behavior toward equilibrium. In the context of a Cournot game with a unique and symmetric Nash equilibrium, firms are modeled as adaptive economic agents through a genetic algorithm. Computational experiments show that (1) there is remarkable heterogeneity across identical but boundedly rational agents; (2) such individual heterogeneity is not simply a consequence of the random elements contained in the genetic algorithm; (3) the more rational agents are in terms of memory abilities and pre-play evaluation of strategies, the less heterogeneous they are in their actions. At the limit case of full rationality, the outcome converges to the standard result of uniform individual behavior.

Coalition formation in a contest game with three heterogeneous players

We analyze the incentives for cooperation of three players differing in their efficiency of effort in a contest game. We concentrate on the non-cooperative bargaining foundation of coalition formation, and therefore, we adopt a two-stage model. In the first stage, individuals form coalitions following a bargaining protocol similar to the one proposed by Gul (1989). Afterwards, coalitions play the contest game of Esteban and Ray (1999) within the resulting coalition structure of the first stage. We find that the grand coalition forms whenever the distribution of the bargaining power in the coalition formation game is equal to the distribution of the relative efficiency of effort. Finally, we use the case of equal bargaining power for all individuals to show that other types of coalition structures may be observed as well.

A generalized assignment game

The proposed game is a natural extension of the Shapley and Shubik Assignment Game to the case where each seller owns a set of different objets instead of only one indivisible object. We propose definitions of pairwise stability and group stability that are adapted to our framework. Existence of both pairwise and group stable outcomes is proved. We study the structure of the group stable set and we finally prove that the set of group stable payoffs forms a complete lattice with one optimal group stable payoff for each side of the market.

Minimal lenght elements of Thompson's groups F(p)

We describe a method for determining the minimal length of elements in the generalized Thompson's groups F(p). We compute the length of an element by constructing a tree pair diagram for the element, classifying the nodes of the tree and summing associated weights from the pairs of node classifications. We use this method to effectively find minimal length representatives of an element.

Does affirmative action reduce effort incentives? A contest game analysis

In this paper a contest game with heterogeneous players is analyzed in which heterogeneity could be the consequence of past discrimination. Based on the normative perception of the heterogeneity there are two policy options to tackle this heterogeneity: either it is ignored and the contestants are treated equally, or affirmative action is implemented which compensates discriminated players. The consequences of these two policy options are analyzed for a simple two-person contest game and it is shown that the frequently criticized trade-off between affirmative action and total effort does not exist: Instead, affirmative action fosters effort incentives. A generalization to the n-person case and to a case with a partially informed contest designer yields the same result if the participation level is similar under each policy.

Inter-group conflict and intra-group punishment in an experimental contest game

We study how conflict in a contest game is influenced by rival parties being groups and by group members being able to punish each other. Our main motivation stems from the analysis of socio-political conflict. The relevant theoretical prediction in our setting is that conflict expenditures are independent of group size and independent of whether punishment is available or not. We find, first, that our results contradict the independence of group-size prediction: conflict expenditures of groups are substantially larger than those of individuals, and both are substantially above equilibrium. Towards the end of the experiment material losses in groups are 257% of the predicted level. There is, however, substantial heterogeneity in the investment behaviour of individual group members. Second, allowing group members to punish each other after individual contributions to the contest effort are revealed leads to even larger conflict expenditures. Now material losses are 869% of the equilibrium level and there is much less heterogeneity in individual group members' investments. These results contrast strongly with those from public goods experiments where punishment enhances efficiency and leads to higher material payoffs.

Elements of algebraic geometry and the positive theory of partially commutative groups

The first main result of the paper is a criterion for a partially commutative group G to be a domain. It allows us to reduce the study of algebraic sets over G to the study of irreducible algebraic sets, and reduce the elementary theory of G (of a coordinate group over G) to the elementary theories of the direct factors of G (to the elementary theory of coordinate groups of irreducible algebraic sets). Then we establish normal forms for quantifier-free formulas over a non-abelian directly indecomposable partially commutative group H. Analogously to the case of free groups, we introduce the notion of a generalised equation and prove that the positive theory of H has quantifier elimination and that arbitrary first-order formulas lift from H to H * F, where F is a free group of finite rank. As a consequence, the positive theory of an arbitrary partially commutative group is decidable.

Classificació i importància dels elements paisatgístics del territori Tsimane' segons la percepció local

En aquesta tesis es presenten els resultats de la investigació duta a terme a les comunitats indígenes Tsimane’ de l’Amazònia boliviana. La investigació estudia la percepció dels indígenes sobre l’etnoclassificació del seu territori. S’estableix una clau de classificació i es determina la importància dels elements paisatgístics del territori Tsimane’ segons la percepció local. Aquesta informació permetrà integrar el coneixement local dins dels programes de desenvolupament integral i de planificació territorial en l’Amazònia Boliviana. L’estudi conclou que la població Tsimane’ classifica els elements paisatgístics del seu entorn en 89 taques conformades per una espècies arbòria dominant i que estan incloses en un o més dels nou paisatges identificats: Därsi Därä, Sajras, Sinues Ojñi’, Mayes, Múcúya, Tsäquis Därä, Cum, Tajñi’ i Jaman. A partir d’un anàlisi multicriteri s’ha determinat una importància total per cada paisatge segons els següents criteris d’importància: diversitat de taques, activitats econòmiques realitzables, presència espiritual, percepció individual i importància relativa segons els altres paisatges. Així doncs s’ha trobat que el paisatge més important és el Därsi Därä (bosc primari caracteritzat per un estrat arbori superior a 50 metres d’altura). També s’han analitzat les dades discernint segons el gènere de l’entrevistat i segons la proximitat de les comunitats estudiades a la ciutat més propera.

Dynamic stackelberg game with risk-averse players: optimal risk-sharing under asymmetric information

The objective of this paper is to clarify the interactive nature of the leader-follower relationship when both players are endogenously risk-averse. The analysis is placed in the context of a dynamic closed-loop Stackelberg game with private information. The case of a risk-neutral leader, very often discussed in the literature, is only a borderline possibility in the present study. Each player in the game is characterized by a risk-averse type which is unknown to his opponent. The goal of the leader is to implement an optimal incentive compatible risk-sharing contract. The proposed approach provides a qualitative analysis of adaptive risk behavior profiles for asymmetrically informed players in the context of dynamic strategic interactions modelled as incentive Stackelberg games.

The Multiple-partners assignment game with heterogeneous sales and multi-unit demands: competitive equilibria

A multiple-partners assignment game with heterogeneous sales and multiunit demands consists of a set of sellers that own a given number of indivisible units of (potentially many different) goods and a set of buyers who value those units and want to buy at most an exogenously fixed number of units. We define a competitive equilibrium for this generalized assignment game and prove its existence by using only linear programming. In particular, we show how to compute equilibrium price vectors from the solutions of the dual linear program associated to the primal linear program defined to find optimal assignments. Using only linear programming tools, we also show (i) that the set of competitive equilibria (pairs of price vectors and assignments) has a Cartesian product structure: each equilibrium price vector is part of a competitive equilibrium with all optimal assignments, and vice versa; (ii) that the set of (restricted) equilibrium price vectors has a natural lattice structure; and (iii) how this structure is translated into the set of agents' utilities that are attainable at equilibrium.

On Cooperative solutions of a generalized assignment game: limit theorems to the set of competitive equilibria

We study two cooperative solutions of a market with indivisible goods modeled as a generalized assignment game: Set-wise stability and Core. We first establish that the Set-wise stable set is contained in the Core and it contains the non-empty set of competitive equilibrium payoffs. We then state and prove three limit results for replicated markets. First, the sequence of Cores of replicated markets converges to the set of competitive equilibrium payoffs when the number of replicas tends to infinity. Second, the Set-wise stable set of a two-fold replicated market already coincides with the set of competitive equilibrium payoffs. Third, for any number of replicas there is a market with a Core payoff that is not a competitive equilibrium payoff.