A model category structure on the category of simplicial multicategories

We establish a Quillen model structure on simplicial(symmetric) multicategories. It extends the model structure on simplicial categories due to J. Bergner [2]. We observe that our technique of proof enables us to prove a similar result for (symmetric) multicategories enriched over other monoidal model categories than simplicial sets. Examples include small categories, simplicial abelian groups and compactly generated Hausdorff spaces.

Banning Obsolete Weapons or Reshaping Perceptions of Military Utility: Discursive Dynamics in Weapons Prohibitions

The paper focuses on the argumentative process through which new international norms prohibiting the use of weapons causing severe civilian harm emerge. It examines the debate surrounding the use and usefulness of landmines and cluster munitions and traces the process through which NGOs change conceptions of military utility and effectiveness of certain weapons by highlighting their humanitarian problems and questioning their military value. By challenging military thinking on these issues, NGOs redefine the terms of the debate – from a commonplace practice, the use of such weapons becomes controversial and military decisions need to be justified. The argument-counterargument dynamic shifts the burden of proof of the necessity and safety of the weapons to the users. The process witnesses the ability of NGOs to influence debates on military issues despite their disadvantaged position in hard security issue areas. It also challenges realist assumptions that only weapons that are obsolete or low-cost force equalizers for weak actors can be banned. To the contrary, the paper shows that in the case of landmines and cluster munitions, defining the military (in)effectiveness of the weapons is part and parcel of the struggle for their prohibition.

Bargaining, coalitions and competition

We study a decentralized matching model in a large exchange economy,in which trade takes place through non--cooperative bargaining in coalitionsof finite size. Under essentially the same conditions of core equivalence, we show that the strategic equilibrium outcomes of our model coincide with theWalrasian allocations of the economy. Our method of proof exploits equivalenceresults between the core and Walrasian equilibria. Our model relaxes differentiability and convexity of preferences thereby covering the caseof indivisible goods.

Hard instances of algorithms and proof systems

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

Clarke critical values of subanalytic Lipschitz continuous functions

We prove that any subanalytic locally Lipschitz function has the Sard property. Such functions are typically nonsmooth and their lack of regularity necessitates the choice of some generalized notion of gradient and of critical point. In our framework these notions are defined in terms of the Clarke and of the convex-stable subdifferentials. The main result of this note asserts that for any subanalytic locally Lipschitz function the set of its Clarke critical values is locally finite. The proof relies on Pawlucki's extension of the Puiseuxlemma. In the last section we give an example of a continuous subanalytic function which is not constant on a segment of "broadly critical" points, that is, points for which we can find arbitrarily short convex combinations of gradients at nearby points.

A proof that all Seifert 3-manifold groups and all virtual surface groups are conjugacy separable

We prove that the fundamental group of any Seifert 3-manifold is conjugacy separable. That is, conjugates may be distinguished infinite quotients or, equivalently, conjugacy classes are closed in the pro-finite topology.

Corrigendum stable matchings and preferences of couples

We correct an omission in the definition of our domain of weakly responsive preferences introduced in Klaus and Klijn (2005) or KK05 for short. The proof of the existence of stable matchings (KK05, Theorem 3.3) and a maximal domain result (KK05, Theorem 3.5) are adjusted accordingly.

On group strategy-proof mechanisms for a many-to-one matching model

For the many-to-one matching model in which firms have substitutable and quota q-separable preferences over subsets of workers we show that the workers-optimal stable mechanism is group strategy-proof for the workers. In order to prove this result, we also show that under this domain of preferences (which contains the domain of responsive preferences of the college admissions problem) the workers-optimal stable matching is weakly Pareto optimal for the workers and the Blocking Lemma holds as well. We exhibit an example showing that none of these three results remain true if the preferences of firms are substitutable but not quota q-separable.

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.

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.

A foundation model for marxian theories of the breakdown of capitalism

Marx and the writers that followed him have produced a number of theories of the breakdown of capitalism. The majority of these theories were based on the historical tendencies: the rise in the composition of capital and the share of capital and the fall in the rate of profit. However these theories were never modeled with main stream rigour. This paper presents a constant wage model, with capital, labour and land as factors of production, which reproduces the historical tendencies and so can be used as a foundation for the various theories. The use of Chaplygins theorem in the proof of the main result also gives the paper a technical interest.

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.

The Evolution of roommate networks: a comment on Jackson and Watts JET (2002)

We extend Jackson and Watts's (2002) result on the coincidence of S-stochastically stable and core stable networks from marriage problems to roommate problems. In particular, we show that the existence of a side-optimal core stable network, on which the proof of Jackson and Watts (2002) hinges, is not crucial for their result.

Corrigendum: stable matchings and preferences of couples

We correct an omission in the definition of the domain of weakly responsive preferences introduced in Klaus and Klijn (2005) or KK05 for short. The proof of the existence of stable matchings (KK05, Theorem 3.3) and a maximal domain result (KK05, Theorem 3.5) are adjusted accordingly.