We provide a simple theoretical foundation, based on the theory of Markov chains, for the objective empirical procedure for journal ranking devised by Liebowitz and Palmer.An elementary characterization is derived that substantially clarifies the meaning, scope and underlying intuition of the...

The reduction theory of David F. Hendry provides a comprehensive probabilistic framework for the analysis and classification of the reductions associated with empirical econometric models. However, it is unable to provide an analysis on the sameunderlying probability space of the first reduction...

We develop an aggregated model to study rational environmental adaptation policies that compensate negative consequences of certain environmental hazards and changes. The model distinguishes three categories of adaptation measures that (a) compensate the decrease of the environmental amenity...

A profit-maximizing auctioneer can provide a public good to a group of agents. Each group member has a private value for the good being provided to the group. We investigate an auction mechanism where the auctioneer provides the good to the group, only if the sum of their bids exceeds a reserve...

In the first part of this paper we prove that the global quadratic optimization problem over a simplex can be solved with a constant relative accuracy. In the second part we consider some natural extensions of the result.

In this paper, I first prove an integral representation theorem: Every quasi-integral on a Stone lattice can be represented by a unique upper-continuous capacity. I then apply this representation theorem to study the topological structure of the space of all upper-continuous capacities on a...

A profit maximising auctioneer can provide a public good to a group of agents. Each group member has a private value for the good being provided to the group. We investigate an auction mechanism where the auctioneer provides the good to the group, only if the sum of their bids exceeds a reserve...

This paper presents a combinatorial polynomial-time algorithm for minimizing submodular set functions. The algorithm employs a scaling scheme that uses a flow in the complete directed graph on the underlying set with each arc capacity equal to the scaled parameter.

A profit-maximizing auctioneer can provide a public good to at most one of a number of groups of agents. The groups may have non-empty intersections. Each group member has a private value for the good being provided to the group. We investigate an auction mechanism where the auctioneer provides...

In this paper we decribe a hybrid strategy for solving combinatorial optimisation problemms, obtained by coupling a local search method to an evolutionary algorithm, and we provide an application to the Manhattan newspaper problem. The local search method has been devised specifically for this...