Re: META: traffic-limited list idea

Michael M. Butler (butler@comp*lib.org)
Tue, 15 Apr 1997 23:36:08 -0700


I have been informed that my presuppositions might have been

different from what has been discussed heretofore.

I'm picturing a system where every message has an opportunity cost that
is partly dependent on size and partially independent (is there a label
for such? I'm unaware of a specific name for f(x)+c as distinct from
f(x)... At any rate, such a scheme would reflect roughly my notion of
limited attention, if the tokens had a useful lifetime (say a week).

Then it would be possible to predict the maximum bandwidth per week.

This is tantamount to what happens in the periodical publishing world:

"All the news that fits."

MMB

>>>>

<excerpt>I came in late. It seems to me that "freshness-dated" tokens
that couldn't be hoarded might permit a prediction of max total list
volume per unit time. I can see how that might be perceived as
exclusionary, but less so than if the tokens could be hoarded.

If this sub-issue has been hashed to death, my apologies.

MMB

<center>BOUNCE WARNING: A simple reply to the above address will fail.
If you wish to send me a _noncommercial_ message, kindly substitute a
hyphen for the asterisk.

</center>

</excerpt><<<<<<<<

<center>BOUNCE WARNING: A simple reply to the above address will fail.
If you wish to send me a _noncommercial_ message, kindly substitute a
hyphen for the asterisk.

</center>