| 摘要 |
PROBLEM TO BE SOLVED: To allocate tasks from a plurality of kinds of services without a delay in operation of tasks from a specific kind of service.SOLUTION: The task allocation server calculates an estimated value of a user's interest degree and uncertainty of each estimated value for each of a plurality of kinds of services, from a history of the user's execution of tasks from the service, and presents a task from the service having the greatest priority to a user who logs in, by calculating, for each of the plurality of kinds of services, the priority of a task from the service on the basis of the estimated value of the interest degree and uncertainty of the estimated value, taking into consideration the possibility of the task not being executed by another user to whom tasks from the service are allocated. |
