We study voting games on binary issues, where voters hold an objective over the outcome of the collective decision and are allowed, before the vote takes place, to negotiate their voting strategy with the other participants. We analyse the voters’ rational behaviour in the resulting two-phase game, showing under what conditions undesirable equilibria can be removed and desirable ones sustained ...

In this paper, we generalize a known theorem by using a general class of power increasing sequences instead of a quasi-δ-power increasing sequence. This theorem also includes some known and new results.

We propose a simple method for measuring the mode power of two-mode fiber based on the bending method. The mode power ratio is determined with better than 1 dB accuracy by undertaking three power measurements with different numbers of fiber bends. We also evaluate the estimation error of the proposed method and the required resolution of the measurement.

General results on transformations on information production processes (IPPs), involving transformations of the h-index and related indices, are applied in concrete, simple cases: doubling the production per source, doubling the number of sources, doubling the number of sources but halving their production, halving the number of sources but doubling their production (fusion of sources) and, fin...

We show that revealed preference tests, which allow a small degree of inee-ciency in consumers' choices, have no power against the alternative of purely random demand.

Article history: Received 12 December 2007 Available online 16 June 2009 Communicated by James W. P. Hirschfeld

In this paper we show that every power bounded operator weighted shift with commuting normal weights is similar to a contraction. As an application of this result, we reduce the problem whether every centered power bounded operator is similar to a contraction to the analogous question about quasi-invertible centered operators.

In this paper we study underlying graphs corresponding to a set of halving lines. We establish many properties of such graphs. In addition, we tighten the upper bound for the number of halving lines.

The satisfiability and finite satisfiability problems for the two-variable fragment of firstorder logic with counting quantifiers are both in NEXPTIME, even when counting quantifiers are coded succinctly.