Difference between revisions of "Reverse Unavailability Polling"
From ConRunner
Tbmorgan74 (Talk | contribs) |
Bill Taylor (Talk | contribs) (wikify categorize) |
||
| Line 1: | Line 1: | ||
| − | '''Reverse Unavailability Polling''' is a method to determine the optimum time to gather a number of people together for a meeting or event. Assuming that you are trying to accommodate the schedules of the participants, you should not try to find the one that is perfect for everyone. That is virtually impossible. Instead you should try to find least objectionable choice out of the array of bad choices. To put it another way, instead of maximizing the happiness, rather minimize the unhappiness. | + | '''Reverse Unavailability Polling''' is a method to determine the optimum time to gather a number of people together for a [[meetings|meeting]] or event. Assuming that you are trying to accommodate the schedules of the participants, you should not try to find the one that is perfect for everyone. That is virtually impossible. Instead you should try to find least objectionable choice out of the array of bad choices. To put it another way, instead of maximizing the happiness, rather minimize the unhappiness. |
More charts and examples to be inserted later. . . | More charts and examples to be inserted later. . . | ||
| + | |||
| + | |||
| + | [[category:Meetings]] | ||
Latest revision as of 19:02, 17 September 2007
Reverse Unavailability Polling is a method to determine the optimum time to gather a number of people together for a meeting or event. Assuming that you are trying to accommodate the schedules of the participants, you should not try to find the one that is perfect for everyone. That is virtually impossible. Instead you should try to find least objectionable choice out of the array of bad choices. To put it another way, instead of maximizing the happiness, rather minimize the unhappiness.
More charts and examples to be inserted later. . .
