Sampling schemes for strategy searching in strategic interaction between parties

A non-transitory, computer-readable medium storing one or more instructions executable by a computer system to perform operations comprising:

• identifying N1 possible actions of a first party in a first state of the first party;
• sampling a possible action out of the N1 possible actions in the first state of the first party with a first sampling probability;
• identifying N2 possible actions of the first party in a second state of the first party, wherein the first state of the first party is closer to a beginning state of an imperfect information game (IIG) than the second state of the first party;
• sampling a possible action out of the N2 possible actions in the second state of the first party with a second sampling probability, wherein the first sampling probability is less than the second sampling probability;
• and
• performing the CFR based on the possible action out of the N1 possible actions in the first state of the first party and the possible action out of the N2 possible actions in the second state of the first party.

A computer-implemented system, comprising:

• one or more computers;
• and
• one or more computer memory devices interoperably coupled with the one or more computers and having tangible, non-transitory, machine-readable media storing one or more instructions that, when executed by the one or more computers, perform one or more operations comprising:
• identifying N1 possible actions of a first party in a first state of the first party;
• sampling a possible action out of the N1 possible actions in the first state of the first party with a first sampling probability;
• identifying N2 possible actions of the first party in a second state of the first party, wherein the first state of the first party is closer to a beginning state of an imperfect information game (IIG) than the second state of the first party;
• sampling a possible action out of the N2 possible actions in the second state of the first party with a second sampling probability, wherein the first sampling probability is less than the second sampling probability;
• and
• performing a counterfactual regret minimization (CFR) based on the possible actions out of the N1 possible action in the first state of the first party and the possible action out of the N2 possible actions in the second state of the first party.

An apparatus for performing counterfactual regret minimization (CFR) for strategy searching in strategic interaction between two or more parties, comprising:

• a first identifying module for identifying N1 possible actions of a first party in a first state of the first party;
• a first sampling module for sampling a possible action out of the N1 possible actions in the first state of the first party with a first sampling probability;
• a second identifying module for identifying N2 possible actions of the first party in a second state of the first party, wherein the first state of the first party is closer to a beginning state of an imperfect information game (IIG) than the second state of the first party;
• a second sampling module for sampling a possible action out of the N2 possible actions in the second state of the first party with a second sampling probability, wherein the first sampling probability is less than the second sampling probability;
• and
• a processing module for performing the CFR based on the possible action out of the N1 possible action in the first state of the first party and the possible action out of the N2 possible actions in the second state of the first party.