Negotiation device, negotiation method, and negotiation program

Abstract

This negotiation device comprises: an estimation means for referring to a proposal Xn -1 presented from a first negotiation subject to a second negotiation subject in an (n-1)th (where n is a natural number equal to or greater than 2) round, and estimating a satisfaction level function Sn (X) representing the satisfaction level of the second negotiation subject with respect to the proposal X; a setting means for setting an objective function Fn (X) that includes a profit function Y (X) representing the profit of the first negotiation subject with respect to the proposal X, and the satisfaction level function Sn (X) estimated by the estimation means; and a calculation means for using the objective function Fn (X) set by the setting means to calculate a proposal Xn to be presented from the first negotiation subject to the second negotiation subject in the n-th round.

Description

Negotiation device, negotiation method, and negotiation program

[0001] The present invention relates to a negotiation device, a negotiation method, and a negotiation program.

[0002] Technologies are being developed that use computers to automatically perform various negotiations that have traditionally been performed by humans. For example, Patent Literature 1 discloses a technology in which negotiations that have traditionally been performed between an orderer and a contractor are automatically performed between an order-placing negotiating device and an order-receiving negotiating device.

[0003] International Publication No. 2021 / 033302

[0004] The order-receiving-side negotiation device described in Patent Document 1 includes an order-receiving-side utility calculation unit that calculates the order-receiving-side utility value for each negotiation candidate, and an order-receiving-side utility estimation unit that estimates the order-receiving-side utility value for each negotiation candidate. The order-receiving-side negotiation device described in Patent Document 1 aims to reduce the number of negotiations by selecting a negotiation candidate to be provided to the order-receiving-side from multiple negotiation candidates based on the order-receiving-side utility value and the order-receiving-side utility value. In negotiations where the number of negotiations is limited in advance, reducing the number of negotiations means improving the negotiation success rate.

[0005] However, in the order-receiving-side negotiation device described in Patent Document 1, the algorithm (i.e., utility function) for estimating the utility value of the supplier for each negotiation candidate is constant. Therefore, in a situation where the satisfaction level of the supplier for each negotiation candidate changes from round to round, the reduction in the number of negotiations may be insufficient.

[0006] The present disclosure has been made in consideration of the above-mentioned problems, and an exemplary purpose thereof is to realize a negotiation technique that can reduce the number of negotiations.

[0007] The negotiation device according to an exemplary aspect of the present disclosure is configured to: ｎ－１ A satisfaction function S representing the satisfaction of the second negotiating entity with the proposal X with reference to ｎ(X), and a profit function Y(X) representing the profit of the first negotiating entity for proposal X and a satisfaction function S estimated by the estimation means. ｎ (X) and the objective function F ｎ A setting means for setting (X), and an objective function F set by the setting means ｎ (X) to be presented from the first negotiating entity to the second negotiating entity in the n-th round. ｎ and a calculation means for calculating:

[0008] In a negotiation method according to an exemplary aspect of the present disclosure, at least one processor performs a process of calculating a proposal X presented by a first negotiating entity to a second negotiating entity in an n-1th round (n is a natural number equal to or greater than 2). ｎ－１ A satisfaction function S representing the satisfaction of the second negotiating entity with the proposal X with reference to ｎ (X), and the at least one processor estimates a profit function Y(X) representing the profit of the first negotiating entity for the proposal X and a satisfaction function S estimated in the estimation process. ｎ (X) and the objective function F ｎ A setting process for setting (X), and the at least one processor setting the objective function F ｎ (X) to be presented from the first negotiating entity to the second negotiating entity in the n-th round. ｎ and a calculation process for calculating:

[0009] A negotiation program according to an exemplary aspect of the present disclosure includes a program for causing at least one processor to receive a proposal X presented by a first negotiating subject to a second negotiating subject in an n-1th round (n is a natural number equal to or greater than 2). ｎ－１ A satisfaction function S representing the satisfaction of the second negotiating entity with the proposal X with reference to ｎ (X), and a profit function Y(X) representing the profit of the first negotiating entity for proposal X and a satisfaction function S estimated in the estimation process. ｎ (X) and the objective function F ｎ A setting process for setting (X), and an objective function F set in the setting process ｎ(X) to be presented from the first negotiating entity to the second negotiating entity in the n-th round. ｎ and a calculation process for calculating

[0010] According to an exemplary aspect of the present disclosure, an exemplary effect is achieved in that a negotiation technique that can reduce the number of negotiations can be realized.

[0011] FIG. 1 is a block diagram showing the configuration of a negotiation device according to the present disclosure. FIG. 2 is a flow diagram showing the flow of a negotiation method according to the present disclosure. FIG. 3 is a diagram showing an example of a satisfaction function according to the present disclosure. FIG. 4 is a block diagram showing the configuration of a negotiation device according to the present disclosure. FIG. 5 is a flow diagram showing the flow of a negotiation method according to the present disclosure. FIG. 6 is an example screen displayed on a display of a user terminal by a negotiation device according to the present disclosure. FIG. 7 is an example screen displayed on a display of a user terminal by a negotiation device according to the present disclosure. FIG. 8 is an example screen displayed on a display of a user terminal by a negotiation device according to the present disclosure. FIG. 9 is a block diagram showing the configuration of a computer functioning as a negotiation device according to the present disclosure.

[0012] The following are examples of embodiments of the present invention. However, the present invention is not limited to the exemplary embodiments shown below, and various modifications are possible within the scope of the claims. For example, embodiments obtained by appropriately combining the technologies (part or all of the products or methods) employed in the exemplary embodiments shown below may also be included in the scope of the present invention. Furthermore, embodiments obtained by appropriately omitting some of the technologies employed in the exemplary embodiments shown below may also be included in the scope of the present invention. Furthermore, the effects mentioned in the exemplary embodiments shown below are examples of effects expected in the exemplary embodiments, and do not define the scope of the present invention. In other words, embodiments that do not exhibit the effects mentioned in the exemplary embodiments shown below may also be included in the scope of the present invention.

[0013] [Definition of Terms] In the following description, a "negotiating entity" refers to, for example, an entity that has the ability to decide on an offer to present to another negotiating entity and the ability to decide whether to agree to an offer presented by another negotiating entity. A negotiating entity may be a device or a human. Furthermore, a "negotiating device" refers to, for example, a device that functions as a negotiating entity. A computer, a robot, or an autonomous vehicle are examples of a negotiating device.

[0014] Furthermore, in the following description, "negotiation" refers to, for example, the first negotiating party O1 and the second negotiating party O2 alternately presenting proposals to each other until the second negotiating party O2 agrees to the proposal X presented by the first negotiating party O1, or until the first negotiating party O1 agrees to the proposal X' presented by the second negotiating party O2. The proposal X' presented by the second negotiating party O2 to the first negotiating party O1 in response to the proposal from the first negotiating party O1 to the second negotiating party O2 is also called a "counteroffer."

[0015] Proposal X presented by the first negotiating party O1 to the second negotiating party O2, and proposal X' presented by the second negotiating party O2 to the first negotiating party O1 may be expressed by a single quantity (scalar) or by a set of multiple quantities (vector). Hereinafter, proposal X presented by the first negotiating party O1 to the second negotiating party O2 in the n-th round of negotiation will be referred to as "proposal X ｎ In the n-th round of negotiation, the proposal X' presented by the second negotiation party O2 to the first negotiation party O1 is written as "counterproposal X' ｎ " is also written.

[0016] [First Exemplary Embodiment] A first exemplary embodiment, which is an example of an embodiment of the present invention, will be described in detail with reference to the drawings. This exemplary embodiment is a basic form for each of the exemplary embodiments described below. Note that the scope of application of each technique employed in this exemplary embodiment is not limited to this exemplary embodiment. That is, each technique employed in this exemplary embodiment can also be employed in other exemplary embodiments included in the present disclosure, to the extent that no particular technical obstacles arise. Furthermore, each technique shown in the drawings referenced to explain this exemplary embodiment can also be employed in other exemplary embodiments included in the present disclosure, to the extent that no particular technical obstacles arise.

[0017] (Configuration of the Negotiation Device) The configuration of the negotiation device 1 will be described with reference to Fig. 1. Fig. 1 is a block diagram showing the configuration of the negotiation device 1.

[0018] The negotiation device 1 is a device that, as the first negotiation entity O1, conducts negotiations between a first negotiation entity O1 and a second negotiation entity O2. The second negotiation entity O2 may be a device or a human being.

[0019] 1, negotiation device 1 includes estimation unit 11, setting unit 12, and calculation unit 13. When negotiation device 1 is implemented by a computer having at least one processor, estimation unit 11, setting unit 12, and calculation unit 13 are each realized by at least one processor executing instructions of a program stored in a memory of the computer.

[0020] The estimation unit 11 estimates the proposal X to be presented by the first negotiation entity O1 to the second negotiation entity O2 in the n-1th round of negotiation. ｎ－１ If the second negotiating party O2 does not agree to the proposal X ｎ－１ Refer to the satisfaction function S ｎ (X) where the satisfaction function S ｎ (X) is a function that represents the satisfaction level of the second negotiating party O2 with the proposal X. The estimation unit 11 estimates the satisfaction level of the proposal X from the first negotiating party O1 to the second negotiating party O2 in the n-1th round of negotiation. ｎ－１In addition, a counterproposal X' from the second negotiating party O2 to the first negotiating party O1 in the n-1th round of negotiations ｎ－１ Refer to the satisfaction function S ｎ (X). The satisfaction function S ｎ Specific examples of (X) will be described later.

[0021] In addition, Proposal X ｎ－１ In the case where the second negotiating entity O2 has a function of presenting information indicating whether or not the second negotiating entity O2 will accept the proposal X to the first negotiating entity O1, the estimation unit 11 determines whether or not the second negotiating entity O2 will accept the proposal X based on this information. ｎ－１ This information can be used to determine whether the second negotiating party O2 has agreed to the counterproposal X' ｎ－１ may be included in

[0022] The setting unit 12 calculates the objective function F ｎ (X). The objective function F ｎ (X) is the profit function Y(X) representing the profit of the first negotiating entity O1 for the proposal X, and the satisfaction function S estimated by the estimation unit 11. ｎ (X) and the objective function F ｎ Specific examples of (X) will be described later.

[0023] The calculation unit 13 calculates the objective function F set by the setting unit 12. ｎ (X) to be presented from the first negotiating party O1 to the second negotiating party O2 in the n-th round of negotiation. ｎ The calculation unit 13 calculates the proposal X ｎ For example, the search range Ω ｎ A proposal X included in the objective function F ｎ The value of F ｎ (X) is the proposal X that maximizes (X). In this case, proposal X ｎ As an algorithm for calculating the above, for example, simulated annealing can be used.

[0024] As described above, according to the negotiation device 1, the satisfaction function S ｎ (X) is estimated for each round, and the estimated desirability function S ｎObjective function F including (X) ｎ (X) is set for each round. Therefore, even in a situation where the second negotiation party O2's satisfaction with the proposal X from the first negotiation party O1 changes from round to round, it is possible to present a proposal X that the second negotiation party O2 is likely to agree to. In other words, even in a situation where the second negotiation party O2's satisfaction with the proposal X from the first negotiation party O1 changes from round to round, it is possible to reduce the number of negotiations.

[0025] The negotiation device 1 may include an acquisition unit in addition to the above-mentioned means. The acquisition unit may acquire, for example, a counter-proposal X′ referred to by the estimation unit 11. ｎ－１ The negotiation device 1 may further include a providing unit in addition to the above-mentioned means. The providing unit may, for example, provide the proposal X calculated by the calculation unit 13. ｎ to the terminal used by the second negotiation entity O2.

[0026] In this case, the terminal used by the second negotiation entity O2 (hereinafter also referred to as the "user terminal") receives, for example, the proposal X ｎ The user terminal can display a screen showing the proposal X acquired from the negotiation device 1. ｎ The user terminal can print an image representing the proposal X acquired from the negotiation device 1. ｎ A sound representing the above can be output via a speaker.

[0027] The negotiation device 1 may also include a storage unit in addition to the above-mentioned means. The storage unit may store, for example, the proposal X calculated by the calculation unit 13 in the n-1th round. ｎ－１ is used to hold the value until it is referenced by the estimation unit 11 in the nth round.

[0028] (Flow of Negotiation Method) The flow of negotiation method S1 will be described with reference to Fig. 2. Fig. 2 is a flow chart showing the flow of negotiation method S1.

[0029] The negotiation method S1 is a method for conducting negotiations between a first negotiation entity O1 and a second negotiation entity O2, with the first negotiation entity O1 acting as the first negotiation entity O1. The negotiation method S1 is executed, for example, by a negotiation device 1. The second negotiation entity O2 may be a device or a human being.

[0030] 2, the negotiation method S1 includes an estimation process S11, a setting process S12, and a calculation process S13. The estimation process S11, the setting process S12, and the calculation process S13 are repeatedly executed for each round.

[0031] The estimation process S11 estimates the proposal X , which is presented by the first negotiation entity O1 to the second negotiation entity O2 in the n-1th round of negotiation. ｎ－１ If the second negotiating party O2 does not agree to the proposal X ｎ－１ Refer to the satisfaction function S ｎ The estimation process S11 is executed by, for example, the estimation unit 11 of the negotiation device 1. As described above, the satisfaction function S ｎ (X) is a function that represents the satisfaction level of the second negotiating party O2 with the proposal X. The estimation process S11 is a process of estimating the satisfaction level of the proposal X from the first negotiating party O1 to the second negotiating party O2 in the n-1th round of negotiation. ｎ－１ In addition, a counterproposal X' from the second negotiating party O2 to the first negotiating party O1 in the n-1th round of negotiations ｎ－１ Refer to the satisfaction function S ｎ (X) may be a process for estimating the satisfaction function S ｎ Specific examples of (X) will be described later.

[0032] The setting process S12 is the objective function F ｎ The setting process S12 is executed by, for example, the setting unit 12 of the negotiation device 1. The objective function F ｎ As described above, (X) is the profit function Y(X) representing the profit of the first negotiating entity O1 for the proposal X, and the satisfaction function S estimated in the estimation process S11. ｎ (X) and the objective function F ｎ Specific examples of (X) will be described later.

[0033] The calculation process S13 calculates the proposal X , which is presented by the first negotiation entity O1 to the second negotiation entity O2 in the n-th round of negotiation. ｎ The calculation process S13 is executed by, for example, the calculation unit 13 of the negotiation device 1. The proposal X calculated in the calculation process S13 ｎ For example, the search range Ω ｎ A proposal X included in the objective function F ｎ The value of F ｎ (X) is the proposal X that maximizes (X). In this case, proposal X ｎ As an algorithm for calculating the above, for example, simulated annealing can be used.

[0034] As described above, according to the negotiation method S1, the satisfaction function S ｎ (X) is estimated for each round, and the estimated desirability function S ｎ Objective function F including (X) ｎ (X) is set for each round. Therefore, the proposal X from the first negotiation entity O1 ｎ Even in a situation where the satisfaction of the second negotiation party O2 with the proposal X changes from round to round, the second negotiation party O2 is likely to agree to the proposal X. ｎ That is, the first negotiation entity O1 can present a proposal X ｎ Even in a situation where the second negotiation entity O2's satisfaction with the second negotiation entity O2 changes from round to round, the number of negotiations can be reduced.

[0035] The negotiation method S1 may include, in addition to the above-described processes, an acquisition process. The acquisition process may include, for example, acquiring the counter-proposal X′ referred to in the estimation process S11. ｎ－１ The negotiation method S1 may also include a providing process in addition to the above-described processes. The providing process may be, for example, a process for providing the proposal X calculated in the calculation process S13. ｎ to the terminal used by the second negotiation entity O2.

[0036] In this case, the terminal used by the second negotiation entity O2 (hereinafter also referred to as the "user terminal") receives, for example, the proposal X ｎThe user terminal can display an image representing the proposal X acquired from the negotiation device 1. ｎ The user terminal can print an image representing the proposal X acquired from the negotiation device 1. ｎ A sound representing the above can be output via a speaker.

[0037] (Specific example of objective function) The objective function F set in the setting unit 12 of the negotiation device 1 or in the setting process S12 of the negotiation method S1 is ｎ A specific example of (X) is shown in the following formula (1). As described above, Y(X) is a function that represents the benefit of the first negotiating entity O1 for proposal X, and S ｎ (X) is a function that represents the satisfaction of the second negotiating party O2 with the proposal X. １ (·) is an arbitrary function (preferably an increasing function), for example, log(·). ２ (•) is any function (preferably an increasing function), for example the identity function.

[0038] In the above formula (1), α and β are constants. For example, the constant α is the value of the proposal X presented by the first negotiation party O1 to the second negotiation party O2 in the first round of negotiation. １ is a constant determined according to, for example, proposal X １ Profit Y (X １ ) reciprocal 1 / Y(X １ ) As an example, the constant β is a constant determined depending on the second negotiation entity O2, and may be, for example, the satisfaction level of the second negotiation entity O2 assumed as the demand level. In this case, if the second negotiation entity O2 is a negotiation entity with a high demand level, the constant β is set to a relatively high value such as 90% or 100%, and if the second negotiation entity O2 is a negotiation entity with a low demand level, the constant β is set to a relatively low value such as 60% or 70%.

[0039] In addition, in the above formula (1), the coefficient w ｎ is the objective function F ｎ Desirability function S in (X) ｎ The weight of (X). Coefficient w ｎis preferably an increasing function of the number of rounds n. In other words, the coefficient w ｎ is the coefficient w in the n-1th round ｎ－１ As a result, the first negotiation entity O1 makes a proposal X ｎ This allows the second negotiation entity O2 to quickly converge to a proposal that the second negotiation entity O2 agrees to. As a result, it is possible to reduce the number of rounds required to reach a successful negotiation, or to increase the likelihood that the negotiation will be successful before the number of rounds reaches a predetermined maximum value.

[0040] In addition, when it is possible to evaluate the satisfaction of the second negotiating entity O2 with respect to the proposal X from k points of view (points of discussion) (k is a natural number of 2 or more), the objective function F ｎ In the following formula (2), S ｎｉ (X) is a function that represents the satisfaction of the second negotiation entity O2 with the proposal X with respect to the i-th viewpoint. １ (·) is an arbitrary function (preferably an increasing function), for example, log(·). ２ (·,·, . . . ,·) is an arbitrary function (preferably an increasing function for each variable), for example, max(·,·, . . . ,·).

[0041] (First Specific Example of Desirability Function) The satisfaction function S estimated by the estimation unit 11 of the negotiation device 1 or the estimation process S11 of the negotiation method S1 is ｎ A first specific example of (X) will be described with reference to Fig. 3. In this specific example, it is assumed that the proposal X presented by the first negotiation entity O1 to the second negotiation entity O2 is expressed by a single quantity (scalar). If the proposal X presented by the first negotiation entity O1 to the second negotiation entity O2 is expressed by a set of multiple quantities (vector), this specific example can be applied to each quantity.

[0042] As described above, in the estimation unit 11 of the negotiation device 1 or the estimation process S11 of the negotiation method S1, (1) the proposal X from the first negotiation entity O1 to the second negotiation entity O2 in the n-1th round of negotiation is calculated.ｎ－１ Refer to the satisfaction function S ｎ (X) can be calculated, and (2) Proposal X ｎ－１ In addition, a counterproposal X' from the second negotiating party O2 to the first negotiating party O1 in the n-1th round of negotiations ｎ－１ Refer to the satisfaction function S ｎ (X) can also be calculated.

[0043] In the former case, the satisfaction function S ｎ Proposal X calculated using (X) ｎ－１ Satisfaction S ｎ (X ｎ－１ ) is a predetermined satisfaction function S ０ Proposal X calculated using (X) ｎ－１ Satisfaction S ０ (X ｎ－１ A specific example of estimating the desirability function Sn(X) so that it is greater than .

[0044] In FIG. 3, the satisfaction function S ２ (X) is the proposal X in the first round １ 1 is a specific example of the satisfaction function estimated in the second round when the second negotiating party O2 does not agree to the above. ３ (X) is proposal X in the second round ２ 1 is a specific example of the satisfaction function estimated in the third round when the second negotiating party O2 does not agree to the above. ０ (X) is a specific example of a predetermined satisfaction function, for example, when the proposal X is the maximum value X max When the first negotiating party takes the most advantageous position, the satisfaction S reaches the minimum value S min (for example, 40%), and proposal X is the minimum value X min When the first negotiating party takes the most unfavorable option, the satisfaction level S reaches the maximum value S max (for example, 100%). Hereinafter, the proposal X is the minimum value X min and the satisfaction level S is the minimum value S min The point at which the value is 0 is referred to as "reference point O."

[0045] Desirability function S２ (X) is estimated, for example, by the following procedure: First, if proposal X is the first round proposal X １ and the satisfaction level S is the satisfaction level function S ０ Proposal X estimated using (X) １ Satisfaction S ０ (X １ ) and take point P1. Then, if proposal X is the first round proposal X, １ and the satisfaction level S is the maximum value S max Next, the midpoint R1 between points P1 and Q1 is taken. Finally, the linear function whose graph passes through both the midpoint R1 and the reference point O is used as the satisfaction function S estimated in the second round. ２ Let's call it (X).

[0046] Desirability function S ３ (X) is the satisfaction function S ２ (X) is estimated by the same procedure as (X). That is, first, proposal X is estimated by the second round proposal X. ２ and the satisfaction level S is the satisfaction level function S ０ Proposal X estimated using (X) ２ Satisfaction S ０ (X ２ ) and take point P2. Then, if proposal X is the second round proposal X, ２ and the satisfaction level S is the maximum value S max Next, the midpoint R2 between points P2 and Q2 is taken. Finally, the linear function whose graph passes through both the midpoint R2 and the reference point O is used as the satisfaction function S estimated in the third round. ３ Let's call it (X).

[0047] Desirability function S in the 4th, 5th, ... rounds ４ (X), S ５ (X), . . . are estimated in a similar manner.

[0048] (Second Specific Example of Desirability Function) The satisfaction function S estimated in the estimation unit 11 of the negotiation device 1 or the estimation process S11 of the negotiation method S1 is ｎA second specific example of (X) will be described with reference to Fig. 4. In this example, it is assumed that the proposal X presented by the first negotiation entity O1 to the second negotiation entity O2 is expressed by a single quantity (scalar). If the proposal X presented by the first negotiation entity O1 to the second negotiation entity O2 is expressed by a set of multiple quantities (vector), this specific example can be applied to each quantity.

[0049] As described above, in the estimation unit 11 of the negotiation device 1 or the estimation process S11 of the negotiation method S1, (1) the proposal X from the first negotiation entity O1 to the second negotiation entity O2 in the n-1th round of negotiation is calculated. ｎ－１ Refer to the satisfaction function S ｎ (X) can be calculated, and (2) Proposal X ｎ－１ In addition, a counterproposal X' from the second negotiating party O2 to the first negotiating party O1 in the n-1th round of negotiations ｎ－１ Refer to the satisfaction function S ｎ (X) can also be calculated.

[0050] In the latter case, the satisfaction function S ｎ Proposal X calculated using (X) ｎ－１ Counterproposal X' presented by the second negotiating party in response to ｎ－１ Satisfaction S ｎ (X' ｎ－１ ) is the satisfaction function S ｎ Proposal X calculated using (X) ｎ－１ Satisfaction S ｎ (X ｎ－１ ) so that the satisfaction function S ｎ A specific example of estimating (X) will be described.

[0051] In FIG. 4, the satisfaction function S ２ (X) is the proposal X in the first round １ is a specific example of the satisfaction function estimated in the second round when the second negotiation entity O2 rejects the ３ (X) is proposal X in the second round ２ is the satisfaction function estimated in the third round when the second negotiating party O2 rejects

[0052] Desirability function S ２ (X) is estimated, for example, by the following procedure: First, if proposal X is the first round proposal X １ and the satisfaction level S is a predetermined first constant S low (For example, 40%). Then, let us consider the point P1 where proposal X is the first round proposal X. １ Counterproposal X' from the second negotiating party O2 to １ and the satisfaction level S is a predetermined second constant S high (For example, 80%). Here, the first constant S low and a second constant S high There is a relationship S between low <S high Finally, the linear function whose graph passes through both points P1 and Q1 is defined as the satisfaction function S estimated in the second round. ２ Let's call it (X).

[0053] Desirability function S ３ (X) is the satisfaction function S ２ (X) is estimated by the same procedure as (X). That is, first, proposal X is estimated by the second round proposal X. ２ and the satisfaction level S is a predetermined first constant S low (For example, 40%). Then, if proposal X is the first round proposal X, １ Counterproposal X' from the second negotiating party O2 to ２ and the satisfaction level S is a predetermined second constant S high Finally, a linear function whose graph passes through both points P1 and Q1 is taken as the satisfaction function S estimated in the third round. ３ Let's call it (X).

[0054] Desirability function S in the 4th, 5th, ... rounds ４ (X), S ５ (X), . . . are estimated in a similar manner.

[0055] Second Exemplary Embodiment A second exemplary embodiment, which is an example of an embodiment of the present invention, will be described in detail with reference to the drawings. Components having the same functions as those described in the above exemplary embodiment will be denoted by the same reference numerals, and their description will be omitted as appropriate. The scope of application of each technique employed in this exemplary embodiment is not limited to this exemplary embodiment. That is, each technique employed in this exemplary embodiment can also be employed in other exemplary embodiments included in the present disclosure, to the extent that no particular technical hindrance occurs. Furthermore, each technique shown in each drawing referenced to describe this exemplary embodiment can also be employed in other exemplary embodiments included in the present disclosure, to the extent that no particular technical hindrance occurs.

[0056] (Configuration of Negotiation Device) The configuration of negotiation device 1A will be described with reference to Fig. 5. Fig. 5 is a block diagram showing the configuration of negotiation device 1A. Negotiation device 1A includes search range creation unit 14, initial proposal creation unit 15, and search range setting unit 16, in addition to the above-mentioned estimation unit 11, setting unit 12, and calculation unit 13. When negotiation device 1A is implemented by a computer having at least one processor, estimation unit 11, setting unit 12, calculation unit 13, search range creation unit 14, initial proposal creation unit 15, and search range setting unit 16 are each realized by at least one processor executing instructions of a program stored in a memory provided in the computer.

[0057] The estimation unit 11, the setting unit 12, and the calculation unit 13 are the same as those described in the first exemplary embodiment. The search range creation unit 14, the initial proposal creation unit 15, and the search range setting unit 16 will be described below.

[0058] The search range creation unit 14 receives the offer X' from the second negotiation entity O2 prior to the negotiation. ０ Based on this, the search range Ω １ It is a means to create.

[0059] If a proposal X is represented by a single quantity x, then the search range Ω １ is, for example, the range of quantity x [x min , x max]. Application X' ０ In addition to the quantity x, the search range creation unit 14 may include meta-information about the second negotiating entity O2 and meta-information about the quantity x. min , x max ] with reference to meta information about the second negotiation entity O2 and / or meta information about the quantity x. The search range creation unit 14 transmits the meta information about the second negotiation entity O2 and / or meta information about the quantity x to the external database, and in response thereto, creates the search range [x min , x max ] may be obtained from an external database.

[0060] If the proposal X is expressed by a set of multiple quantities (x(1), x(2), ... x(m)), the search range Ω １ For example, the range [x min (i), x max (i)] and the direct product [x min (1), x max (1)] × [x min (2), x max (2) ]×…×[x min (m), x max (m)]. In addition to each quantity x(i), the offer X'0 may include meta-information about the second negotiating entity O2 and meta-information about each quantity x(i). In this case, the search range creation unit 14 creates a search range [x min (i), x max The search range creation unit 14 sets the search range [x min (i), x max (i)] may be obtained from an external database.

[0061] The initial proposal creation unit 15 receives the offer X'0 obtained from the second negotiation entity O2 prior to the negotiation and the search range Ω created by the search range creation unit 14. １Based on the above, the first negotiation party O1 presents a proposal X to the second negotiation party O2 in the first round of negotiation. １ It is a means to create.

[0062] When the proposal X is expressed by a single quantity x, the initial proposal creation unit 15 sets the value of the quantity x to, for example, the following set proposal X １ That is, the initial proposal creating unit 15 creates the value of the quantity x in the application X' ０ Determine whether the value of quantity x is specified in the order X' ０ If the quantity x is not specified in the search range [x min , x max The value of the quantity x set here is set to a value included in the search range [x min , x max ] is the most advantageous value for the first negotiating entity O1. On the other hand, the value of the quantity x is ０ If the initial proposal creating unit 15 specifies the application X' ０ The value specified in the search range Ω １ It is determined whether the application X' is included in the application X'. ０ The value specified in the search range [x min , x max ], the initial proposal making unit 15 sets the value of quantity x to application X' ０ On the other hand, application X' is set to the value specified in ０ The value specified in the search range [x min , x max ], the initial proposal making unit 15 sets the value of the quantity x within the search range [x min , x max The value of the quantity x set here is set to a value included in the search range [x min , x max ], the value of application X' ０ is the value closest to the specified value in

[0063] When proposal X is expressed by a set of multiple quantities (x(1), x(2), ..., x(m)), the initial proposal creation unit 15 creates proposal X in which the value of each quantity x(i) is set as follows, for example: １ That is, the initial proposal creating unit 15 creates the value of the quantity x(i) in the application X' ０ Determine whether the value of quantity x(i) is specified in the order X' ０ If the value of quantity x(i) is not specified in the search range [x min (i), x max The value of the quantity x(i) set here is set to a value included in the search range [x min (i), x max On the other hand, the value of quantity x(i) is the most advantageous value for the first negotiating entity O1 among the values ​​included in offer X' ０ If the initial proposal creating unit 15 specifies the application X' ０ The value specified in the search range [x min (i), x max (i)]. ０ The value specified in the search range [x min (i), x max (i)], the initial proposal making unit 15 sets the value of quantity x(i) to application X' ０ On the other hand, application X' is set to the value specified in ０ The value specified in the search range [x min (i), x max (i)], the initial proposal making unit 15 sets the value of the quantity x(i) within the search range [x min (i), x max The value of the quantity x(i) set here is set to a value included in the search range [x min (i), x max (i)], the value of application X' ０ is the value closest to the specified value in

[0064] The search range setting unit 16 sets the search range Ω created by the search range creation unit 14. １, and a counterproposal X' from the second negotiating party O2 to the first negotiating party O1 in the n-1th round of negotiation. ｎ－１ Based on this, the search range Ω ｎ The calculation unit 13 is a means for setting the proposal X to be presented from the first negotiation entity O1 to the second negotiation entity O2 in the n-th round of negotiation. ｎ The search range Ω set by the search range setting unit 16 is ｎ A proposal X included in the objective function F ｎ The value of F ｎ Calculate the proposal X that maximizes (X).

[0065] A proposal X is represented by a single quantity x and a search range Ω １ is the range of quantity x [x min , x max ], the search range setting unit 16 sets the search range Ω as follows, for example: ｎ That is, we set the counterproposal X' ｎ－１ is the range of quantity x [x' min , x' max ], the search range setting unit 16 sets the range [x' min , x' max ] to search range Ω ｎ Set the intersection [x min , x max ]∩[x' min , x' max On the other hand, counterproposal X' ｎ－１ is expressed by the value x' of the quantity x, the search range setting unit 16 defines a range [x' min , x' max ] (for example, [x'-α, x'+α]) to find the search range Ω ｎ Set the intersection [x min , x max ]∩[x' min , x' max ].

[0066] A proposal X is expressed by a number of quantities x(1), x(2), ..., x(m), and a search range Ω １ is the range of each quantity x(i) [x min (i), x max(i)], the search range setting unit 16 sets the search range Ω as follows, for example: ｎ That is, we set the counterproposal X' ｎ－１ is the range [x' of each quantity x(i) min (i), x' max (i)], the search range setting unit 16 sets the range [x' min (i), x' max (i)] to search range Ω ｎ Set the intersection [x min (i), x max (i)]∩[x' min (i), x' max (i)]. On the other hand, the counterproposal X' ｎ－１ is expressed by the value x'(i) of each quantity x(i), the search range setting unit 16 determines the range [x' min (i), x' max (i)] (for example, [x'(i)-α, x'(i)+α]) to find the search range Ω ｎ Set the intersection [x min (i), x max (i)]∩[x'(i) min , x′(i) max ] and set it to the Cartesian product.

[0067] As described above, according to the negotiation device 1A, the search range Ω ｎ is the counterproposal X' from the second negotiating party O2. ｎ－１ Therefore, the proposal X that the second negotiation party O2 is more likely to agree to is set for each round according to the ｎ In other words, the number of negotiations can be further reduced.

[0068] The negotiation device 1A may include an acquisition unit in addition to the above-mentioned means. The acquisition unit may acquire, for example, the offer X' referred to by the search range creation unit 14. ０ , and the counter-proposal X′ referred to by the estimation unit 11 and the search range setting unit 16 ｎ－１ The initial proposal creation unit 15 is used to acquire the proposal X from the terminal used by the second negotiation entity O2. The negotiation device 1A may further include a providing unit in addition to the above-mentioned means. The providing unit may, for example, acquire the proposal X created by the initial proposal creation unit 15.１ , and the proposal X calculated by the calculation unit 13 ｎ to the terminal used by the second negotiation entity O2.

[0069] In this case, the terminal used by the second negotiation entity O2 (hereinafter also referred to as the "user terminal") transmits, for example, the proposal X acquired from the negotiation device 1A. １ , X ｎ The user terminal can display an image representing the proposal X acquired from the negotiation device 1A on the display. １ , X ｎ The user terminal can print an image representing the proposal X acquired from the negotiation device 1. １ , X ｎ A sound representing the above can be output via a speaker.

[0070] Furthermore, the negotiation device 1A may include a storage unit in addition to the above-mentioned means. The storage unit may store, for example, the proposal X calculated by the calculation unit 13 in the n-1th round. ｎ－１ is used to hold the search range Ω generated by the search range generation unit 14 in the first round until it is referenced by the estimation unit 11 in the n-th round. １ is used to hold the value until it is referenced by the calculation unit 13 in the nth round.

[0071] (Flow of Negotiation Method) The flow of negotiation method S1A will be described with reference to FIG. 6. FIG. 6 is a flow chart showing the flow of negotiation method S1A. Negotiation method S1A includes a search range creation process S14, an initial proposal creation process S15, and a search range setting process S16, in addition to the above-mentioned estimation process S11, setting process S12, and calculation process S13. When negotiation method S1A is performed by a computer having at least one processor, the estimation process S11, setting process S12, calculation process S13, search range creation process S14, initial proposal creation process S15, and search range setting process S16 are each realized by at least one processor executing instructions of a program stored in a memory provided in the computer.

[0072] The estimation process S11, the setting process S12, and the calculation process S13 are the same as those described in the first exemplary embodiment. The search range creation process S14, the initial proposal creation process S15, and the search range setting process S16 will be described below.

[0073] The search range creation process S14 is a process of creating a search range by using the offer X' obtained from the second negotiation entity O2 prior to the negotiation. ０ Based on this, the search range Ω １ The search range creation process S14 is executed, for example, by the search range creation unit 14 of the negotiation device 1A. A specific example of the search range creation process S14 has already been described as an example of the operation of the search range creation unit 14, and therefore a description thereof will be omitted here.

[0074] The initial proposal creation process S15 is a process of creating an initial proposal based on the offer X' obtained from the second negotiating entity O2 prior to the negotiation. ０ , and the search range Ω created in the search range creation process S14 １ Based on the above, the first negotiation party O1 presents a proposal X to the second negotiation party O2 in the first round of negotiation. １ The initial proposal creation process S15 is executed, for example, by the initial proposal creation unit 15 of the negotiation device 1A. A specific example of the initial proposal creation process S15 has already been described as an example of the operation of the initial proposal creation unit 15, and therefore a description thereof will be omitted here.

[0075] The search range setting process S16 is a process for setting the search range Ω created in the search range creation process S14. １ , and a counterproposal X' from the second negotiating party O2 to the first negotiating party O1 in the n-1th round of negotiation. ｎ－１ Based on this, the search range Ω ｎ The search range setting process S16 is executed, for example, by the search range setting unit 16 of the negotiation device 1A. A specific example of the search range setting process S16 has already been described as an example of the operation of the search range setting unit 16, and therefore a description thereof will be omitted here.

[0076] As described above, according to the negotiation method S1A, the search range Ω ｎ is the counterproposal X' from the second negotiating party O2.ｎ－１ Therefore, the proposal X that the second negotiation party O2 is more likely to agree to is set for each round according to the ｎ In other words, the number of negotiations can be further reduced.

[0077] The negotiation method S1A may include, in addition to the above-described processes, an acquisition process. The acquisition process may include, for example, acquiring the offer X' referred to in the search range creation process S14. ０ , and the counter-proposal X′ referred to in the estimation unit process S11 and the search range setting process S16. ｎ－１ The negotiation method S1A may also include a providing process in addition to the above-described processes. The providing process may be, for example, a process for providing the proposal X created in the initial proposal creation process S15. １ , and the proposal X calculated in the calculation process S13 ｎ to the terminal used by the second negotiation entity O2.

[0078] In this case, the terminal used by the second negotiation entity O2 (hereinafter also referred to as the "user terminal") transmits, for example, the proposal X acquired from the negotiation device 1A. １ , X ｎ The user terminal can display an image representing the proposal X acquired from the negotiation device 1A on the display. １ , X ｎ The user terminal can print an image representing the proposal X acquired from the negotiation device 1. １ , X ｎ A sound representing the above can be output via a speaker.

[0079] (Application Example of the Negotiation Device) An application example of the negotiation device 1A will be described with reference to FIGS.

[0080] This application example applies the above-mentioned negotiation technique to a guaranteed factoring service. A guaranteed factoring service is a service provided by a guarantee company to a client company that sells products to multiple customers. The client company pays a guarantee fee to the guarantee company, and the guarantee company pays a guarantee to the client company if the client company is unable to collect accounts receivable from the sale due to reasons such as the bankruptcy of a client.

[0081] In the negotiations between the guarantee company as the first negotiating entity O1 and the customer company as the second negotiating entity, the guarantee fee and the guarantee limit for each buyer are the subjects of negotiation. Therefore, for example, if there are three buyers, namely, Company A, Company B, and Company C, the proposal X presented by the first negotiating entity O1 to the second negotiating entity O2 is ｎ , and a counterproposal X' presented by the second negotiating party O2 to the first negotiating party O1. ｎ is expressed by a four-dimensional vector whose elements are the guarantee fee, the guarantee limit for company A, the guarantee limit for company B, and the guarantee limit for company C. Furthermore, an offer X' is presented by the second negotiating party O2 to the first negotiating party O1 prior to the negotiation. ０ In addition to this four-dimensional vector, the table includes identification information of the customer companies, Company A, Company B, and Company C, as meta-information.

[0082] The guarantee fee is calculated by multiplying the total of the guarantee limits for each buyer by the guarantee fee rate. Conversely, the guarantee fee rate is calculated by dividing the guarantee fee by the total of the guarantee limits for each buyer. Therefore, instead of negotiating the guarantee fee, the guarantee fee rate may be negotiated.

[0083] 7 to 10 are examples of screens that the negotiation device 1A displays on the display of the terminal (hereinafter also referred to as "user terminal") used by the second negotiation entity O2.

[0084] The negotiation device 1A receives the offer X' ０ When the application X' is acquired from the user terminal, ０ A screen showing the contents of Application X' is displayed on the display of the user terminal. ０If the guarantee limit for company A is 12 million yen, the guarantee limit for company B is 9 million yen, and the guarantee limit for company C is 8 million yen, for example, the screen shown in FIG. 7 is displayed on the display of the user terminal.

[0085] The negotiation device 1A further performs the above-described search range creation process S14 and initial proposal creation process S15 to generate a proposal X to be presented by the first negotiation entity O1 to the second negotiation entity O2 in the first round. １ Then, the negotiation device 1A creates the created proposal X １ A screen showing the contents of Proposal X is displayed on the display of the user terminal. １ includes a guarantee limit for company A: 6 million yen, a guarantee limit for company B: 9 million yen, a guarantee limit for company C: 8 million yen, and a guarantee fee: 920,000 yen, for example, a screen shown in Fig. 8 is displayed on the display of the user terminal. Note that this screen may also include the total guarantee limit obtained by adding up the guarantee limits for each company, as shown in Fig. 8, and the guarantee fee rate obtained by dividing the guarantee fee by the total guarantee limit.

[0086] The screen shown in FIG. 8 shows a counterproposal X' from the second negotiating entity O2 to the first negotiating entity O1. １ For example, if the second negotiation entity O2 changes the guarantee fee from 920,000 yen to 800,000 yen, the screen shown in Fig. 9 is displayed on the display of the user terminal. In this case, the negotiation device 1A prepares a counterproposal X' including a guarantee limit of 6 million yen for company A, a guarantee limit of 9 million yen for company B, a guarantee limit of 8 million yen for company C, and a guarantee fee of 800,000 yen. １ Get.

[0087] The negotiation device 1A further performs the estimation process S11, the setting process S12, the search range setting process S16, and the calculation process S13 described above, thereby determining the proposal X to be presented by the first negotiation entity O1 to the second negotiation entity O2 in the second round. ２ Then, the negotiation device 1A creates the created proposal X ２ A screen showing the contents of Proposal X is displayed on the display of the user terminal. ２includes a guarantee limit for company A of 5.5 million yen, a guarantee limit for company B of 8.5 million yen, a guarantee limit for company C of 8 million yen, and a guarantee fee of 840,000 yen, for example, a screen shown in Fig. 10 is displayed on the display of the user terminal. Note that this screen may also include the total guarantee limit obtained by adding up the guarantee limits for each company, as shown in Fig. 10, and the guarantee fee rate obtained by dividing the guarantee fee by the total guarantee limit.

[0088] [Software Implementation Example] Some or all of the functions of the negotiation devices 1, 1A (hereinafter also referred to as "each of the above devices") may be implemented by hardware such as an integrated circuit (IC chip), or by software.

[0089] In the latter case, each of the above devices is realized by, for example, a computer that executes instructions of a program, which is software that realizes each function. An example of such a computer (hereinafter referred to as computer C) is shown in Figure 11. Figure 11 is a block diagram showing the hardware configuration of computer C that functions as each of the above devices.

[0090] The computer C includes at least one processor C1 and at least one memory C2. The memory C2 stores a program P for causing the computer C to function as each of the above-mentioned devices. In the computer C, the processor C1 reads and executes the program P from the memory C2, thereby realizing the functions of each of the above-mentioned devices.

[0091] The processor C1 may be, for example, a central processing unit (CPU), a graphics processing unit (GPU), a digital signal processor (DSP), a micro processing unit (MPU), a floating point number processing unit (FPU), a physics processing unit (PPU), a tensor processing unit (TPU), a quantum processor, a microcontroller, or a combination thereof. The memory C2 may be, for example, a flash memory, a hard disk drive (HDD), a solid state drive (SSD), or a combination thereof.

[0092] The computer C may further include a RAM (Random Access Memory) for expanding the program P during execution and for temporarily storing various data. The computer C may also include a communication interface for transmitting and receiving data to and from other devices. The computer C may also include an input / output interface for connecting input / output devices such as a keyboard, a mouse, a display, and a printer.

[0093] The program P can also be recorded on a non-transitory, tangible recording medium M that can be read by the computer C. Such a recording medium M can be, for example, a tape, a disk, a card, a semiconductor memory, or a programmable logic circuit. The computer C can acquire the program P via such a recording medium M. The program P can also be transmitted via a transmission medium. Such a transmission medium can be, for example, a communication network or broadcast waves. The computer C can also acquire the program P via such a transmission medium.

[0094] Furthermore, the functions of each of the devices may be realized by a single processor provided in a single computer, by multiple processors provided in a single computer working in cooperation, or by multiple processors provided in each of multiple computers working in cooperation. Furthermore, the programs for causing each of the devices to realize the functions may be stored in a single memory provided in a single computer, or may be distributed and stored in multiple memories provided in a single computer, or may be distributed and stored in multiple memories provided in each of multiple computers.

[0095] [Appendix A] This disclosure includes the techniques described in the following appendices. However, the present invention is not limited to the techniques described in the following appendices, and various modifications are possible within the scope of the claims.

[0096] (Appendix A1) Proposal X presented by the first negotiating party to the second negotiating party in the n-1th round (n is a natural number equal to or greater than 2) ｎ－１ A satisfaction function S representing the satisfaction of the second negotiating entity with the proposal X with reference to ｎ a profit function Y(X) representing the profit of the first negotiating party for proposal X and a satisfaction function S estimated by the estimation means; ｎ (X) and the objective function F ｎ A setting means for setting (X); and an objective function F set by the setting means. ｎ (X) to be presented from the first negotiating entity to the second negotiating entity in the n-th round. ｎ and a calculation means for calculating the value of the negotiation result.

[0097] (Appendix A2) The estimation means calculates the satisfaction function S ｎ Proposal X calculated using (X) ｎ－１ Satisfaction S ｎ (X ｎ－１ ) is a predetermined satisfaction function S ０ Proposal X calculated using (X) ｎ－１ Satisfaction S ０ (X ｎ－１ ) so that the satisfaction function Sｎ (X).

[0098] (Appendix A3) The estimation means calculates the satisfaction function S ｎ Proposal X calculated using (X) ｎ－１ Counterproposal X' presented by the second negotiating party in response to ｎ－１ Satisfaction S ｎ (X' ｎ－１ ) is the satisfaction function S ｎ Proposal X calculated using (X) ｎ－１ Satisfaction S ｎ (X ｎ－１ ) so that the satisfaction function S ｎ (X).

[0099] (Appendix A4) The satisfaction function S estimated by the estimation means ｎ (X) is a linear function of proposal X.

[0100] (Appendix A5) The objective function F set by the setting means ｎ (X) is the satisfaction function S ｎ (X) with coefficient w ｎ The setting means includes a term multiplied by a coefficient w used in the n-th round. ｎ The coefficient w used in the n-1th round ｎ－１ The negotiation device described in Appendix A4 is set as above.

[0101] (Appendix A6) Proposal X ｎ－１ Counterproposal X' presented by the second negotiating party in response to ｎ－１ See the search range Ω ｎ The calculation means further includes a search range setting means for setting a proposal X ｎ and the search range Ω set by the search range setting means ｎ The proposal X is included in the objective function F set by the setting means. ｎ The value of F ｎ Calculating a proposal X that maximizes (X).

[0102] (Appendix A7) Proposal X calculated by the calculation means ｎ to the terminal used by the second negotiating entity, the proposal X calculated by the calculation means ｎ The negotiation device according to any one of appendices A1 to A6, further comprising a providing means for displaying the above on a display of the terminal.

[0103] [Appendix B] This disclosure includes the techniques described in the following appendices. However, the present invention is not limited to the techniques described in the following appendices, and various modifications are possible within the scope of the claims.

[0104] (Appendix B1) Proposal X submitted by at least one processor from the first negotiating subject to the second negotiating subject in the n-1th round (n is a natural number equal to or greater than 2) ｎ－１ A satisfaction function S representing the satisfaction of the second negotiating entity with the proposal X with reference to ｎ an estimation process for estimating a profit function Y(X) representing the profit of the first negotiating entity for the proposal X and a satisfaction function S estimated by the estimation process; ｎ (X) and the objective function F ｎ a setting process for setting an objective function F (X), and the at least one processor sets the objective function F (X) in the setting process. ｎ (X) to be presented from the first negotiating entity to the second negotiating entity in the n-th round. ｎ and a calculation process for calculating the

[0105] (Appendix B2) In the estimation process, the at least one processor calculates a satisfaction function S ｎ Proposal X calculated using (X) ｎ－１ Satisfaction S ｎ (X ｎ－１ ) is a predetermined satisfaction function S ０ Proposal X calculated using (X) ｎ－１ Satisfaction S ０ (X ｎ－１ ) so that the satisfaction function S ｎ (X).

[0106] (Appendix B3) In the estimation process, the at least one processor calculates a satisfaction function S ｎ Proposal X calculated using (X) ｎ－１ Counterproposal X' presented by the second negotiating party in response to ｎ－１ Satisfaction S ｎ (X' ｎ－１ ) is the satisfaction function S ｎ Proposal X calculated using (X) ｎ－１ Satisfaction S ｎ (X ｎ－１ ) so that the satisfaction function S ｎ (X).

[0107] (Appendix B4) The satisfaction function S estimated in the estimation process ｎ (X) is a linear function of proposal X.

[0108] (Appendix B5) Objective function F set in the setting process ｎ (X) is the satisfaction function S ｎ (X) with coefficient w ｎ In the setting process, the at least one processor includes a term multiplied by a coefficient w used in the n-th round. ｎ The coefficient w used in the n-1th round ｎ－１ The negotiation method described in Appendix B4 is set as above.

[0109] (Appendix B6) The at least one processor ｎ－１ Counterproposal X' presented by the second negotiating party in response to ｎ－１ See the search range Ω ｎ In the calculation process, the at least one processor further includes a search range setting process for setting a proposal X ｎ and the search range Ω set in the search range setting process. ｎ The proposal X is included in the objective function F set in the setting process. ｎ The value of F ｎ Calculating a proposal X that maximizes (X).

[0110] (Appendix B7) The proposal X calculated by the at least one processor in the calculation process ｎ to the terminal used by the second negotiating entity, the proposal X calculated in the calculation process is ｎ The negotiation method according to any one of appendices B1 to B6, further comprising a providing process of displaying the above on a display of the terminal.

[0111] [Appendix C] This disclosure includes the techniques described in the following appendices. However, the present invention is not limited to the techniques described in the following appendices, and various modifications are possible within the scope of the claims.

[0112] (Appendix C1) A program for causing a computer to function as a negotiation device, the program causing the computer to perform the following: ｎ－１ A satisfaction function S representing the satisfaction of the second negotiating entity with the proposal X with reference to ｎ a profit function Y(X) representing the profit of the first negotiating party for proposal X and a satisfaction function S estimated by the estimation means; ｎ (X) and the objective function F ｎ A setting means for setting (X); and an objective function F set by the setting means. ｎ (X) to be presented from the first negotiating entity to the second negotiating entity in the n-th round. ｎ and a negotiation program that functions as a calculation means for calculating the

[0113] (Appendix C2) The estimation means calculates the satisfaction function S ｎ Proposal X calculated using (X) ｎ－１ Satisfaction S ｎ (X ｎ－１ ) is a predetermined satisfaction function S ０ Proposal X calculated using (X) ｎ－１ Satisfaction S ０ (X ｎ－１ ) so that the satisfaction function S ｎ (X) is estimated.

[0114] (Appendix C3) The estimation means calculates the satisfaction function S ｎ Proposal X calculated using (X) ｎ－１ Counterproposal X' presented by the second negotiating party in response to ｎ－１ Satisfaction S ｎ (X' ｎ－１ ) is the satisfaction function S ｎ Proposal X calculated using (X) ｎ－１ Satisfaction S ｎ (X ｎ－１ ) so that the satisfaction function S ｎ (X) is estimated.

[0115] (Appendix C4) The satisfaction function S estimated by the estimation means ｎ (X) is a linear function of proposal X.

[0116] (Appendix C5) The objective function F set by the setting means ｎ (X) is the satisfaction function S ｎ (X) with coefficient w ｎ The setting means includes a term multiplied by a coefficient w used in the n-th round. ｎ The coefficient w used in the n-1th round ｎ－１ The negotiation program set forth in Appendix C4 is set as above.

[0117] (Appendix C6) The computer is: ｎ－１ Counterproposal X' presented by the second negotiating party in response to ｎ－１ See the search range Ω ｎ The calculation means further functions as a search range setting means for setting a proposal X ｎ and the search range Ω set by the search range setting means ｎ The proposal X is included in the objective function F set by the setting means. ｎ The value of F ｎ Calculating a proposal X that maximizes (X).

[0118] (Appendix C7) The computer is configured to calculate the proposal X calculated by the calculation means. ｎ to the terminal used by the second negotiating entity, the proposal X calculated by the calculation means ｎ The negotiation program according to any one of appendices C1 to C6, further functioning as a providing means for displaying the above on a display of the terminal.

[0119] [Appendix D] This disclosure includes the techniques described in the following appendices. However, the present invention is not limited to the techniques described in the following appendices, and various modifications are possible within the scope of the claims.

[0120] (Appendix D1) A method for negotiating a proposal X submitted by a first negotiating subject to a second negotiating subject in an n-1th round (n is a natural number of 2 or more) is provided. ｎ－１ A satisfaction function S representing the satisfaction of the second negotiating entity with the proposal X with reference to ｎ (X), and estimating a profit function Y(X) representing the profit of the first negotiating entity for proposal X and a satisfaction function S estimated in the estimation process. ｎ (X) and the objective function F ｎ A setting process for setting (X), and an objective function F set in the setting process ｎ (X) to be presented from the first negotiating entity to the second negotiating entity in the n-th round. ｎ and a negotiation device that executes a calculation process to calculate the

[0121] The negotiation device may further include a memory, and the memory may store a program for causing the at least one processor to execute each of the processes.

[0122] (Appendix D2) In the estimation process, the at least one processor calculates a satisfaction function S ｎ Proposal X calculated using (X) ｎ－１ Satisfaction S ｎ (X ｎ－１ ) is a predetermined satisfaction function S ０ Proposal X calculated using (X)ｎ－１ Satisfaction S ０ (X ｎ－１ ) so that the satisfaction function S ｎ (X).

[0123] (Appendix D3) In the estimation process, the at least one processor calculates a satisfaction function S ｎ Proposal X calculated using (X) ｎ－１ Counterproposal X' presented by the second negotiating party in response to ｎ－１ Satisfaction S ｎ (X' ｎ－１ ) is the satisfaction function S ｎ Proposal X calculated using (X) ｎ－１ Satisfaction S ｎ (X ｎ－１ ) so that the satisfaction function S ｎ (X).

[0124] (Appendix D4) The satisfaction function S estimated in the estimation process ｎ (X) is a linear function of proposal X.

[0125] (Appendix D5) The objective function F set in the setting process ｎ (X) is the satisfaction function S ｎ (X) with coefficient w ｎ In the setting process, the at least one processor includes a term multiplied by a coefficient w used in the n-th round. ｎ The coefficient w used in the n-1th round ｎ－１ The negotiation device according to appendix D4, which is set as above.

[0126] (Appendix D6) The at least one processor: ｎ－１ Counterproposal X' presented by the second negotiating party in response to ｎ－１ See the search range Ω ｎ In the calculation process, the at least one processor further executes a search range setting process to set a proposal X ｎ and the search range Ω set in the search range setting process. ｎThe proposal X is included in the objective function F set in the setting process. ｎ The value of F ｎ Calculating a proposal X that maximizes (X).

[0127] (Appendix D7) The at least one processor calculates the proposal X ｎ to the terminal used by the second negotiating entity, the proposal X calculated in the calculation process is ｎ The negotiation device according to any one of appendices D1 to D6, further performing a providing process of displaying the above on a display of the terminal.

[0128] [Appendix E] This disclosure includes the techniques described in the following appendices. However, the present invention is not limited to the techniques described in the following appendices, and various modifications are possible within the scope of the claims.

[0129] (Appendix E1) A program for causing a computer to function as a negotiation device, the program causing the computer to receive proposal X presented by a first negotiating entity to a second negotiating entity in the n-1th round (n is a natural number of 2 or more). ｎ－１ A satisfaction function S representing the satisfaction of the second negotiating entity with the proposal X with reference to ｎ (X), and estimating a profit function Y(X) representing the profit of the first negotiating entity for proposal X and a satisfaction function S estimated in the estimation process. ｎ (X) and the objective function F ｎ A setting process for setting (X), and an objective function F set in the setting process ｎ (X) to be presented from the first negotiating entity to the second negotiating entity in the n-th round. ｎ A non-transitory recording medium on which a calculation process for calculating the above and a negotiation program for executing the above are recorded.

[0130] 1, 1A Negotiation device 11 Estimation unit 12 Setting unit 13 Calculation unit 14 Search range creation unit 15 Initial proposal creation unit 16 Search range setting unit C1 Processor C2 Memory

Claims

1. Proposal X presented by the first negotiating party to the second negotiating party in the n-1th round (n is a natural number greater than or equal to 2) ｎ－１ A satisfaction function S representing the satisfaction of the second negotiating entity with the proposal X with reference to ｎ a profit function Y(X) representing the profit of the first negotiating party for proposal X and a satisfaction function S estimated by the estimation means; ｎ (X) and the objective function F ｎ A setting means for setting (X); and an objective function F set by the setting means. ｎ (X) to be presented from the first negotiating entity to the second negotiating entity in the n-th round. ｎ and a calculation means for calculating the value of the negotiation result.

2. The estimation means calculates the satisfaction function S ｎ Proposal X calculated using (X) ｎ－１ Satisfaction S ｎ (X ｎ－１ ) is a predetermined satisfaction function S ０ Proposal X calculated using (X) ｎ－１ Satisfaction S ０ (X ｎ－１ ) so that the satisfaction function S ｎ The negotiation device of claim 1 , wherein (X) is estimated.

3. The estimation means calculates the satisfaction function S ｎ Proposal X calculated using (X) ｎ－１ Counterproposal X' presented by the second negotiating party in response to ｎ－１ Satisfaction S ｎ (X' ｎ－１ ) is the satisfaction function S ｎ Proposal X calculated using (X) ｎ－１ Satisfaction S ｎ (X ｎ－１ ) so that the satisfaction function S ｎ The negotiation device of claim 1 , wherein (X) is estimated.

4. The satisfaction function S estimated by the estimation means ｎ 4. The negotiation device of claim 2, wherein (X) is a linear function of proposal X.

5. Objective function F set by the setting means ｎ (X) is the satisfaction function S ｎ (X) with coefficient w ｎ The setting means includes a term multiplied by a coefficient w used in the n-th round. ｎ The coefficient w used in the n-1th round ｎ－１ The negotiation device according to claim 4 , wherein the above is set.

6. Proposal X ｎ－１ Counterproposal X' presented by the second negotiating party in response to ｎ－１ See the search range Ω ｎ The calculation means further includes a search range setting means for setting a proposal X ｎ and the search range Ω set by the search range setting means ｎ The proposal X is included in the objective function F set by the setting means. ｎ The value of F ｎ The negotiation device according to any one of claims 1 to 5, wherein a proposal X that maximizes (X) is calculated.

7. Proposal X calculated by the calculation means ｎ to the terminal used by the second negotiating entity, the proposal X calculated by the calculation means ｎ The negotiation device according to any one of claims 1 to 6, further comprising a providing means for displaying the above on a display of the terminal.

8. Proposal X submitted by at least one processor from the first negotiating subject to the second negotiating subject in the n-1th round (n is a natural number equal to or greater than 2) ｎ－１ A satisfaction function S representing the satisfaction of the second negotiating entity with the proposal X with reference to ｎ an estimation process for estimating a profit function Y(X) representing the profit of the first negotiating entity for the proposal X and a satisfaction function S estimated by the estimation process; ｎ (X) and the objective function F ｎ a setting process for setting an objective function F (X), and the at least one processor sets the objective function F (X) in the setting process. ｎ (X) to be presented from the first negotiating entity to the second negotiating entity in the n-th round. ｎ and a calculation process for calculating the 9. At least one processor is notified of proposal X submitted by the first negotiating subject to the second negotiating subject in the n-1th round (n is a natural number equal to or greater than 2). ｎ－１ A satisfaction function S representing the satisfaction of the second negotiating entity with the proposal X with reference to ｎ (X), and estimating a profit function Y(X) representing the profit of the first negotiating entity for proposal X and a satisfaction function S estimated in the estimation process. ｎ (X) and the objective function F ｎ A setting process for setting (X), and an objective function F set in the setting process ｎ (X) to be presented from the first negotiating entity to the second negotiating entity in the n-th round. ｎ and a negotiation program that executes a calculation process to calculate the above.

Images