In the context of spatial majority voting games, considerable experimental support exists for the core as a solution hypothesis when it is not empty (Berl et al., 1976; Fiorina and Plott, 1978; Isaacs and Plott, 1978). Specifically, these experiments show that if a simple majority voting game possesses a Core point-a point that cannot be defeated by a majority vote-subjects choose outcomes at o...

Toward the end of the 20th century, clinical guidelines proliferated that had the laudable aim of bringing best practices to bear on the unnecessary variability of medical care. New guidelines have continued to appear that span the entire spectrum of medical and surgical practice. Meanwhile, older guidelines have been continually updated. Community-acquired pneumonia (CAP), one of the most comm...

Eugene Garfield, a linguist, is the remarkable founder of the Institute for Scientific Information (ISI). In the 1960s, Garfield came up with an intriguing concept that has become indispensable to the scientific community, one that he has bankrolled into an influential publishing industry. The concept is that citations in a scientific paper can be used to determine the importance of not only sc...

A median (antimedian) of a profile of vertices on a graph G is a vertex that minimizes (maximizes) the sum of the distances to the elements in the profile. The median (antimedian) function has as output the set of medians (antimedians) of a profile. It is one of the basic models for the location of a desirable (obnoxious) facility in a network. The median function is well studied. For instance ...

The synchronized bit communication model, defined recently by Impagliazzo and Williams in [1], is a communication model which allows the participants to share a common clock. The main open problem posed in this paper was the following: does the synchronized bit model allow a logarithmic speed-up for all functions over the standard deterministic model of communication? We resolve this question i...

New proofs are given for Monjardet’s theorem that all strong simple games (i.e., ipsodual elements of the free distributive lattice) can be generated by the median operation. Tighter limits are placed on the number of iterations necessary. Comparison is drawn with the χ function which also generates all strong simple games.

This paper deals with computer supported cooperative work in the context of untethered scenarios typical of mobile environments. The scenario envisions a number of homogeneous peers that are able to provide the same services, disconnect frequently from the net, and perform part of their work while disconnected. The application we choose is Configuration Management (CM), a critical cooperative a...

We extend Valiant's construction of monotone formulae for the majority function to obtain an eecient probabilistic construction of small monotone formulae for arbitrary positive linear threshold functions. We show that any positive linear threshold function on n boolean variables which has weight complexity q(n) can be computed by a monotone boolean formula of size O(q(n) 3:3 n 2): Our techniqu...