An information processing apparatus optimizes an action in a transition model in which a number of objects in each state transits according to the action. A cost constraint acquisition unit acquires multiple cost constraints including one that constrains a total cost of the action over at multiple timings and/or multiple states. A processing unit assumes action distribution in each state at each timing as a decision variable in an optimization problem and maximizes an objective function subtracting a term based on an error between an actual number of objects with the action in each state at each timing and an estimated number of objects in each state at each timing based on state transition by the transition model, from a total reward in a whole period, satisfying the multiple cost constraints. An output unit outputs the action distribution in each state at each timing that maximizes the objective function.
Please help me write a proper abstract based on the patent claims. CLAIM: 1. A computer implemented method of optimizing an action in a transition model in which a number of objects in each state transits according to the action, the method comprising: acquiring, with a processing device, multiple cost constraints including a cost constraint that constrains a total cost of the action over at least one of multiple timings and multiple states; assuming action distribution in each state at each timing as a decision variable in an optimization problem and maximize an objective function subtracting a term based on an error between an actual number of objects with the action in each state at each timing and an estimated number of objects in each state at each timing based on state transition by the transition model, from a total reward in a whole period, while satisfying the multiple cost constraints; and outputting the action distribution in each state at each timing that maximizes the objective function. 2. The method of claim 1, further comprising assuming the action distribution and a range of the error in each state at each timing as the variable of the optimization problem, and maximizes the objective function. 3. The method of claim 1, further comprising maximizing the objective function subtracting a term weighting the error from the total reward in the whole period. 4. The method of claim 1, further comprising, with respect to an actual number of objects with an action in each state at one timing, calculating a population of objects that transit to each state at the one timing by state transition based on action distribution in each state at a timing previous to the one timing, and assuming the population of objects as an estimated number of objects. 5. The method of claim 1, further comprising maximizing the objective function by further using a constraint condition that a total of the actual number of objects with the action in each state at each timing is equal to a predefined total number of objects. 6. The method of claim 1, further comprising acquiring a cost constraint that constrains a total cost of every action. 7. The method of claim 1, further comprising: acquiring training data that records response to an action with respect to multiple objects; and generating the transition model based on the training data. 8. The method of claim 7, further comprising classifying the multiple objects included in the training data into each state, and calculating a state transition probability based on to which state an object of each state transits according to the action. 9. The method of claim 8, further comprising generating a state vector of an object based on an action and response to each of the multiple objects included in the training data, and classifying the multiple objects into multiple states by classifying the multiple objects by an axis in which prediction accuracy when performing regression of a future reward by the state vector is maximum or by an axis in which variance of the state vector is maximum. 10. The method of claim 7, further comprising: calculating transition probability distribution of an object state based on the training data; and simulating state transition based on the transition probability distribution, according to the action distribution in each state at each timing that is output by the output unit.