Abstract: A non-transitory computer-readable recording medium stores therein a matching program that causes a computer to execute a process including: determining subgame perfect equilibrium of a game in extensive form corresponding to the matching, the game in extensive form having a structure in which a plurality of independent players have respective gains corresponding to respective preferences of the respective applicants, and have the ranks of priority associated with order of play, and each of the players recognizes the gains of all the players; performing matching based on results of the subgame perfect equilibrium; setting the gain of a player corresponding to a coupling-requesting applicant having a coupling request requesting matching as a group with another specific applicant, in accordance with whether the coupling request is satisfied; and determining whether to prune options in a move of the player corresponding to the coupling-requesting applicant.

Abstract: A non-transitory computer-readable recording medium stores therein a matching program that causes a computer to execute a process including: determining subgame perfect equilibrium of a game in extensive form corresponding to the matching, the game in extensive form having a structure in which a plurality of independent players have respective gains corresponding to respective preferences of the respective applicants, and have the ranks of priority associated with order of play, and each of the players recognizes the gains of all the players; performing matching based on results of the subgame perfect equilibrium; setting the gain of a player corresponding to a coupling-requesting applicant having a coupling request requesting matching as a group with another specific applicant, in accordance with whether the coupling request is satisfied; and determining whether to prune options in a move of the player corresponding to the coupling-requesting applicant.

Abstract: A non-transitory computer-readable recording medium stores therein a matching program that matches a plurality of applicants with matching priorities and a plurality of targets, the matching program causing a computer to execute a process including: setting matching type for each coupling-request applicant with first matching type or second matching type, the coupling request applicant requesting a specific applicant and the coupling-request applicant be matched with a same target, the first matching type performing matching of the coupling-request applicant collectively with the specific applicant, the second matching type performing matching of the coupling-request applicant separately from the specific applicant; and performing and repeating matching the plurality of applicants and the plurality of targets utilizing the matching priorities of the plurality of applicants and the matching type of the coupling-request applicant, until there are no coupling-request applicants with the first matching type whose

Abstract: A non-transitory computer readable recording medium stores therein a risk evaluation program that causes a computer to execute a process including: calculating a recognized risk for each of a plurality of areas based on a security plan for the plurality of areas, the recognized risk being that an intruder is recognized by security resources at each of a plurality of calculation timings; and outputting the recognized risk with respect to each of the plurality of areas at each of the plurality of calculation timings, wherein the calculating for each of the plurality of calculation timings includes calculating the recognized risk with respect to each of the plurality of areas based on the recognized risk with respect to each of the plurality of areas at a previous timing, moving ability of the intruder, and the security plan.

Abstract: A search apparatus specifies a first respondent group based on a respondent attribute of a respondent. The search apparatus searches for a respondent preference of the respondent utilizing a plurality of inquiries for the respondent, the plurality of inquiries being made with a first preference of the first respondent group as an initial value and corresponding to a first segment that the first respondent group belongs to. The search apparatus, when a specific condition is not satisfied after search from the initial value with a specific number of inquiries, generates or selects a second respondents group based on the respondent attribute, answers to the plurality of inquiries, and on preferences of a second respondent group, the second respondent group satisfying the specific condition. The search apparatus searches for the respondent preference with a preference of the second respondent group being an initial value.

Abstract: A disclosed method includes determining, for each operator group, scheduled execution order by arranging, for each operator group, the predetermined number of operations to be conducted while traveling, wherein at least a portion of the predetermined number of operations is allotted to each of the operator groups; determining, for each operator group, operations to be conducted in the scheduled execution order by determining, for each operator group, along the scheduled execution order of the operator group and while advancing time, whether movement to an operation place of each operation of the predetermined number of operations and start of the operation satisfy a constraint condition set in advance for the predetermined number of operations; and calculating a first evaluation value of orders of the operations determined to be conducted for the plural operator groups.