Một cách thứ hai, trong đó lập kế hoạch đi vào, là thông qua phản ứng của hệ thống cấu hình để đến các sự kiện. Nếu các đại lý kích hoạt một lần mỗi giờ để kiểm tra các hành vi vi phạm chính sách, hoặc ngay lập tức, họ nên bắt đầu ở những thời điểm ngẫu nhiên, hoặc vào các thời điểm dự đoán | . GAME-THEORETICAL STRATEGY SELECTION 311 Figure The absolute values of payoff contributions as a function of time in hours For daily tidying Tp 24. User numbers are set in the ratio ng nb 99 1 based on rough ratios from the author s College environment . one percent of users are considered mischievous. The filling rates are in the same ratio rb Rtot rg Rtot ra Rtot . The flat dot-slashed line is nq the quota payoff. The lower wavy line is the cumulative payoff resulting from good users while the upper line represents the payoff from bad users. The upper line doubles as the magnitude of the payoff na nu if we apply the restriction that an automatic system can never win back more than users have already taken. Without this restriction na would be steeper. As drawn the daily ripples of the automatic system are in phase with the users activity. This is not realistic since tidying would normally be done at night when user activity is low however such details need not concern us in this illustrative example. The policy created in setting up the rules of play for the game penalizes the system administrator for employing strict quotas which restrict users activities. Even so users do not gain much from this because quotas are constant for all time. A quota is a severe handicap to users in the game except for very short times before users reach their quota limits. Quotas could be considered cheating by the system administrator since they determine the final outcome even before play commences. There is no longer an adaptive allocation of resources. Users cannot create temporary files which exceed these hard and fast quotas. An immunity-type model which allows fluctuations is a more resource-efficient strategy in this respect. since it allows users to span all the available resources for short periods of time without consuming them for ever. According to the minimax theorem proved by John von Neumann any two-person zero-sum game has a solution either
