Abstract: A non-transitory computer-readable recording medium stores a trading program for causing a computer to execute a process including: acquiring a number of sell orders for each of sell limits and a number of buy orders for each of buy limits; executing one of pairings of one of the sell orders and one of the buy orders in which one of the sell limits of the one of the sell orders is equal to or lower than one of the buy limits of the one of the buy orders, among the pairings of the sell orders and the buy orders, based on the acquired number of the sell orders for each of the sell limits and the acquired number of the buy orders for each of the buy limits; and resolving an execution price for each of executions.

Abstract: A non-transitory computer-readable recording medium stores a program for causing a computer to execute a process, the process includes setting, based on a sell order count included in information on a sell order, a first array that has elements corresponding to a first section of sell order counts with which a contract is available and a second section of sell order counts with which a contract is unavailable, setting, based on a buy order count included in information on a buy order, a second array that has elements corresponding to a third section of buy order counts with which a contract is available and a fourth section of buy order counts with which a contract is unavailable, and identifying sell orders and buy orders to be contract targets based on the information set in the first array and the second array.

Abstract: A non-transitory computer-readable recording medium stores a program for causing a computer to execute a process, the process includes acquiring order information including at least a sell order count for each sell limit price, a buy order count for each buy limit price, a money amount designation sell order of designating a total amount of sell prices, and a money amount designation buy order of designating a total amount of buy prices, calculating, for each first/second price in sell/buy orders, a first/second contract-available count based on a sell/buy order count with the sell/buy limit price equal to or higher/lower than the first/second price and a quantity for selling/buying in the total amount designated by the money amount designation sell/buy order at the first/second price, and determining a contract price based on the calculated first and second contract-available counts for each price.

Abstract: A non-transitory computer-readable recording medium stores a contract program causing a computer to execute a process including: setting, for accepted sell order and buy order, information based on the accepted sell order and buy order to an element of one array specified by counting an order count of one order of the sell order and the buy order as a plus, and counting an order count of the other order of the sell order and the buy order as a minus; and specifying an order to be a contract target among the accepted sell order and buy order, based on the information set in the one array.

Abstract: A non-transitory computer-readable recording medium stores a contract program causing a computer to execute a process including: setting, for each of a sell order and a buy order having a condition that a contract count is designated, a first polynomial having a contract count designated under the condition of one order of the sell order and the buy order as a positive exponent, and a second polynomial having a contract count designated under the condition of the other order of the sell order and the buy order as a negative exponent; representing an order status in which the sell order and the buy order are combined, with one polynomial on a finite field by a product of the first polynomial and the second polynomial; and specifying a sell order and a buy order for making a contract based on the one polynomial on the finite field representing the order status.

Abstract: A recording medium stores a program causing a computer to execute a process including: setting, for each order having a condition that a contract count is designated, a polynomial having a contract count under the condition; representing an order status in which the orders are combined, with a polynomial on a finite field having a remainder obtained by dividing a coefficient of each term in a polynomial obtained by multiplying the polynomials corresponding to the orders; updating the polynomial on the finite field to a polynomial on a finite field representing an order status after a first order is combined, by multiplying the polynomial by a polynomial corresponding to the first order; and detecting an error in the polynomial after the update when a coefficient which is not 0 of a term in the polynomial before the update is 0 in the polynomial.

Abstract: A non-transitory computer-readable recording medium stores an execution program for causing a computer to execute a process, the process includes setting information based on an order sequence and a number of orders regarding an order to a first array, and convolving a second array that corresponds to an order condition in which prices at multiple stages are set depending on the number of orders to the first set array using a Try-And-Clean-Up (TACU) algorithm.

Abstract: A non-transitory computer-readable recording medium stores an execution program for causing a computer to execute a process, the process includes accepting orders to each of which a condition of a number of executions is designated, setting the accepted orders as respective polynomials using the designated number of executions in the condition as a degree, representing an order status in which the accepted orders are combined as a polynomial on a finite field according to a product of the polynomials, dividing the polynomial on the finite field by a polynomial that corresponds to an order to be executed or canceled, and updating the polynomial on the finite field to a resulted polynomial after the division.

Abstract: A non-transitory computer-readable recording medium stores an execution program for causing a computer to execute a process, the process includes accepting orders to each of which a condition of a number of executions is designated, setting the accepted orders as respective polynomials using the designated number of executions in the condition as a degree, performing Fourier transform on each of the polynomials, performing convolution calculation on the polynomials after the Fourier transform, and performing Fourier inverse transform on a calculation result of the convolution calculation to obtain a polynomial on a finite field according to a product of the polynomials, the polynomial on the finite field representing an order status in which the accepted orders are combined.

Abstract: A non-transitory computer-readable recording medium stores a transaction program for causing a computer to execute processing including: acquiring a selling limit and buying limit for each contract; creating, on the basis of a difference between the acquired selling limit and a next transaction price and a difference between the next transaction price and the acquired buying limit, a dissatisfaction function that represents dissatisfaction of an investor for each contract with the next transaction price as a variable; mating a total dissatisfaction function for all contracts on the basis of the dissatisfaction function created for each contract; and determining the next transaction price on the basis of a value of the created total dissatisfaction function.

Abstract: A recording medium stores a transaction program for causing a computer to execute processing including: creating, on the basis of a difference between a selling limit and a next transaction price and a difference between the next transaction price and a buying limit, a dissatisfaction function that represents dissatisfaction of an investor for each contract with the next transaction price as a variable; creating a total dissatisfaction function for all contracts on the basis of the dissatisfaction function created for each contract; specifying, among values of the created total dissatisfaction functions, a value from a predetermined number from a smallest value; and determining the optimum number of contracts on the basis of a plurality of the values from the predetermined number obtained by executing the processing of creating the dissatisfaction function, creating the total dissatisfaction function, and specifying the value from the predetermined number, while changing the number of contracts.

Abstract: A non-transitory computer-readable recording medium stores a trading program for causing a computer to execute a process including: acquiring a number of sell orders for each of sell limits and a number of buy orders for each of buy limits; executing one of pairings of one of the sell orders and one of the buy orders in which one of the sell limits of the one of the sell orders is equal to or lower than one of the buy limits of the one of the buy orders, among the pairings of the sell orders and the buy orders, based on the acquired number of the sell orders for each of the sell limits and the acquired number of the buy orders for each of the buy limits; and resolving an execution price for each of executions.

Abstract: A non-transitory computer-readable recording medium stores a trading program far causing a computer to execute a process including: acquiring a number of sell orders for each of sell limits and a number of buy orders for each of buy limits; executing one of pairings of one of the sell orders and one of the buy orders in which one of the sell limits of the one of the sell orders is equal to or lower than one of the buy limits of the one of the buy orders, among the pairings of the sell orders and the buy orders, based on the acquired number of the sell orders for each of the sell limits and the acquired number of the buy orders for each of the buy limits; and resolving an execution price for each of executions.