The intersection problem for star designs

We determine those triples (m, II, k) of integers for which there are two m-star designs on the same n-set having exactly k stars in common.

The meeting place problem: Salience and search.

The notion of salience was developed by Schelling in the context of the meeting-place problem of locating a partner in the absence of a pre-agreed meeting place. In this paper, we argue that a realistic specification of the meeting place problem involves allowing a strategy of active search over a range of possible meeting places. We solve this extended problem, allowing for extensions such as repeated play, search costs and asymmetric payoffs. The result is a considerably richer, but more complex, notion of salience. (C) 1998 Elsevier Science B.V.

Exploring the use of Viagra in place of animal and plant potency products in traditional Chinese medicine

Recently, conservationists have debated whether consumers of animal and plant potency products used to treat erectile dysfunction (ED) in traditional Chinese medicine (TCM) might be switching to Viagra, consequently consuming fewer of these animals and plants. To address this question, a survey examined the medical decisions of male consumers of TCM in Hong Kong who were over the age of 50. As predicted, these consumers reported selectively switching to Western medicines to treat ED, but not to treat other health ailments. These findings provide support for the possibility that Viagra may have conservation benefits for certain species.

The intersection problem for K_4-e designs

A G-design of order n is a pair (P,B) where P is the vertex set of the complete graph K-n and B is an edge-disjoint decomposition of K-n into copies of the simple graph G. Following design terminology, we call these copies ''blocks''. Here K-4 - e denotes the complete graph K-4 with one edge removed. It is well-known that a K-4 - e design of order n exists if and only if n = 0 or 1 (mod 5), n greater than or equal to 6. The intersection problem here asks for which k is it possible to find two K-4 - e designs (P,B-1) and (P,B-2) of order n, with \B-1 boolean AND B-2\ = k, that is, with precisely k common blocks. Here we completely solve this intersection problem for K-4 - e designs.