Date   : Wed, 29 Apr 1981106:04:00-MDT
From   : MOORE@USC-ISIB
Subject: looking for a program ...

Does anyone out there have (access to) a cp/m-compatible program to do
resource-desired/resource-available matching (E.g.: car pooling).  That
is, a file is maintained of participants, and for each, features of self
and desired features of "match".  For Car pooling:
       Self-features                   Desired features of match
          leaving (x,y)                   leaving (x', y')
          lv. 8a.m. +/- 5                 arr. < 9a.m.
          like rock music                 non-smoker 
The intent is that for a particular participant, a set of acceptable matches
are discovered between his entry and those already on file.  Ideally, there
would be both mandatory matching (must accommodate wheelchair) and preference
matching (walk less than 3 blocks either end).  

No doubt, many such programs exist already-- I don't know if they've made it
to the Micro-world yet.

Thanks for any pointers.

Jim Moore (moore @ isib)