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.

Likelihood-based approaches to modeling demand for medical care

We review recent likelihood-based approaches to modeling demand for medical care. A semi-nonparametric model along the lines of Cameron and Johansson's Poisson polynomial model, but using a negative binomial baseline model, is introduced. We apply these models, as well a semiparametric Poisson, hurdle semiparametric Poisson, and finite mixtures of negative binomial models to six measures of health care usage taken from the Medical Expenditure Panel survey. We conclude that most of the models lead to statistically similar results, both in terms of information criteria and conditional and unconditional prediction. This suggests that applied researchers may not need to be overly concerned with the choice of which of these models they use to analyze data on health care demand.

Weak systems of Gandy, Jensen and Devlin

In Part I, we formulate and examine some systems that have arisen in the study of the constructible hierarchy; we find numerous transitive models for them, among which are supertransitive models containing all ordinals that show that Devlin's system BS lies strictly between Gandy's systems PZ and BST'; and we use our models to show that BS fails to handle even the simplest rudimentary functions, and is thus inadequate for the use intended for it in Devlin's treatise. In Part II we propose and study an enhancement of the underlying logic of these systems, build further models to show where the previous hierarchy of systems is preserved by our enhancement; and consider three systems that might serve for Devlin's purposes: one the enhancement of a version of BS, one a formulation of Gandy-Jensen set theory, and the third a subsystem common to those two. In Part III we give new proofs of results of Boffa by constructing three models in which, respectively, TCo, AxPair and AxSing fail; we give some sufficient conditions for a set not to belong to the rudimentary closure of another set, and thus answer a question of McAloon; and we comment on Gandy's numerals and correct and sharpen other of his observations.

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.

Inverse Problems for multiple invariant curves

Planar polynomial vector fields which admit invariant algebraic curves, Darboux integrating factors or Darboux first integrals are of special interest. In the present paper we solve the inverse problem for invariant algebraic curves with a given multiplicity and for integrating factors, under generic assumptions regarding the (multiple) invariant algebraic curves involved. In particular we prove, in this generic scenario, that the existence of a Darboux integrating factor implies Darboux integrability. Furthermore we construct examples where the genericity assumption does not hold and indicate that the situation is different for these.

Land, technical progress and the falling rate of profit

The paper sets out a one sector growth model with a neoclassical production function in land and a capital-labour aggregate. Capital accumulates through capitalist saving, the labour supply is infinitely elastic at a subsistence wage and all factors may experience factor augmenting technical progress. The main result is that, if the elasticity of substitution between land and the capital-labour aggregate is less than one and if the rate of caital augmenting technical progress is strictly positive, then the rate of profit will fall to zero. The surprise is that this result holds regardless of the rate of land augmenting technical progress; that is, no amount of technical advance in agriculture can stop the fall in the rate of profit. The paper also discusses the relation of this result to the classical and Marxist literature and sets out the path of the relative price of land.

Repeated games played in a network

Delayed perfect monitoring in an infinitely repeated discounted game is modelled by letting the players form a connected and undirected network. Players observe their immediate neighbors' behavior only, but communicate over time the repeated game's history truthfully throughout the network. The Folk Theorem extends to this setup, although for a range of discount factors strictly below 1, the set of sequential equilibria and the corresponding payoff set may be reduced. A general class of games is analyzed without imposing restrictions on the dimensionality of the payoff space. This and the bilateral communication structure allow for limited results under strategic communication only. As a by-product this model produces a network result; namely, the level of cooperation in this setup depends on the network's diameter, and not on its clustering coefficient as in other models.

Twisted Reidemeister torsion for twist knots

The aim of this paper is to give an explicit formula for the SL2(C)-twisted Reidemeister torsion as defined in [6] in the case of twist knots. For hyperbolic twist knots, we also prove that the twisted Reidemeister torsion at the holonomy representation can be expressed as a rational function evaluated at the cusp shape of the knot. Tables given approximations of the twisted Reidemeister torsion for twist knots on some concrete examples are also enclosed.

Preliminary study of cooperation in hybrid ad-hoc networks

In this paper, we present a first approach to evolve a cooperative behavior in ad hoc networks. Since wireless nodes are energy constrained, it may not be in the best interest of a node to always accept relay requests. On the other hand, if all nodes decide not to expend energy in relaying, then network throughput will drop dramatically. Both these extreme scenarios are unfavorable to the interests of a user. In this paper we deal with the issue of user cooperation in ad hoc networks by developing the algorithm called Generous Tit-For-Tat. We assume that nodes are rational, i.e., their actions are strictly determined by self-interest, and that each node is associated with a minimum lifetime constraint. Given these lifetime constraints and the assumption of rational behavior, we study the added behavior of the network.

On the complexity of the Whitehead minimization problem

The Whitehead minimization problem consists in finding a minimum size element in the automorphic orbit of a word, a cyclic word or a finitely generated subgroup in a finite rank free group. We give the first fully polynomial algorithm to solve this problem, that is, an algorithm that is polynomial both in the length of the input word and in the rank of the free group. Earlier algorithms had an exponential dependency in the rank of the free group. It follows that the primitivity problem – to decide whether a word is an element of some basis of the free group – and the free factor problem can also be solved in polynomial time.

Label Space Reduction in All-Optical Label Switchiing Networks

Report for the scientific sojourn at the Department of Information Technology (INTEC) at the Ghent University, Belgium, from january to june 2007. All-Optical Label Swapping (AOLS) forms a key technology towards the implementation of All-Optical Packet Switching nodes (AOPS) for the future optical Internet. The capital expenditures of the deployment of AOLS increases with the size of the label spaces (i.e. the number of used labels), since a special optical device is needed for each recognized label on every node. Label space sizes are affected by the wayin which demands are routed. For instance, while shortest-path routing leads to the usage of fewer labels but high link utilization, minimum interference routing leads to the opposite. This project studies and proposes All-Optical Label Stacking (AOLStack), which is an extension of the AOLS architecture. AOLStack aims at reducing label spaces while easing the compromise with link utilization. In this project, an Integer Lineal Program is proposed with the objective of analyzing the softening of the aforementioned trade-off due to AOLStack. Furthermore, a heuristic aiming at finding good solutions in polynomial-time is proposed as well. Simulation results show that AOLStack either a) reduces the label spaces with a low increase in the link utilization or, similarly, b) uses better the residual bandwidth to decrease the number of labels even more.

Inverse problems for invariant algebraic curves: explicit computations

Given an algebraic curve in the complex affine plane, we describe how to determine all planar polynomial vector fields which leave this curve invariant. If all (finite) singular points of the curve are nondegenerate, we give an explicit expression for these vector fields. In the general setting we provide an algorithmic approach, and as an alternative we discuss sigma processes.

Free Mobility and Taste-Homogeneity of Jurisdiction Structures

We consider a population of agents distributed on the unit interval. Agents form jurisdictions in order to provide a public facility and share its costs equally. This creates an incentive to form large entities. Individuals also incur a transportation cost depending on their location and that of the facility which makes small jurisdictions advantageous. We consider a fairly general class of distributions of agents and generalize previous versions of this model by allowing for non-linear transportation costs. We show that, in general, jurisdictions are not necessarily homogeneous. However, they are if facilities are always intraterritory and transportation costs are superadditive. Superadditivity can be weakened to strictly increasing and strictly concave when agents are uniformly distributed. Keywords: Consecutiveness, stratification, local public goods, coalition formation, country formation. JEL Classification: C71 (Cooperative Games), D71 (Social Choice; Clubs; Committees; Associations), H73 (Interjurisdictional Differentials and Their Effects).

Environmental Kuznets Curves for Carbon Emissions: A Critical Survey

The empirical finding of an inverse U-shaped relationship between per capita income and pollution, the so-called Environmental Kuznets Curve (EKC), suggests that as countries experience economic growth, environmental deterioration decelerates and thus becomes less of an issue. Focusing on the prime example of carbon emissions, the present article provides a critical review of the new econometric techniques that have questioned the baseline polynomial specification in the EKC literature. We discuss issues related to the functional form, heterogeneity, “spurious” regressions and spatial dependence to address whether and to what extent the EKC can be observed. Despite these new approaches, there is still no clear-cut evidence supporting the existence of the EKC for carbon emissions. JEL classifications: C20; Q32; Q50; O13 Keywords: Environmental Kuznets Curve; Carbon emissions; Functional form; Heterogeneity; “Spurious” regressions; Spatial dependence.Residential satisfaction is often used as a barometer to assess the performance of public policy and programmes designed to raise individuals' well-being. However, the fact that responses elicited from residents might be biased by subjective, non-observable factors casts doubt on whether these responses can be taken as trustable indicators of the individuals' housing situation. Emotional factors such as aspirations or expectations might affect individuals' cognitions of their true residential situation. To disentangle this puzzle, we investigated whether identical residential attributes can be perceived differently depending on tenure status. Our results indicate that tenure status is crucial not only in determining the level of housing satisfaction, but also regarding how dwellers perceive their housing characteristics. Keywords: Housing satisfaction, subjective well-being, homeownership. JEL classification: D1, R2.