Free and fragmenting filling length

The filling length of an edge-circuit η in the Cayley 2-complex of a finite presentation of a group is the minimal integer length L such that there is a combinatorial null-homotopy of η down to a base point through loops of length at most L. We introduce similar notions in which the full-homotopy is not required to fix a base point, and in which the contracting loop is allowed to bifurcate. We exhibit a group in which the resulting filling invariants exhibit dramatically different behaviour to the standard notion of filling length. We also define the corresponding filling invariants for Riemannian manifolds and translate our results to this setting.

The making of international environmental agreements

We examine in this paper the formation and the stability of international environmental agreements when cooperation means to commit to a minimum abatement level. Each country decides whether to ratify the agreement and this latter enters into force only if it is ratified by a number of countries at least equal to some ratification threshold. We analyze the role played by ratification threshold rules and provide conditions for international environmental agreements to enter into force. We show that a large typology of agreements can enter into force among the one constituted by the grand coalition.

Choosing how to choose: self-stable majority rules and constitutions

Constitutional arrangements affect the decisions made by a society. We study how this effect leads to preferences of citizens over constitutions; and ultimately how this has a feedback that determines which constitutions can survive in a given society. Constitutions are stylized here, to consist of a voting rule for ordinary business and possibly different voting rule for making changes to the constitution. We deffine an equilibrium notion for constitutions, called self-stability, whereby under the rules of a self-stable constitution, the society would not vote to change the constitution. We argue that only self-stable constitutions will endure. We prove that self-stable constitutions always exist, but that most constitutions (even very prominent ones) may not be self-stable for some societies. We show that constitutions where the voting rule used to amend the constitution is the same as the voting rule used for ordinary business are dangerously simplistic, and there are (many) societies for which no such constitution is self-stable rule. We conclude with a characterization of the set of self-stable constitutions that use majority rule for ordinary business.

Bribe-proof rules in the division problem

The division problem consists of allocating an amount of a perfectly divisible good among a group of n agents with single-peaked preferences. A rule maps preference profiles into n shares of the amount to be allocated. A rule is bribe-proof if no group of agents can compensate another agent to misrepresent his preference and, after an appropriate redistribution of their shares, each obtain a strictly preferred share. We characterize all bribe-proof rules as the class of efficient, strategy-proof, and weak replacement monotonic rules. In addition, we identify the functional form of all bribe-proof and tops-only rules.

Efficient priority rules

We study the assignment of indivisible objects with quotas (houses, jobs, or offices) to a set of agents (students, job applicants, or professors). Each agent receives at most one object and monetary compensations are not possible. We characterize efficient priority rules by efficiency, strategy-proofness, and renegotiation-proofness. Such a rule respects an acyclical priority structure and the allocations can be determined using the deferred acceptance algorithm.

Stable condorcet rules

We consider the following allocation problem: A fixed number of public facilities must be located on a line. Society is composed of $N$ agents, who must be allocated to one and only one of these facilities. Agents have single peaked preferences over the possible location of the facilities they are assigned to, and do not care about the location of the rest of facilities. There is no congestion. In this context, we observe that if a public decision is a Condorcet winner, then it satisfies nice properties of internal and external stability. Though in many contexts and for some preference profiles there may be no Condorcet winners, we study the extent to which stability can be made compatible with the requirement of choosing Condorcet winners whenever they exist.

A maximal domain of preferences for tops-only rules in the division problem

The division problem consists of allocating an amount M of a perfectly divisible good among a group of n agents. Sprumont (1991) showed that if agents have single-peaked preferences over their shares, the uniform rule is the unique strategy-proof, efficient, and anonymous rule. Ching and Serizawa (1998) extended this result by showing that the set of single-plateaued preferences is the largest domain, for all possible values of M, admitting a rule (the extended uniform rule) satisfying strategy-proofness, efficiency and symmetry. We identify, for each M and n, a maximal domain of preferences under which the extended uniform rule also satisfies the properties of strategy-proofness, efficiency, continuity, and "tops-onlyness". These domains (called weakly single-plateaued) are strictly larger than the set of single-plateaued preferences. However, their intersection, when M varies from zero to infinity, coincides with the set of single-plateaued preferences.

Free triples, large indifference classes and the majority rule

We present a new domain of preferences under which the majority relation is always quasi-transitive and thus Condorcet winners always exist. We model situations where a set of individuals must choose one individual in the group. Agents are connected through some relationship that can be interpreted as expressing neighborhood, and which is formalized by a graph. Our restriction on preferences is as follows: each agent can freely rank his immediate neighbors, but then he is indifferent between each neighbor and all other agents that this neighbor "leads to". Hence, agents can be highly perceptive regarding their neighbors, while being insensitive to the differences between these and other agents which are further removed from them. We show quasi-transitivity of the majority relation when the graph expressing the neighborhood relation is a tree. We also discuss a further restriction allowing to extend the result for more general graphs. Finally, we compare the proposed restriction with others in the literature, to conclude that it is independent of any previously discussed domain restriction.

Cat(0) and Cat (-1) dimensions of torsion free

We show that a particular free-by-cyclic group has CAT(0) dimension equal to 2, but CAT(-1) dimension equal to 3. We also classify the minimal proper 2-dimensional CAT(0) actions of this group; they correspond, up to scaling, to a 1-parameter family of locally CAT(0) piecewise Euclidean metrics on a fixed presentation complex for the group. This information is used to produce an infinite family of 2-dimensional hyperbolic groups, which do not act properly by isometries on any proper CAT(0) metric space of dimension 2. This family includes a free-by-cyclic group with free kernel of rank 6.

Shellability of noncrossing partition lattices

We give a case-free proof that the lattice of noncrossing partitions associated to any finite real reflection group is EL-shellable. Shellability of these lattices was open for the groups of type Dn and those of exceptional type and rank at least three.

Algebraic extensions in free groups

The aim of this paper is to unify the points of view of three recent and independent papers (Ventura 1997, Margolis, Sapir and Weil 2001 and Kapovich and Miasnikov 2002), where similar modern versions of a 1951 theorem of Takahasi were given. We develop a theory of algebraic extensions for free groups, highlighting the analogies and differences with respect to the corresponding classical fieldt heoretic notions, and we discuss in detail the notion of algebraic closure. We apply that theory to the study and the computation of certain algebraic properties of subgroups (e.g. being malnormal, pure, inert or compressed, being closed in certain profinite topologies) and the corresponding closure operators. We also analyze the closure of a subgroup under the addition of solutions of certain sets of equations.

The density of injective endomorphisms of a free group

"Vegeu el resum a l'inici del document del fitxer adjunt."

Stability and manipulation in representative democracies

This paper is devoted to the analysis of all constitutions equipped with electoral systems involving two step procedures. First, one candidate is elected in every jurisdiction by the electors in that jurisdiction, according to some aggregation procedure. Second, another aggregation procedure collects the names of the jurisdictional winners in order to designate the final winner. It appears that whenever individuals are allowed to change jurisdiction when casting their ballot, they are able to manipulate the result of the election except in very few cases. When imposing a paretian condition on every jurisdictions voting rule, it is shown that, in the case of any finite number of candidates, any two steps voting rule that is not manipulable by movement of the electors necessarily gives to every voter the power of overruling the unanimity on its own. A characterization of the set of these rules is next provided in the case of two candidates.

On the number of K3,3-minor-free and maximal K3,3-minor-free graphs

"Vegeu el resum a l'inici del document del fitxer adjunt."

Learning the ropes and embracing the rules: CFSP institutions as arenas for learning and strategic socialisation

The aim of this article is to analyse those situations in which learning and socialisation take place within the context of the Common Foreign and Security Policy (CFSP), in particular, at the level of experts in the Council Working Groups. Learning can explain the institutional development of CFSP and changes in the foreign policies of the Member States. Some scope conditions for learning and channels of institutionalisation are identified. Socialisation, resulting from learning within a group, is perceived as a strategic action by reflective actors. National diplomats, once they arrive in Brussels, learn the new code of conduct of their Working Groups. They are embedded in two environments and faced with two logics: the European one in the Council and the national one in the Ministries of Foreign Affairs (MFA). The empirical evidence supports the argument that neither rational nor sociological approaches alone can account for these processes.