TWI839794B - Gift giving system, gift giving method, and program product - Google Patents

Abstract

[Topic] Control the amount of gifts given to users within an appropriate range. [Solution] The usage information acquisition means (102) of the gift giving system (S) acquires usage information about the usage of the service by each of a plurality of users. The determination means (103) determines at least one of the user's winning probability and the gift for each user based on the relative relationship between the usage status represented by the user's usage information and the usage status represented by the usage information of other users. The gift giving means (105) performs a lottery process and gives gifts to each user based on at least one of the user's winning probability and the gift.

Description

Gift giving system, gift giving method, and program product

This disclosure relates to gift giving systems, gift giving methods, and program products.

It is known that a lottery is conducted based on a predetermined winning probability, and a service is provided to give gifts to users who have won a prize. Patent document 1 states that the winning probability is set higher the more the amount of product purchases or the number of visits to the website. Patent document 2 states that important users are identified based on the amount of product purchases or the number of visits to the store, and the winning probability of important users is increased. Patent document 3 states that the winning probability is increased the more times a lottery is participated. Patent document 4 states that the winning probability is changed based on the user's assets or the number of years of membership. [Prior art document] [Patent document]

[Patent Document 1] Japanese Patent Publication No. 2002-99806 [Patent Document 2] Japanese Patent Publication No. 2003-77063 [Patent Document 3] Japanese Patent Publication No. 2003-141296 [Patent Document 4] Japanese Patent Publication No. 2009-245291

[The problem that the invention wants to solve]

In the above-mentioned techniques, it is possible that more users than expected will win prizes, and more gifts than expected will be given to users. For example, in the technique of patent document 1, if the number of users with a large amount of product purchases or access times increases, more gifts than expected will be given to users. Similarly, the techniques of patent documents 2-4 may also give more gifts than expected to users. Therefore, in the previous techniques, the amount of gifts given to users cannot be controlled within an appropriate range.

One of the purposes of this disclosure is to control the amount of gifts given to users within an appropriate range. [Means for solving the problem]

The gift giving system disclosed in the present invention comprises: a usage information acquisition means for acquiring usage information about the usage of a service by each of a plurality of users; and a determination means for determining at least one of the user's winning probability and a gift for each previous user based on the relative relationship between the usage status represented by the previous usage information of the user and the usage status represented by the previous usage information of other users; and a gift giving means for executing a lottery process and giving a gift for each previous user based on at least one of the user's previous winning probability and a previous gift. [Effect of the invention]

According to the present disclosure, the amount of gifts given to users can be controlled within an appropriate range.

[1. The overall structure of the gift giving system]

An example of an implementation form of the gift giving system described in the present disclosure is described. FIG. 1 is a diagram showing an example of the overall configuration of the gift giving system described in the implementation form. The gift giving system S includes the components of FIG. 1 . The network N is any network such as the Internet or a LAN. The gift giving system S only needs to include at least one computer and is not limited to the example of FIG. 1 .

The server 10 is a server computer. The control unit 11 includes at least one processor. The memory unit 12 includes a volatile memory such as a RAM and a non-volatile memory such as a hard disk. The communication unit 13 includes at least one of a communication interface for wired communication and a communication interface for wireless communication.

The user terminal 20 is a computer of the user. For example, the user terminal 20 is a smart phone, a tablet terminal, a wearable terminal, or a personal computer. The physical structures of the control unit 21, the memory unit 22, and the communication unit 23 are the same as the control unit 11, the memory unit 12, and the communication unit 13, respectively. The operation unit 24 is an input device such as a touch panel. The display unit 25 is a liquid crystal display or an organic EL display.

The store terminal 30 is a computer of the store. For example, the store terminal 30 is a POS terminal, a personal computer, a tablet terminal, or a smart phone. The physical structure of the control unit 31, the memory unit 32, the communication unit 33, the operation unit 34, and the display unit 35 is the same as the control unit 11, the memory unit 12, the communication unit 13, the operation unit 24, and the display unit 25, respectively. The store terminal 30 is connected to a reader, a reader/writer, or a camera-like reading device 36. The reading device 36 may also be included in the store terminal 30.

In addition, the programs stored in each of the memory units 12, 22, and 32 can also be supplied through the network N. Furthermore, the programs stored in the information storage medium readable by the computer can also be supplied through the reading unit required for reading the information storage medium (such as a disc drive or a memory card slot) or the input/output unit required for inputting and outputting data with an external device (such as a USB port).

[2. Overview of gift giving system] In the gift giving system S, a predetermined service is provided to each of a plurality of users. Each user uses his or her own user terminal 20 to use the service. In this embodiment, an example of a service is a checkout service. The service may be of any type and is not limited to a checkout service. Application examples of other services will be described in the variant examples described later.

Checkout service is a service that provides electronic checkout. Electronic checkout is sometimes referred to as cashless checkout. The checkout means that can be used in the checkout service can be of any type. For example, the checkout means can also be a credit card, a debit card, electronic money, electronic cash, points, a bank account, an electronic wallet, a virtual currency, or a combination of these. Electronic checkout using codes such as barcodes or QR codes is sometimes referred to as code checkout, so the code can also be equivalent to the checkout means.

In this embodiment, a case where a user visits a real store and uses a checkout service is taken as an example. The checkout service itself can use various known methods. In this embodiment, a method in which a user uses a checkout application installed in the user terminal 20 is described. For example, after the user completes a predetermined use registration from the checkout application, once the user enters a user ID and password and logs in to the checkout service, the checkout service can be used.

FIG. 2 is a diagram showing an example of a user using the checkout service. When the user logs in to the checkout service, the main screen G1 of the checkout application is displayed on the display unit 25. The main screen G1 displays a code C10 required for using the checkout means that has been set as a payment source. The user presents the code C10 to the store clerk. When the store clerk reads the code C10 with the reading device 36, a predetermined checkout process is executed between the store terminal 30 and the server 10. The checkout process itself can utilize various known processes.

In this embodiment, a promotional activity is held, and once a user uses the checkout service, a predetermined lottery process is executed, and a gift is given to the winning user. When a user wins a prize, a gift corresponding to the level is given. In this embodiment, although a promotional activity in which the user's registration is required is given as an example, a promotional activity in which the user's registration is not required may also be a promotional activity. For example, once the user selects button B11, a registration acceptance screen required for accepting the registration is displayed on the display unit 25.

FIG3 is a diagram showing an example of the process from user registration for a promotion to the execution of a lottery. In the registration acceptance screen G2, the winning probability and gifts for each level are displayed as details of the promotion. In this embodiment, the winning probability of a user varies according to the ranking of the user. The ranking is determined based on the usage of the checkout service. For example, the ranking is determined based on the total amount of usage after registration. For example, the higher the ranking, the higher the winning probability.

When the user selects button B20, the registration for the promotion is completed, and the registration completion screen G3 is displayed on the display unit 25. The registration completion screen G3 displays the details of the winning probability for each ranking. When the user just completes the registration, the total amount used after registration is 0 yen, so the user's ranking is the lowest. When the user selects button B30, it returns to the main screen G1.

The main screen G1 shows that the user has signed up for the promotion. When the user selects button B12, the user can check the winning probability corresponding to the current ranking. For example, the user shows the code C10 to the store clerk. When the code C10 is read by the reader 36, the checkout process and the lottery process are executed. When the checkout process and the lottery process are executed, the checkout completion screen G4 indicating that these processes have been completed is displayed on the display unit 25. The checkout completion screen G4 shows the used store, the used amount, and the lottery result.

For example, if the user has won a prize, the checkout completion screen G4 displays a message indicating that the user has won a prize, the level of the prize, and the content of the gift. The gift may be given immediately after the user wins the prize, or may be given after a certain period of time. If the user has not won a prize, the checkout completion screen G4 displays a message indicating that the user has not won a prize. For example, the total amount used after registration and the current ranking may also be displayed on the checkout completion screen G4.

As described above, once a user signs up for a promotion, the gift giving system S determines the user's ranking based on the total amount used after the registration. The gift giving system S determines the user's chance of winning based on the user's ranking. In this way, even if more users than expected sign up for a promotion, the number of users with a relatively high chance of winning will still be controlled within a certain number, and therefore the number of winning users will also be controlled within a certain number. Therefore, the amount of gifts given to users can be controlled within an appropriate range. The details of the gift giving system S are described below.

[3. Functions implemented in the gift-giving system] Figure 4 is a functional block diagram showing an example of functions implemented in the gift-giving system S.

[3-1. Functions implemented in the server] The data storage unit 100 is implemented mainly by the storage unit 12. The checkout processing execution unit 101, the usage status acquisition unit 102, the determination unit 103, the notification unit 104, and the gift giving unit 105 are each implemented mainly by the control unit 11.

[Data storage unit] The data storage unit 100 stores the data necessary for providing the checkout service. For example, the data storage unit 100 stores the user database DB1 and the promotion activity database DB2.

FIG5 is a diagram showing an example of a user database DB1. The user database DB1 is a database in which information about users is stored. For example, the user database DB1 stores: user ID, password, user name, code ID, checkout information, usage status information, registration information, total usage information, ranking information, and lottery result information. Once a user completes the usage registration, a new record will be created in the user database DB1, and the user ID and other information of the user will be stored.

User ID is user identification information that can identify the user. Therefore, the place where the user ID is recorded can be replaced with user identification information. User identification information can be any information, and other information such as email address or phone number can also be used. User ID is also called account. User ID and password are used to log in to the checkout service.

In this embodiment, in order to identify the user who requests the checkout process, some user identification information must be included in the code C10. Although the user ID can also be included in the code C10, this embodiment describes the case where the code ID is included in the code C10. The code ID is a type of user identification information. The code ID is information different from the user ID. For example, the code ID is expressed by a number, text, or a combination of these.

Code IDs can be issued at any time. Code IDs can also be set with an expiration date. For example, a Code ID is issued when an application is started, when the expiration date expires, or when a user instructs re-issuance. The method of issuing a Code ID can be any method of issuance. Code IDs are issued in a way that does not overlap with other Code IDs within the expiration date. For example, Code IDs are issued randomly.

The settlement means information is information about the settlement means. For example, when the settlement means is a credit card, the settlement means information includes the credit card number, expiration date, and nominee information. When the settlement means is electronic currency, the settlement means information includes: an electronic currency ID that can identify the electronic currency, and the balance of the electronic currency. When the settlement means is points, the settlement means information includes: a point ID that can identify the points, and the balance of the points. Similarly, for other settlement means, the settlement means information will include information that can identify the settlement means. When the user can use multiple settlement means, the settlement means information will also include information that can identify the settlement means of the payment source. The settlement means of the payment source can be changed by the user.

The usage status information is information about the usage status of the checkout service. The usage status can also be called the usage history. For example, the usage status information includes: the date and time of usage, the store identification information that can identify the usage store, and the usage amount. In the case where the server 10 can obtain product information that can identify the product purchased by the user, the usage status information can also include the product information. Once a user uses the checkout service, the user's usage status information is updated. The usage status information can also include: the total usage amount of the checkout service, the average usage amount, the number of times of usage, the frequency of usage, or other information such as the usage period.

Registration information is information about whether or not a user has registered for a promotion. When multiple promotions are held simultaneously, registration information includes information about whether or not a user has registered for each promotion. Total usage information is information about the total usage of a user. In this embodiment, ranking is determined based on the total usage after registration, so the total usage information is information about the total usage after registration.

Ranking information is information about the ranking of users. For example, once the predetermined update time is reached, the server 10 determines the ranking of each user based on the usage information of all users who have registered for the promotional activity. For example, the server 10 determines the ranking in descending order of the total amount of usage after registration, starting from the first place. The more the total amount of usage after registration, the higher the ranking.

In addition, the ranking can be determined based on the usage status of the checkout service, or based on information other than the total amount of usage. The ranking can be determined based on the relative relationship described below. In addition, the ranking can be updated at any time. For example, the ranking can be updated every hour, every few hours, every day, or every few days. The ranking can also be updated every time the checkout process is executed.

In the case where no registration for the promotional activity is required, the server 10 may determine the ranking among all users. Alternatively, for example, the server 10 may determine the ranking according to each attribute of the user. The attribute may be any attribute that can classify the user in some form, such as address, age group, occupation, ranking, or interest.

The lottery result information is information about the lottery result. For example, the lottery result information includes: the lottery date and time, information that can identify whether the winner is a winner, and the level of the winner. If a prize is given to the winner afterwards, the lottery result information may also include the date and time when the prize will be given.

FIG6 is a diagram showing an example of a promotion database DB2. The promotion database DB2 is a database in which information about promotions in the checkout service is stored. For example, the promotion database DB2 stores: promotion ID, promotion name, event period, gift information, and winning probability information. The promotion database DB2 can be edited by the administrator of the checkout service. Once the administrator plans a new promotion, a new record will be created in the promotion database DB2, and information about the promotion will be stored.

The promotion ID and promotion name are information that can identify the promotion. The promotion period is the period from the start to the end of the promotion. The gift information is information about the content of the gift given to the winning user. In this embodiment, since there are multiple levels, the gift information indicates the content of the gift according to each level. The winning probability information is information about the winning probability. In this embodiment, since there are multiple levels, the winning probability information indicates the winning probability according to each level. In addition, the winning probability changes according to the ranking, so the winning probability information shows the winning probability for each ranking.

[Checkout Processing Execution Unit] Checkout processing execution unit 101 executes checkout processing based on the checkout means information of the user when a user makes a checkout request. Checkout request is a notification required to request the execution of checkout processing. Checkout request is executed by sending data in a predetermined format. In this embodiment, once the store terminal 30 reads the code C10 with the reading device 36, it obtains the code ID contained in the code C10. The store terminal 30 sends the checkout request containing the code ID to the server 10. It is assumed that the checkout request also contains store identification information that can identify the store or information such as the usage amount.

When the server 10 receives a checkout request from the store terminal 30, the checkout processing execution unit 101 refers to the user database DB1 to obtain the checkout means information associated with the code ID included in the checkout request. The checkout processing execution unit 101 executes the checkout processing based on the checkout means information. The checkout processing execution unit 101 updates the usage status information associated with the code ID included in the checkout request based on the execution result of the checkout processing. The checkout processing execution unit 101 sends the execution result of the checkout processing to the store terminal 30.

As mentioned above, the checkout process itself can utilize various known methods. For example, as a method of utilizing the checkout service, there are a method of reading a code disclosed by a store with the user terminal 20, and a method of selecting a store to utilize by operating the user terminal 20. In these cases, the checkout request is sent to the server 10 by the user terminal 20, not by the store terminal 30. The checkout process execution unit 101 executes the checkout process based on the checkout request from the user terminal 20.

[Usage status acquisition unit] The usage status acquisition unit 102 acquires usage status information about the usage status of the checkout service by each of the plurality of users. The usage status acquisition unit 102 acquires the usage status information of the user who is the target of the lottery. In this embodiment, since the lottery process is performed together with the checkout process, the user who is the target of the lottery is the user who requested the checkout process. That is, the user who is the target of the lottery is the user identified by the code ID included in the checkout request. The usage status information is stored in the user database DB1, so the usage status acquisition unit 102 acquires the usage status information stored in the user database DB1.

[Determination Unit] The determination unit 103 determines at least one of the user's chance of winning and the gift for each user based on the relative relationship between the user's usage status represented by the user's usage status information and the usage status represented by the usage status information of other users. The user is the user of the lottery target. Other users are users other than the user of the lottery target. Although the present embodiment describes that among the users who have registered for the promotion, all users other than the user of the lottery target are equivalent to other users, it is also possible that only a part of the users other than the user of the lottery target are equivalent to other users.

The so-called relative relationship is the difference between the usage status of a certain user and the usage status of other users. In this embodiment, an example of a relative relationship is a ranking that describes the usage status of a service. Therefore, the description of the ranking can be replaced by the relative relationship. The relative relationship can be any relationship, not limited to the ranking.

For example, when the total amount of usage is equivalent to the usage status, whichever is greater, the total amount of usage of a certain user or the total amount of usage of other users, is equivalent to a relative relationship. Alternatively, the difference between these total amounts of usage is equivalent to a relative relationship. For example, the difference between the total amount of usage of a certain user and the average of the total amounts of usage of all users is equivalent to a relative relationship. The same is true when the average amount of usage, the number of times of usage, the frequency of usage, or the usage period is equivalent to the usage status. When the combination of these multiple items is equivalent to the usage status, the difference in the scores calculated based on these combinations is equivalent to a relative relationship.

For example, the decision unit 103 may also determine at least one of the user's chance of winning and the gift for each user based on the user's ranking. In this embodiment, the gift is fixed for all users, and the winning chance is determined by the decision unit 103. For example, the relationship between the ranking and the chance of winning may also be defined in the winning chance information of the promotion activity database DB2. The decision unit 103 obtains the winning chance associated with the user's ranking by referring to the promotion activity database DB2, thereby determining the user's chance of winning.

In addition, the winning probability information is set to the same winning probability for all users (i.e., the previous method). It is better to define the relationship between the ranking and the winning probability in a way that the expected value of the gift occurring in the entire promotional activity becomes smaller and smaller. The determination unit 103 can determine the winning probability of the user in a way that the expected value of the gift occurring in the entire promotional activity becomes smaller and smaller. Here, an example that is even simpler than the present embodiment is given. It is assumed that in a promotional activity with 10,000 participants, if a person wins the prize, a gift of 1,000 yen will be given. If the probability of winning is set to 1% for all users, the expected value of the gift if 10,000 people participate in the promotion is 10,000 people × 1% × 1,000 yen, which is 100,000 yen. If 20,000 more people participate in the promotion, the expected value of the gift is 20,000 people × 1% × 1,000 yen, which is 200,000 yen.

On the other hand, let's assume that the winning probability of users ranked 1 to 5000 is set at 1.2%, and the winning probability of users ranked 5001 and above is set at 0.8%. If 10,000 people participate in the promotion, the expected value of the gift is 5,000 people × 1.2% × 1,000 yen + 5,000 people × 0.8% × 1,000 yen, which is 100,000 yen. In other words, if the number of users participating in the promotion is the same as the assumed number, the expected value will be the same as the case of setting the same winning probability. If 20,000 people participate in the promotion, which is higher than the assumed number, the expected value of the gift is 5,000 people × 1.2% × 1,000 yen + 15,000 people × 0.8% × 1,000 yen, which is 180,000 yen. Therefore, the number of gifts that occur in the entire promotion is suppressed compared to the case where the winning probability is set to be the same. In this way, the winning probability information can be defined in such a way that the expected value of the gifts for the entire promotion when more than the assumed number of users participate is smaller than when all users are set to be the same.

In addition, if the number of users participating in the promotion is small, the method of this embodiment may increase the number of gifts generated in the entire promotion compared to setting the same winning probability. In this case, since the number of gifts generated in the entire promotion will be smaller than if the assumed number of people participate, it is considered that it will not cause disadvantages to the organizer.

In the case where the aforementioned "relative relationship" is a factor other than the usage ranking, the winning probability information can be defined in a way that suppresses the expected value of the gift for the entire promotion compared to the case where the winning probability is set to be the same. For example, assume that the relationship between the total usage of each user participating in the promotion and the average value of the total usage is equivalent to a "relative relationship". Furthermore, assume that the winning probability of users who are above the average value of the entire promotion is set to 1.2%. If the same winning probability is 1.0%, the expected value of the gift for the entire promotion can be suppressed by setting the winning probability of users who do not reach the average value of the entire promotion to less than 0.8%. Thus, even if "relative relationship" is a factor other than ranking, it is sufficient to define the winning probability information in a way that suppresses the expected value of the gift for the entire promotion.

Furthermore, the data indicating the relationship between the ranking and the winning probability can be in any form, not limited to data in a table form such as winning probability information. For example, when the data is in a mathematical form, the determination unit 103 substitutes the ranking into the mathematical form to calculate the winning probability, thereby determining the winning probability of the user. In addition, for example, the data can also be a program such as a learning model using machine learning. Regardless of these forms, in this embodiment, the higher the ranking of the user, the higher the winning probability. It can also be the opposite of this embodiment, the higher the ranking of the user, the lower the winning probability.

Furthermore, the probability of winning may be fixed for all users, and the decision unit 103 determines the gift for each user based on the user's ranking. In this case, the relationship between the ranking and the gift is defined in the gift information of the promotion database DB2. The decision unit 103 obtains the gift associated with the user's ranking with reference to the promotion database DB2, thereby determining the user's gift. These relationships can be in any data format, which is the same as the relationship between the ranking and the probability of winning. In this embodiment, the higher the user's ranking, the better the gift. The so-called better gift means that the value obtained through the gift is higher. For example, a higher reward amount is equivalent to a better gift. The present embodiment may be the opposite, where the higher the user's ranking, the lower the gift.

Furthermore, the winning probability and the gift may not be fixed, and the determination unit 103 determines the winning probability and the gift for each user based on the user's ranking. The determination method in this case is to combine the method for determining only the winning probability and the method for determining only the gift described above.

[Notification unit] The notification unit 104 notifies each of the plurality of users of at least one of the winning probability and the gift determined by the determination unit 103. In the present embodiment, since the winning probability is determined by the determination unit 103, the notification unit 104 notifies the user of the winning probability. In the present embodiment, although the winning probability is notified by the screen displayed when the button B12 of the main screen G1 is selected, the method of notifying the winning probability can be any method and is not limited to the example of the present embodiment.

For example, the notification unit 104 may notify the winning probability through the main screen G1. The notification unit 104 may notify the winning probability through any other screen. The notification unit 104 may notify the winning probability through other means such as e-mail, messaging application, SNS, SMS, or push notification. The notification unit 104 may notify the winning probability through voice. In the case where the gift is determined by the decision unit 103, the notification unit 104 only needs to notify the content of the gift.

[Gift granting unit] The gift granting unit 105 performs a lottery process and grants a gift to each user based on at least one of the user's winning probability and the gift determined by the determination unit 103. In this embodiment, the gift granting unit 105 performs a lottery process and grants a gift to each user based on at least one of the user's winning probability and the gift when the user uses the checkout service. The user is a user who is the target of the lottery.

In this embodiment, since the winning probability is determined by the determination unit 103, the gift giving unit 105 performs a lottery process and gives gifts based on the winning probability of the user. The gift giving unit 105 gives gifts to the user if the user has won a prize. In this embodiment, since there are a plurality of levels, the gift giving unit 105 gives gifts corresponding to the level to the user if the user has won a prize. The gift giving unit 105 does not give gifts to the user if the user has not won a prize. The gift giving unit 105 updates the user's lottery result information based on the user's lottery result.

In addition, the lottery itself can be performed using various known methods. For example, the gift giving unit 105 performs the lottery process based on the user's chance of winning and a random selection algorithm, a random algorithm, or a probabilistic algorithm. The gift giving unit 105 also determines the user's level when the user has already won the lottery. When there is only one level, the gift giving unit 105 only needs to determine whether the user has already won the lottery.

In addition, the gift giving method itself can also use various known methods. As described in the present embodiment, when the reward of points corresponding to the utilization amount is equivalent to a gift, the gift giving unit 105 updates the checkout means information in a manner that increases the points of the user by a reward amount, thereby giving the user a gift. In the case where the points are rewarded after a certain period of time, the gift giving unit 105 updates the lottery result information in a manner that includes the reward amount of the points of the user and the date and time when the points will be rewarded, thereby giving the user a gift. The same is true for other gifts such as coupons or items. The method of giving the gift itself can be a well-known method.

The gift giving unit 105 may also perform a lottery process and give gifts after being notified by the notification unit 104. For example, after the user selects the button B12 on the main screen G1 and is notified of the chance of winning, the gift giving unit 105 performs a lottery process. The gift giving unit 105 may perform a lottery process in advance instead of when the server 10 receives a checkout request. In this case, the gift giving unit 105 only needs to record the execution result of the lottery process performed in advance in the lottery result information.

[3-2. Functions implemented in the user terminal] The data storage unit 200 is implemented mainly by the storage unit 22. The display control unit 201 is implemented mainly by the control unit 21. The data storage unit 200 stores the data necessary for providing the checkout service. For example, the data storage unit 200 stores: the checkout application, the code ID, and the validity period of the code ID. The display control unit 201 displays the code C10 containing the code ID on the main screen G1 based on the checkout application. The display control unit 201 also displays the other screens described in FIG. 3.

[3-3. Functions implemented in the store terminal] The data storage unit 300 is implemented mainly by the storage unit 32. The checkout request signaling unit 301 is implemented mainly by the control unit 31. The data storage unit 300 stores data necessary for providing checkout services. For example, the data storage unit 300 stores store identification information that can identify the store where the store terminal 30 is configured. The data storage unit 300 also stores a program for obtaining the code ID contained in the code C10.

The checkout request signaling unit 301 sends a checkout request to the server 10. For example, once the reading device 36 reads the code C10, the checkout request signaling unit 301 obtains the code ID included in the code C10. The checkout request signaling unit 301 sends a checkout request including the store identification information, the code ID, and the usage amount to the server 10.

In addition, the code ID can also be obtained optically or by communication. For example, the store terminal 30 can also use Wi-Fi (registered trademark), Bluetooth (registered trademark), or infrared communication to obtain the code ID, and can also use the short-range wireless communication used in the well-known IC card to obtain the code ID. The code ID can also be input from the operation unit 34 of the store terminal 30.

[4. Processing performed in the gift giving system] FIG. 7 is a flowchart showing an example of processing performed in the gift giving system S. The processing shown in FIG. 7 is performed by each of the control units 11, 21, and 31 operating according to the program stored in each of the memory units 12, 22, and 32. Here, it is assumed that the user has registered for the promotion.

Once the user starts the checkout application, the user terminal 20 performs a login process in the server 10 (S1). Once the login process is successful, the user terminal 20 displays the main screen G1 on the display unit 25 (S2). When the user selects the button B12, the winning probability corresponding to the user's ranking is displayed.

When the store terminal 30 reads the code C10 with the reading device 36, it sends the code ID contained in the code C10 to the server 10 (S3). When the server 10 receives the code ID, it performs the checkout process based on the checkout means information associated with the code ID (S4). In S4, the server 10 updates the user's usage status information and the total amount of usage information. The ranking information can also be updated at the time of S4.

The server 10 determines the user's chance of winning based on the ranking information associated with the code ID (S5). The server 10 executes a lottery process based on the winning chance determined in S5 (S6). The server 10 updates the lottery result information based on the execution result of the lottery process in S6 (S7). In S7, if the user wins the prize, the process required to grant the gift corresponding to the level is also executed.

The server 10 sends the checkout processing execution result to the store terminal 30 (S8), and sends the checkout processing and lottery processing execution results to the user terminal 20 (S9). The store terminal 30 displays a message indicating that the checkout processing has been completed on the display unit 35 (S10). The user terminal 20 displays the checkout completion screen G4 on the display unit 25 (S11), and this processing ends. The user can know the lottery result through the checkout completion screen G4 displayed in S11.

According to the gift granting system S of this embodiment, for each user, the user's chance of winning a prize is determined based on the relative relationship between the usage status represented by the user's usage status information and the usage status represented by the usage status information of other users. In this way, even if more users than expected sign up for a promotion, the number of users with a relatively high chance of winning a prize is still controlled within a certain number, so the number of winning users can also be controlled within a certain number. As a result, more users than expected can be prevented from winning a prize, and the amount of gifts granted to users can be controlled within an appropriate range.

Furthermore, the gift granting system S uses the ranking of the usage of the checkout service as a relative relationship, and determines the winning probability of each user based on the ranking of the user. By using the ranking, the amount of the gift given to the user can be controlled within an appropriate range. For example, if the higher the ranking, the higher the winning probability, the user who frequently uses the checkout service can be given a stronger motivation to use the checkout service. If the lower the ranking, the higher the winning probability, the user who rarely uses the checkout service can be given a motivation to use the checkout service.

Furthermore, the gift giving system S performs a lottery process and gives gifts to each user based on the user's chance of winning when the user uses the checkout service. In this way, the lottery process and gifts can be performed on the spot when the user uses the checkout service. Since the lottery results can be known at the time of using the checkout service, the interest of the promotional activities can be increased, and the use of the checkout service can be promoted.

Furthermore, the gift giving system S notifies each of the plurality of users of at least one of the user's winning probability and gift, and then performs a lottery process and gives gifts. Thus, by notifying the winning probability or gift in advance, the fairness of the lottery can be guaranteed, and users can participate in the promotional activities with peace of mind.

[5. Variations] In addition, the present disclosure is not limited to the above-described implementation forms. Appropriate changes can be made within the scope of the purpose of the present disclosure.

[5-1. Variant 1] For example, if the checkout service can be used in multiple stores, the user ranking can be determined for each store. If multiple stores belong to a predetermined store group, the user ranking can be determined for each store group. The so-called store in Variant 1 also includes the meaning of store group. Store group is a collection of stores with the same name. For example, a store group is a collection of chain stores with a certain name. Stores belonging to a store group may have different store names. It only needs some stores to be equivalent to a store group. In Variant 1, the store group is abbreviated as store.

For example, if there is an operating company that runs a convenience store chain called "XXX convenience store", the ranking among all "XXX convenience stores" may be determined, or the ranking among each store of "XXX convenience store" may be determined as in Modification 2 described below. Modification 1 describes the case where the ranking among all "XXX convenience stores" is determined.

In variation 1, it is assumed that there are a convenience store chain called "XXX convenience store" and a supermarket chain called "YYY supermarket" as stores where the checkout service is available. The server 10 calculates the total amount of usage of each user who has registered for the promotional activity at "XXX convenience store" and the total amount of usage of the user at "YYY supermarket".

The server 10 determines the ranking of users in "XXX convenience store" and "YYY supermarket" based on these statistical results, and updates the ranking information of the users. Assume that the ranking information shows the ranking of users in these stores.

The decision unit 103 determines at least one of the user's chance of winning a prize in the store and a gift for each combination of a user and a store based on the user's usage of the store and the relative relationship with the usage of other users in the store. In the first variant, similar to the embodiment, the gift is fixed for all users, and the decision unit 103 determines the chance of winning a prize for each combination of a user and a store.

For example, the decision unit 103 obtains ranking information that associates a user who is a lottery target with a combination of stores visited by the user. The decision unit 103 determines the chance of winning based on the ranking of the stores visited by the user in the ranking information. For example, if a user has visited "XXX convenience store", the decision unit 103 determines the chance of winning based on the ranking of "XXX convenience store" in the ranking information of the user. If a user has visited "YYY supermarket", the decision unit 103 determines the chance of winning based on the ranking of "YYY supermarket" in the ranking information of the user. Although it is different from the actual implementation form in that there is a ranking for each store, the method of determining the chance of winning is the same as the actual implementation form.

Furthermore, the relationship between ranking and winning probability may be common to all stores or may be determined for each store. For example, the relationship between "XXX convenience store" and "YYY supermarket" may be determined individually. Furthermore, the relationship between ranking and winning probability may be determined for each business, such as a relationship for convenience stores, a relationship for supermarkets, and a relationship for restaurants. Furthermore, the relationship between ranking and winning probability may be determined for other attributes such as each region or price range.

The gift giving unit 105 performs a lottery process and gives gifts to each user based on at least one of the user's winning probability and the gift in the store where the user uses the service. In the first variant, the gift is fixed for all users, and the winning probability varies with the store. Therefore, the gift giving unit 105 performs a lottery process and gives gifts based on the winning probability associated with the combination of the user and the store when a user uses the checkout service in a certain store. Although it is different from the actual implementation form in that there is a ranking for each store and the chance of winning may change, the lottery processing and gift awarding method itself is the same as the actual implementation form.

In addition, the probability of winning a prize may be fixed for all users, and the decision unit 103 may determine a gift for each combination of a user and a store. For example, if a certain user has visited "XXX convenience store", the decision unit 103 may determine a gift based on the ranking of "XXX convenience store" in the ranking information of the user. If a certain user has visited "YYY supermarket", the decision unit 103 may determine a gift based on the ranking of "YYY supermarket" in the ranking information of the user. The gift granting unit 105 may perform a lottery process and grant a gift for each user based on the gifts of the user in the store where the user uses the service.

In addition, both the winning probability and the gift may not be fixed, and the decision unit 103 determines the winning probability and the gift for each combination of the user and the store. For example, if a certain user visits "XXX convenience store", the decision unit 103 determines the winning probability and the gift based on the ranking of "XXX convenience store" in the ranking information of the user. If a certain user visits "YYY supermarket", the decision unit 103 determines the winning probability and the gift based on the ranking of "YYY supermarket" in the ranking information of the user.

According to variant 1, for each combination of a user and a store, at least one of the user's chance of winning a prize in the store and the gift is determined based on the user's usage of the store and the relative relationship with the usage of other users in the store. In this way, the amount of gifts given to users can be controlled within an appropriate range for each store. In addition, since the ranking is calculated for each store instead of all stores, it is easier for users to rise in the ranking of stores they usually use. Therefore, the use of checkout services by users can be promoted. From the perspective of the store, the possibility that a user who has visited the store once will come back again becomes higher, so the customer attraction effect caused by the promotional activities can be improved.

[5-2. Variant 2] For example, in Variant 1, although it is described that the ranking is calculated for each store group, it is also possible to calculate the ranking for each store in a store group. For example, if there is an operating company that opens a convenience store chain called "XXX Convenience Store", the server 10 calculates the total amount of usage of users in each store named "XXX Convenience Store" and determines the ranking.

The decision unit 103 determines, for each user, at least one of the winning probability and the gift of the user in the first store in the store group, and at least one of the winning probability and the gift of the user in the second store in the store group. In the variant 2, similar to the implementation form, it is explained that the gift is fixed for all users, and the decision unit 103 determines the winning probability for each combination of users and stores.

For example, the decision unit 103 obtains ranking information that associates a user who is a lottery target with a combination of stores visited by the user. The decision unit 103 determines the chance of winning based on the ranking of the stores visited by the user in the ranking information. For example, if a user visits store A of "XXX convenience store", the decision unit 103 determines the chance of winning based on the ranking of store A of "XXX convenience store" in the ranking information of the user. If a user visits store B of "XXX convenience store", the decision unit 103 determines the chance of winning based on the ranking of store B of "XXX convenience store" in the ranking information of the user. Although it is different from the embodiment and variant 1 in that there is a ranking for each store, the method of determining the winning probability itself is the same as the embodiment and variant 1.

Furthermore, the relationship between ranking and winning probability can be common to all stores or determined for each store. For example, the relationship between store A of "XXX convenience store" and store B of "XXX convenience store" can be determined individually.

The gift giving unit 105 performs a lottery process and gives a gift based on at least one of the user's chance of winning and a gift in the first store when any one of the plurality of users uses the first store. The gift giving unit 105 performs a lottery process and gives a gift based on at least one of the user's chance of winning and a gift in the second store when any one of the plurality of users uses the second store. The first store and the second store belong to the same store group but are located in different places from each other. For example, store A of "XXX convenience store" is equivalent to store 1. Store B of "XXX Convenience Store" is equivalent to store No. 2.

In variation 2, since the gift is fixed for all users and the winning probability is determined for each store in a certain store group, the gift granting unit 105 performs a lottery process and grants the gift based on the winning probability associated with the combination of the user and the store when a certain user uses the checkout service in a certain store in a certain store group. Although it is different from the implementation form in that there is a ranking for each store in the store group and the winning probability may change, the lottery process or the gift granting method itself is the same as the implementation form.

In addition, the probability of winning a prize may be fixed for all users, and the decision unit 103 may determine a gift for each combination of a user and a store. For example, if a user visits store A of "XXX convenience store", the decision unit 103 may determine a gift based on the ranking of store A of "XXX convenience store" in the ranking information of the user. If a user visits store B of "XXX convenience store", the decision unit 103 may determine a gift based on the ranking of store B of "XXX convenience store" in the ranking information of the user. The gift granting unit 105 may perform a lottery process and grant a gift for each user based on the gifts of the user in the store where the user uses the checkout service.

In addition, both the winning probability and the gift may not be fixed, and the decision unit 103 determines the winning probability and the gift for each combination of the user and the store. For example, if a certain user visits store A of "XXX convenience store", the decision unit 103 determines the winning probability and the gift based on the ranking of store A of "XXX convenience store" in the ranking information of the user. If a certain user visits store B of "XXX convenience store", the decision unit 103 determines the winning probability and the gift based on the ranking of store B of "XXX convenience store" in the ranking information of the user.

According to variant 2, the decision unit 103 determines, for each user, at least one of the user's chance of winning a prize and a gift in the first store in the store group, and at least one of the user's chance of winning a prize and a gift in the second store in the store group. In this way, the amount of gifts given to the user can be controlled within an appropriate range for each store in a certain store group. In addition, since the ranking is calculated for each store instead of all stores or store groups, it is easier for the user to rise in the ranking of the store he usually uses. Therefore, the use of the checkout service by the user can be promoted. From the perspective of the store, users who have visited the store once are more likely to come back again, thus improving the customer attraction effect of promotional activities.

[5-3. Variant 3] For example, the ranking of users can be determined according to each time zone. The time zone can be of any length, for example, it can be every few hours, and the length of each time zone can be different. For example, it is also possible to set a time zone of every 2 hours during the day and a longer time zone at night. In Variant 3, although the description is made in combination with Variant 2 to determine the ranking of each time zone in each store of the store group, it can also be combined with Variant 1 to determine the ranking of each time zone in the entire store group, and it can also be determined in each time zone in all stores as in the implementation form.

In variant example 3, four time zones of 0 to 6 o'clock, 6 to 12 o'clock, 12 to 18 o'clock, and 18 to 24 o'clock are taken as examples. For example, the server 10 counts the total usage of each time zone in each store for each user who has registered for the promotion. If it is the ranking of store A of "XXX Convenience Store", the server 10 counts the total usage of each time zone in store A of "XXX Convenience Store" for each user. Based on the statistical results, the server 10 determines the ranking of each time zone in "XXX Convenience Store" and updates the user's ranking information. Assume that the ranking information shows the ranking of users in each time zone of each store.

The decision unit 103 may also determine at least one of the winning probability and the gift for each combination of user and time zone based on the usage status of the user in the time zone and the relative relationship with the usage status of other users in the time zone. In variant example 3, similar to the implementation form, it is described that the gift is fixed for all users, and the decision unit 103 determines the winning probability for each combination of user and time zone.

For example, the decision unit 103 obtains ranking information associated with a combination of a user who is a lottery target and a time zone in which the user uses the checkout service. The decision unit 103 determines the chance of winning based on the ranking of the store visited by the user in the ranking information. For example, if a user visits store A of "XXX convenience store" at 15:00, the decision unit 103 determines the chance of winning based on the ranking of store A of "XXX convenience store" between 12:00 and 18:00 in the ranking information of the user. Similarly, if the user visits store A of "XXX convenience store" in other time zones, the decision unit 103 determines the chance of winning based on the ranking in the time zone to which the user visited the store. The same is true when the user visits other stores.

Furthermore, the relationship between ranking and winning probability may be common to all time zones, or may be determined for each time zone. For example, the relationship for the time zone of 0:00 to 6:00, the relationship for the time zone of 6:00 to 12:00, the relationship for the time zone of 12:00 to 18:00, and the relationship for the time zone of 18:00 to 24:00 may be determined separately.

The gift giving unit 105 performs a lottery process and gives gifts to each user based on at least one of the user's chance of winning a prize and the gift during the time period when the user uses the service. In the third variant, the gift is fixed for all users, and the chance of winning a prize changes with the time period. Therefore, the gift giving unit 105 performs a lottery process and gives gifts based on the chance of winning a prize corresponding to the ranking of a certain user during the time period when the user uses the checkout service in a certain store. Although it is different from Modification 2 in that there is a ranking for each time period and the winning probability may change, the lottery processing or the method of granting gifts itself is the same as Modification 2.

Alternatively, the winning probability may be fixed for all users, and the decision unit 103 may decide the gift for each combination of user and time zone. For example, if a user visits store A of "XXX convenience store", the decision unit 103 may decide the gift based on the ranking of store A of "XXX convenience store" in the current time zone among the ranking information of the user.

In addition, both the winning probability and the gift may not be fixed, and the decision unit 103 determines the winning probability and the gift for each combination of the user and the time zone. For example, if a user visits store A of "XXX convenience store", the decision unit 103 determines the winning probability and the gift based on the ranking of store A of "XXX convenience store" in the current time zone among the ranking information of the user.

According to variant 3, for each combination of user and time slot, at least one of the probability of winning a prize and the gift of the user in the time slot is determined based on the usage of the user in the time slot and the relative relationship with the usage of other users in the time slot. In this way, the amount of gifts given to users can be controlled within an appropriate range for each time slot. In addition, since the ranking is calculated for each time slot rather than all time slots, it is easier for users to rise in the ranking of time slots that they usually use. Therefore, the use of checkout services by users can be promoted. From the perspective of the store, the ranking of time slots with fewer customers is easier to rise, so users will focus on those time slots and come to the store, which can improve the customer attraction effect of those time slots.

[5-4. Variant 4] For example, the ranking of users can be determined according to each weather type. The weather type can be sunny, cloudy, rainy, or snowy, or can be temperature, humidity, wind strength, or rainfall. In Variant 4, two types of weather, sunny and rainy, are used as examples to simplify the description. In Variant 4, although the description is combined with Variant 2 to determine the ranking of each store in the store group for each weather type, it can also be combined with Variant 1 to determine the ranking of each weather type in the entire store group, or it can be determined for each weather type in all stores as in the implementation form.

For example, the server 10 counts the total usage of each store in each weather type for each user who has registered for the promotion. Information about the weather can also be included in the usage status information, and the weather can be estimated based on the usage time. The weather can be obtained from a known weather information service. If it is the ranking of store A of "XXX Convenience Store", the server 10 counts the total usage of each store in each weather type for each user. Based on the statistical results, the server 10 determines the ranking of each weather type in "XXX Convenience Store" and updates the user's ranking information. Assume that the ranking information indicates the ranking of users in each weather type.

The decision unit 103 determines at least one of the winning probability and the gift for each combination of user and weather based on the usage status of the user under the weather and the relative relationship with the usage status of other users under the weather. In the variant 4, similar to the implementation form, it is described that the gift is fixed for all users and the winning probability is determined by the decision unit 103 for each combination of user and weather.

For example, the decision unit 103 obtains ranking information associated with a combination of a user who is a lottery target and the weather when the user uses the checkout service. The decision unit 103 determines the chance of winning based on the ranking of the weather when the user uses the checkout service in the ranking information. The weather when visiting the store can also be obtained from a known weather information service.

For example, if a user visits store A of "XXX convenience store" on a sunny day, the decision unit 103 determines the chance of winning based on the ranking of store A of "XXX convenience store" on sunny days in the ranking information of the user. Similarly, if a user visits store A of "XXX convenience store" on a rainy day, the decision unit 103 determines the chance of winning based on the ranking of the store on rainy days. The same is true for users who visit other stores.

Furthermore, the relationship between ranking and winning probability can be common to all weather conditions, or can be determined for each weather condition. For example, the relationship for sunny days and the relationship for rainy days can be determined separately.

The gift giving unit 105 performs a lottery process and gives gifts to each user based on at least one of the user's winning probability and the gift under the weather when the user uses the service. In Modification 4, the gift is fixed for all users, and the winning probability changes with the weather. Therefore, the gift giving unit 105 performs a lottery process and gives gifts based on the winning probability corresponding to the ranking of a certain user under the weather when the user uses the checkout service in a certain store. Although it is different from Modification 2 in that there is a ranking according to each weather and the winning probability may change, the lottery process or the gift giving method itself is the same as Modification 2.

Alternatively, the winning probability may be fixed for all users, and the decision unit 103 may decide the gift for each combination of user and weather. For example, if a user visits store A of "XXX convenience store", the decision unit 103 may decide the gift based on the current weather ranking of store A of "XXX convenience store" among the ranking information of the user.

In addition, both the winning probability and the gift may not be fixed, and the decision unit 103 determines the winning probability and the gift for each combination of user and weather. For example, if a user visits store A of "XXX convenience store", the decision unit 103 determines the winning probability and the gift based on the current weather ranking of store A of "XXX convenience store" in the ranking information of the user.

According to variant 4, for each combination of user and weather, at least one of the user's chance of winning and the gift under that weather is determined based on the user's usage under that weather and the relative relationship with the usage of other users under that weather. In this way, the amount of gifts given to users can be controlled within an appropriate range for each type of weather. In addition, since the ranking is not calculated for all weathers but for each type of weather, the ranking is more likely to rise in weather that other users do not use. From the perspective of stores, the ranking is more likely to rise in rainy days with fewer customers, so users will come to the store when the weather is right, which can improve the customer attraction effect of that weather.

[5-5. Variant 5] For example, the ranking of users can be determined according to the day of each week. In Variant 5, although the day of each week is described by roughly distinguishing between weekdays and weekends, it can also be 7 days of each week from Monday to Sunday. In addition, in Variant 5, although it is described that the ranking of each day of each week in each store of the store group is determined by combining with Variant 2, it can also be combined with Variant 1 to determine the ranking of each day of each week in the entire store group, and it can also be determined in the implementation form, The ranking of each day of each week in all stores.

For example, the server 10 counts the total amount of usage per day in each store for each user who has registered for the promotion. If the ranking is for store A of "XXX convenience store", the server 10 counts the total amount of usage per day in store A of "XXX convenience store" for each user. The server 10 determines the ranking of "XXX convenience store" per day based on the statistical result and updates the ranking information of the user. Assume that the ranking information indicates the ranking of the user per day in each store.

The decision unit 103 determines at least one of the winning probability and the gift for each combination of the user and the weekly child based on the usage status of the user under the weekly child and the relative relationship with the usage status of other users under the weekly child. In the variant 5, similar to the implementation form, it is explained that the gift is fixed for all users, and the decision unit 103 determines the winning probability for each combination of the user and the weekly child.

For example, the decision unit 103 obtains ranking information that is associated with a combination of a user who is a lottery target and the number of days on which the user uses the checkout service. The decision unit 103 determines the chance of winning based on the ranking of the store visited by the user on that day in the ranking information. For example, if a user visits store A of "XXX Convenience Store" on weekdays, the decision unit 103 determines the chance of winning based on the ranking of store A of "XXX Convenience Store" on weekdays in the ranking information of the user. Similarly, if the user visits store A of "XXX Convenience Store" on weekends, the decision unit 103 determines the chance of winning based on the ranking of store A of "XXX Convenience Store" on weekends. The same is true when the user visits other stores.

Furthermore, the relationship between ranking and winning probability may be common for all days of the week or may be determined for each day of the week. For example, the relationship for weekdays and the relationship for weekends may be determined separately.

The gift giving unit 105 performs a lottery process and gives gifts to each user based on at least one of the user's winning probability and the gift in the daily time when the user uses the service. In variant 5, the gift is fixed for all users, and the winning probability changes with the daily time. Therefore, the gift giving unit 105 performs a lottery process and gives gifts based on the winning probability corresponding to the ranking of a certain user in the daily time when the user uses the checkout service in a certain store. Although it is different from variant 2 in that there is a ranking every daily time and the winning probability may change, the lottery process or the gift giving method itself is the same as variant 2.

Alternatively, the winning probability may be fixed for all users, and the decision unit 103 may decide the gift for each combination of the user and the Sunday child. For example, if a user visits store A of "XXX convenience store", the decision unit 103 may decide the gift based on the current ranking of the Sunday child in store A of "XXX convenience store" among the ranking information of the user.

In addition, both the winning probability and the gift may not be fixed, and the decision unit 103 determines the winning probability and the gift for each combination of the user and the Zhoushizi. For example, if a user visits store A of "XXX convenience store", the decision unit 103 determines the winning probability and the gift based on the current ranking of Zhoushizi in store A of "XXX convenience store" among the ranking information of the user.

According to variant 5, for each combination of a user and a Sunday sub-district, at least one of the user's chance of winning a prize and a gift under the Sunday sub-district is determined based on the user's usage of the Sunday sub-district and the relative relationship with the usage of other users under the Sunday sub-district. In this way, the amount of gifts given to users can be controlled within an appropriate range for each Sunday sub-district. In addition, since the ranking is calculated based on each Sunday sub-district instead of the ranking among all Sunday sub-districts, it is easier for users to rise in the ranking of the Sunday sub-districts they usually use. Therefore, the use of the checkout service by users can be promoted. From the perspective of the store, the ranking of a Sunday sub-district with fewer customers is easier to rise, so users will focus on that Sunday sub-district and come to the store, which can improve the customer attraction effect of that Sunday sub-district.

[5-6. Variant 6] For example, the ranking of users can be determined for each area of the store. The area can be a unit such as a prefecture or a city, town, or village, or it can be a self-defined area through the checkout service. Assume that the area to which each store belongs has been pre-defined in the data storage unit 100. The server 10 counts the total amount of usage of each user in each area for each user who has registered for the promotion. The server 10 determines the ranking of users in each area based on the statistical results and updates the ranking information of the users. Assume that the ranking information indicates the ranking of users in each area.

The decision unit 103 determines at least one of the winning probability and the gift in the lottery for each combination of the user and the area based on the usage status of the user in the area and the relative relationship with the usage status of other users in the area. In the variant 6, similar to the embodiment, the gift is fixed for all users, and the decision unit 103 determines the winning probability for each combination of the user and the area.

For example, the decision unit 103 obtains ranking information that associates a combination of a user who is a lottery target and an area where a store visited by the user is located. The decision unit 103 determines the winning probability based on the ranking of the area where the store visited by the user is located in the ranking information. For example, if a user visits a store located in area A, the decision unit 103 determines the winning probability based on the ranking of area A in the ranking information of the user. If a user visits a store located in area B, the decision unit 103 determines the winning probability based on the ranking of area B in the ranking information of the user. Although it is different from the actual implementation form in that there is a ranking for each area, the method of determining the winning probability itself is the same as the actual implementation form.

Furthermore, the relationship between ranking and winning probability may be common to all regions, or may be determined for each region. For example, the relationship for region A and the relationship for region B may be determined separately.

The gift giving unit 105 performs a lottery process and gives gifts to each user based on at least one of the user's winning probability and the gift in the area where the user uses the service. In the sixth variation, the gift is fixed for all users, and the winning probability varies with the area. Therefore, when a certain user uses the checkout service in a certain area, the gift giving unit 105 performs a lottery process and gives gifts based on the winning probability associated with the combination of the user and the area. Although it is different from the actual form in that there is a ranking for each region and the chance of winning may change, the lottery processing and gift awarding method itself are the same as the actual form.

In addition, the winning probability may be fixed for all users, and the decision unit 103 may determine the gift for each combination of user and area. For example, if a user visits a store in area A, the decision unit 103 may determine the gift based on the ranking of area A in the ranking information of the user. If a user visits a store in area B, the decision unit 103 may determine the gift based on the ranking of area B in the ranking information of the user. The gift granting unit 105 may perform a lottery process and grant a gift for each user based on the gifts of the user in the area where the store where the user uses the service is located.

In addition, both the winning probability and the gift may not be fixed, and the decision unit 103 determines both the winning probability and the gift for each combination of the user and the region. For example, if a certain user visits a store in region A, the decision unit 103 determines the winning probability and the gift based on the ranking of region A in the ranking information of the user. If a certain user visits a store in region B, the decision unit 103 determines the winning probability and the gift based on the ranking of region B in the ranking information of the user.

According to variant 6, for each combination of user and area, the probability of winning and at least one of the gifts in the lottery are determined based on the usage of the user in the area and the relative relationship with the usage of other users in the area. In this way, the amount of gifts given to users in each area can be controlled within an appropriate range. In addition, since the ranking is calculated for each area instead of the entire store, it is easier for users to rise in the ranking of the area they usually use. Therefore, the use of checkout services by users can be promoted. From the perspective of the store, the possibility that users who have visited the store once will come back to the store will increase, so the customer attraction effect caused by the promotional activities can be improved.

[5-7. Variant 7] For example, when a user can use the checkout service when purchasing products from multiple vendors, the user's ranking can be determined for each vendor. A vendor is a company that manufactures products. As part of promoting its own products, a vendor can also assist in the promotion of the checkout service. In Variant 7, it is assumed that the product information of the product purchased by the user is included in the usage status information. It is assumed that the product information includes product identification information such as a JAN code, product name, and unit price. It is assumed that the data storage unit 100 stores information that can identify which vendor's product it is according to each product identification information.

In variant 7, a case where two manufacturers, "CCC Co., Ltd." and "DDD Co., Ltd." are described. For each user who has registered for the promotion, the server 10 calculates the total amount of usage required for the user to purchase products manufactured by "CCC Co., Ltd." and the total amount of usage required for the user to purchase products manufactured by "DDD Co., Ltd.". Based on these statistical results, the server 10 determines the ranking of users in "CCC Co., Ltd." and the ranking of users in "DDD Co., Ltd." and updates the user ranking information. It is assumed that the ranking information indicates the ranking of users of these manufacturers.

The decision unit 103 determines at least one of the winning probability and the gift for each combination of the user and the vendor based on the usage of the user in the vendor and the relative relationship with the usage of other users in the vendor. In variant 7, similar to the implementation form, the gift is fixed for all users, and the winning probability is determined by the decision unit 103 for each combination of the user and the vendor. In variant 7, the store terminal 30 can send the product information of the product purchased by the user to the server 10. The server 10 can specify what kind of product the user wants to purchase based on the product information.

For example, the decision unit 103 obtains ranking information that associates a combination of a user who is a lottery target and a manufacturer of a product purchased by the user. The decision unit 103 determines the chance of winning based on the ranking of the manufacturer of the product purchased by the user in the ranking information. For example, if a user purchases a product from "CCC Co., Ltd.", the decision unit 103 determines the chance of winning based on the ranking of "CCC Co., Ltd." in the ranking information of the user. If a user purchases a product from "DDD Co., Ltd.", the decision unit 103 determines the chance of winning based on the ranking of "DDD Co., Ltd." in the ranking information of the user. Although it is different from the actual implementation in that there is a ranking for each manufacturer, the method of determining the chance of winning is the same as the actual implementation.

In addition, the relationship between ranking and winning probability can be common to all vendors, or can be determined for each vendor. For example, the relationship used by "CCC Co., Ltd." and the relationship used by "DDD Co., Ltd." can also be determined individually.

The gift giving unit 105 performs a lottery process and gives gifts to each user based on at least one of the user's chance of winning a prize in the vendor of the product purchased by the user using the service and the gift. In variation 7, the gift is fixed for all users, and the chance of winning changes depending on the vendor of the product the user wants to purchase. Therefore, the gift giving unit 105 performs a lottery process and gives gifts based on the chance of winning associated with the combination of the user and the vendor when a user wants to purchase a product from a certain vendor. Although it is different from the actual form in that there is a ranking for each product and the chance of winning may change, the lottery processing and gift awarding method itself is the same as the actual form.

In addition, the probability of winning may be fixed for all users, and the decision unit 103 may determine the gift for each combination of user and vendor. For example, if a user purchases a product from "CCC Co., Ltd.", the decision unit 103 may determine the gift based on the ranking of "CCC Co., Ltd." in the ranking information of the user. If a user purchases a product from "DDD Co., Ltd.", the decision unit 103 may determine the gift based on the ranking of "DDD Co., Ltd." in the ranking information of the user. The gift granting unit 105 may perform a lottery process and grant a gift to each user based on the gifts of the user from the vendor of the product purchased by the user.

In addition, both the winning probability and the gift may not be fixed, and the decision unit 103 determines the winning probability and the gift for each combination of the user and the vendor. For example, if a user purchases a product of "CCC Co., Ltd.", the decision unit 103 determines the winning probability and the gift based on the ranking of "CCC Co., Ltd." in the ranking information of the user. If a user purchases a product of "DDD Co., Ltd.", the decision unit 103 determines the winning probability and the gift based on the ranking of "DDD Co., Ltd." in the ranking information of the user.

According to variant 7, for each combination of a user and a vendor, at least one of the probability of winning a prize and a gift for the user in the vendor is determined based on the usage of the user in the vendor and the relative relationship with the usage of other users in the vendor. In this way, the amount of gifts given to users can be controlled within an appropriate range for each vendor. In addition, since the ranking is calculated for each vendor instead of all vendors, it is easier for users to rise in the ranking of the vendors of the goods they usually purchase. Therefore, the use of the checkout service by users can be promoted. From the perspective of the vendor, the possibility that a user who has purchased their product once will purchase it again will increase, so the promotion effect caused by the promotional activities can be improved.

[5-8. Variant 8] For example, although Variant 7 describes the case where the ranking is determined for each vendor, the ranking may be determined for each product. The product may be a specific product that is the target of a promotional activity, or may be a general product such as food or beverage. In Variant 8, similar to Variant 7, it is assumed that the product information of the product purchased by the user is included in the usage information.

In variant 8, it is described that two products, "EEE juice" and "FFF cake", are on sale. For each user who has registered for the sale, the server 10 counts the total amount of "EEE juice" that the user has ever purchased and the total amount of "FFF cake" that the user has ever purchased. Based on these statistical results, the server 10 determines the ranking of the user in "EEE juice" and the ranking of the user in "FFF cake", and updates the ranking information of the user. It is assumed that the ranking information shows the ranking of the users of these products.

For example, the decision unit 103 determines at least one of the winning probability and the gift for each combination of the user and the product based on the user's usage of the product and the relative relationship with the usage of other users of the product. In the variant 8, similar to the embodiment, the gift is fixed for all users, and the decision unit 103 determines the winning probability for each combination of the user and the product.

For example, the decision unit 103 obtains ranking information that associates a user who is a lottery target with a combination of products purchased by the user. The decision unit 103 determines the winning probability based on the ranking of the products purchased by the user in the ranking information. For example, if a certain user purchases the product "EEE juice", the decision unit 103 determines the winning probability based on the ranking of the product in the ranking information of the user. If a certain user purchases the product "FFF cake", the decision unit 103 determines the winning probability based on the ranking of the product in the ranking information of the user. Although it is different from the implementation form in that there is a ranking for each product, the method of determining the winning probability itself is the same as the implementation form.

Furthermore, the relationship between the ranking and the chance of winning can be common to all products or can be determined for each product. For example, the relationship between the product "EEE juice" and the product "FFF cake" can be determined individually.

The gift giving unit 105 performs a lottery process and gives gifts to each user based on at least one of the user's chance of winning a prize in the goods purchased by the user using the service and the gift. In the variant 8, the gift is fixed for all users, and the chance of winning a prize changes depending on the goods the user wants to purchase. Therefore, the gift giving unit 105 performs a lottery process and gives gifts based on the chance of winning associated with the combination of the user and the goods when a user wants to purchase a certain goods. Although it is different from the actual form in that there is a ranking for each product and the chance of winning may change, the lottery processing and gift awarding method itself is the same as the actual form.

In addition, the probability of winning a prize may be fixed for all users, and the decision unit 103 may determine a gift for each combination of a user and a product. For example, if a user purchases the product "EEE juice", the decision unit 103 may determine a gift based on the ranking of the product in the ranking information of the user. If a user purchases the product "FFF cake", the decision unit 103 may determine a gift based on the ranking of the product in the ranking information of the user. The gift granting unit 105 may perform a lottery process and grant a gift to each user based on the gift of the user in the product purchased by the user.

In addition, both the winning probability and the gift may not be fixed, and the decision unit 103 determines the winning probability and the gift for each combination of the user and the product. For example, when a user purchases the product "EEE juice", the decision unit 103 determines the winning probability and the gift based on the ranking of the product in the ranking information of the user. When a user purchases the product "FFF cake", the decision unit 103 determines the winning probability and the gift based on the ranking of the product in the ranking information of the user.

According to variant 8, for each combination of user and product, at least one of the probability of winning and the gift is determined based on the user's usage of the product and the relative relationship with the usage of the product by other users. In this way, the amount of gift given to the user can be controlled within an appropriate range for each product. In addition, since the ranking is calculated for each product instead of all products, it is easier for the user to rise in the ranking of the products he usually purchases. Therefore, the use of the checkout service by users can be promoted. From the perspective of manufacturers or stores, the possibility that users who have purchased a specific product once will purchase it again will increase, so the promotion effect caused by the promotional activities can be improved.

[5-9. Modification 9] For example, the winning probability determined based on the user's ranking can be changed based on the user's usage status information. For example, the winning probability determined based on the ranking among all users as in the implementation form can be changed based on the user's usage status in the store visited by the user. For example, the winning probability can be changed in such a way that the greater the total amount of usage in the store visited by the user, the greater the increase in the winning probability determined based on the ranking among all users.

FIG8 is a functional block diagram of modification 9. The changing unit 106 is realized mainly by the control unit 11. The changing unit 106 changes at least one of the winning probability and the gift of each user determined by the determination unit 103 based on the usage status information of the user. In modification 9, similar to the implementation form, it is explained that the gift is fixed for all users, and the winning probability is determined by the determination unit 103 for each user.

The changing unit 106 increases the winning probability determined by the determining unit 103 for each user when the usage status indicated by the usage status information of the user satisfies a predetermined condition. For example, the changing unit 106 may increase the winning probability determined by the determining unit 103 of Modification 1 or Modification 2 when the total usage amount of the store or store group visited by the user is greater than a threshold. The changing unit 106 may increase the winning probability determined by the determining unit 103 of Modification 3 when the total usage amount during the time period when the user uses the checkout service is greater than a threshold.

The changing unit 106 may also improve the winning probability determined by the determining unit 103 of Modifications 4 to 6 when the total amount of usage in the weather, day of the week, or area in which the user uses the checkout service is greater than a threshold. The changing unit 106 may also improve the winning probability determined by the determining unit 103 of Modifications 7 or 8 when the manufacturer of the product purchased by the user or the total amount of usage of the product is greater than a threshold.

In addition, the winning probability may be fixed for all users, and the changing unit 106 may change the gift of the user determined by the determining unit 103 based on the usage information of the user for each user. For example, the changing unit 106 may change the gift determined in the embodiment or modification examples 1 to 8 based on the usage of the user in the store visited by the user. In addition, both the winning probability and the gift may not be fixed, and the changing unit 106 may change the winning probability and the gift of the user determined by the determining unit 103 based on the usage information of the user for each user. For example, the changing unit 106 may also change the winning probability and the gift determined in the embodiment or variations 1 to 8 based on the usage status of the user in the store visited by the user.

The gift giving unit 105 performs a lottery process and gives gifts to each user based on at least one of the winning probability and the gift of the user changed by the changing unit 106. This is different from the embodiment and variants 1 to 9 in that at least one of the winning probability and the gift changed by the changing unit 106 is used, but the other points are the same.

According to variant 9, at least one of the user's winning probability and gift is changed for each user based on the user's usage information. In this way, at least one of the winning probability and gift determined by the relationship with other users can be changed based on the user's inherent usage information, which can promote the use of the checkout service by the user. In addition, in variant 9, it is not necessary to consider the relative usage status as in the implementation form. For example, the gift giving system S of variant 9 can also omit the determination unit 103, and the change unit 106 changes at least one of the user's winning probability and gift for each user based on the user's usage information.

[5-10. Other variations] For example, the variations described above can be combined.

For example, the stores that can use the checkout service are not limited to physical stores, but can also be online stores. In this case, when the user uses an online store, the gift giving system S only needs to determine at least one of the winning probability and the gift based on the user's ranking and perform a lottery. For example, the gift giving system S can also be applied to promotional activities in any service other than the checkout service. For example, the user's winning probability and at least one of the gifts can also be determined based on the relative relationship of the use status in e-commerce transaction services, financial services, communication services, travel reservation services, insurance services, or SNS.

For example, although the main functions are described as being implemented by the server 10, each function may be shared by a plurality of computers. For example, the functions described as being implemented in the server 10 may also be implemented in the user terminal 20, the store terminal 30, or other computers. The data described as being stored in the server 10 may also be stored in other computers such as a database server.

S: Gift system N: Network 10: Server 11,21,31: Control unit 12,22,32: Memory unit 13,23,33: Communication unit 20: User terminal 24,34: Operation unit 25,35: Display unit 30: Store terminal 36: Reading device G1: Main screen G2: Registration acceptance screen G3: Registration completion screen G4: Checkout completion screen 100: Data storage unit 101: Checkout execution unit 102: Usage status acquisition unit 103: Decision unit 104: Notification unit 105: Gift department 106: Change unit 200: Data storage unit 201: Display control unit 300: Data storage unit 301: Checkout request signaling unit B11, B12, B20, B30: Buttons C10: Code DB1: User database DB2: Promotion database

[Figure 1] An example of the overall configuration of the gift system described in the embodiment. [Figure 2] An example of a user using a checkout service. [Figure 3] An example of a process from a user registering for a promotion to the execution of a lottery. [Figure 4] A functional block diagram of an example of functions implemented in the gift system. [Figure 5] An example of a user database. [Figure 6] An example of a promotion database. [Figure 7] A flow chart of an example of processing performed in the gift system. [Figure 8] A functional block diagram of variant 9.

10: Server

20: User terminal

30: Store terminal

100: Data storage unit

101: Checkout Processing Execution Department

102: Usage status acquisition unit

103: Decision Department

104: Notification Department

105: Gift Giving Department

200: Data storage unit

201: Display control unit

300: Data storage unit

301: Checkout request sent to the signal department

DB1: User database

DB2: Promotional activity database

Claims (14)

A gift giving system includes: a usage status acquisition unit for acquiring usage status information about the usage status of a service provided by each of a plurality of users; a determination unit for determining, for each previous user, the user's winning probability and at least one of the gifts based on the relative relationship between the usage status indicated by the previous usage status information of the user and the usage status indicated by the previous usage status information of other users; and a gift giving unit for performing a lottery process and giving gifts to each previous user based on at least one of the user's previous winning probability and the previous gifts; once the previous user uses The pre-recorded service will execute the specified lottery processing and give the winning user a gift during the promotional activity: each time the pre-recorded user uses the pre-recorded service, the pre-recorded usage information is updated; the pre-recorded determination unit determines the user's winning probability and at least one of the gifts based on the relative relationship between the user's usage status represented by the pre-recorded updated usage status information and the usage status of other users each time the pre-recorded user uses the pre-recorded service; the pre-recorded gift giving unit executes the pre-recorded lottery processing and gives the pre-recorded gift based on at least one of the pre-recorded winning probability and the gift each time the pre-recorded user uses the pre-recorded service. The gift giving system as described in claim 1, wherein: The pre-record service can be used in a plurality of stores; the pre-record determination unit determines at least one of the pre-record winning probability and the pre-record gift of the user in the store for each combination of the pre-record user and the pre-record store based on the user's usage status in the store and the relative relationship with the usage status of other users in the store; and the pre-record gift giving unit performs the pre-record lottery processing and gives the pre-record gift to each pre-record user based on at least one of the user's pre-record winning probability and the pre-record gift in the store where the user uses the pre-record service. The gift giving system as described in claim 2, wherein the plurality of pre-recorded stores belong to a predetermined store group; the pre-recorded determination unit determines, for each pre-recorded user, the pre-recorded winning probability and at least one of the pre-recorded gifts of the user in the first store in the pre-recorded store group, and the pre-recorded winning probability and at least one of the pre-recorded gifts of the user in the second store in the pre-recorded store group; the pre-recorded gift giving unit determines the pre-recorded winning probability and at least one of the pre-recorded gifts of the user in the second store in the pre-recorded store group; If any one of the multiple users uses the first store mentioned above, the previous record lottery process is performed and the previous record gift is given based on at least one of the user's previous record winning probability and the previous record gift in the first store; if any one of the multiple users uses the second store mentioned above, the previous record lottery process is performed and the previous record gift is given based on at least one of the user's previous record winning probability and the previous record gift in the second store. A gift awarding system as described in any one of claim items 1 to 3, wherein the pre-record determination unit determines at least one of the pre-record winning probability and the pre-record gift of the user in the time zone for each combination of the pre-record user and the time zone based on the usage status of the user in the time zone and the relative relationship with the usage status of other users in the time zone; and the pre-record gift awarding unit performs pre-record lottery processing and awards the pre-record gift to each pre-record user based on at least one of the pre-record winning probability and the pre-record gift of the user in the time zone when the user uses the pre-record service. The gift awarding system described in any one of claim items 1 to 3, wherein the pre-record determination unit determines at least one of the pre-record winning probability and the pre-record gift of the user under the weather for each combination of the pre-record user and the weather, based on the usage status of the user under the weather and the relative relationship with the usage status of other users under the weather; the pre-record gift awarding unit performs the pre-record lottery processing and awards the pre-record gift to each pre-record user based on at least one of the pre-record winning probability and the pre-record gift of the user under the weather when the user uses the pre-record service. A gift giving system as described in any one of claim items 1 to 3, wherein: The pre-record determination unit determines at least one of the winning probability and the gift of the user in the daily sub-item for each combination of the pre-record user and the daily sub-item based on the usage status of the user in the daily sub-item and the relative relationship with the usage status of other users in the daily sub-item; the pre-record gift giving unit performs the pre-record lottery processing and gives the pre-record gift to each pre-record user based on at least one of the pre-record winning probability and the pre-record gift of the user in the daily sub-item when the user uses the pre-record service. The gift giving system described in any one of claim items 1 to 3, wherein the pre-record determination unit determines at least one of the winning probability and the gift during the lottery for each combination of pre-record users and areas based on the usage status of the user in the area and the relative relationship with the usage status of other users in the area; the pre-record gift giving unit performs pre-record lottery processing and gives pre-record gifts for each pre-record user based on at least one of the pre-record winning probability and the pre-record gift of the user in the area where the user uses the pre-record service. A gift giving system as described in any one of claim items 1 to 3, wherein a pre-recorded service can be used when purchasing products of each of a plurality of vendors; a pre-recorded determination unit determines, for each combination of a pre-recorded user and a pre-recorded vendor, at least one of the winning probability and the gift of the user in the vendor based on the usage status of the user in the vendor and the relative relationship between the usage status of other users in the vendor; a pre-recorded gift giving unit performs a pre-recorded lottery process and gives a pre-recorded gift to each pre-recorded user based on at least one of the pre-recorded winning probability and the pre-recorded gift of the user in the pre-recorded vendor of the product purchased by the user using the pre-recorded service. The gift giving system described in any one of claim items 1 to 3, wherein the pre-record determination unit determines at least one of the pre-record winning probability and the pre-record gift for each combination of a pre-record user and a product based on the user's usage of the product and the relative relationship with the usage of the product by other users; the pre-record gift giving unit performs a pre-record lottery process and gives the pre-record gift to each pre-record user based on at least one of the user's pre-record winning probability and the pre-record gift in the product purchased by the user using the pre-record service. The gift giving system described in any one of claim items 1 to 3, wherein the pre-record gift giving system further comprises: a change unit for changing at least one of the pre-record winning probability and the pre-record gift for each pre-record user based on the user's usage status information; and a pre-record gift giving unit for performing pre-record lottery processing and giving pre-record gifts for each pre-record user based on at least one of the pre-record winning probability and the pre-record gift of the user that has been changed by the pre-record changing unit. The gift giving system described in any one of claim items 1 to 3, wherein the pre-record gift giving system further comprises: a notification unit for notifying each of a plurality of pre-record users of at least one of the pre-record winning probability and the pre-record gift of the user; and a pre-record gift giving unit for executing the pre-record lottery process and giving the pre-record gift after the pre-record notification unit has made the notification. A gift giving system as described in any one of claim items 1 to 3, wherein the relative relationship mentioned above is a ranking of the usage of the services mentioned above; and the previous record determination unit determines at least one of the user's chance of winning a prize and a gift based on the user's ranking for each previous record user. A gift giving method includes: a usage information acquisition step, in which a usage information acquisition unit acquires usage information about the usage of a service by each of a plurality of users; and a determination step, in which the determination unit determines at least one of the user's winning probability and a gift for each previous user based on the relative relationship between the user's usage status represented by the previous usage information of the user and the usage status represented by the previous usage information of other users; and a gift giving step, in which a gift giving unit performs a lottery process and gives a gift for each previous user based on at least one of the user's previous winning probability and a previous gift; Once the previous user uses the previous service, the specified lottery process will be executed, and during the promotional activity period, the winning user will be given a gift: each time the previous user uses the previous service, the previous usage information is updated; in the previous determination step, each time the previous user uses the previous service, the user's winning probability and at least one of the gifts are determined based on the relative relationship between the user's usage status represented by the updated usage information and the usage status of other users; in the previous gift giving step, each time the previous user uses the previous service, the previous lottery process is executed and the previous gift is given based on at least one of the previous winning probability and the gift. A program product is used to make a computer function so as to: a usage status acquisition unit is used to acquire usage status information about the usage status of a service by each of a plurality of users; a determination unit is used to determine at least one of the user's winning probability and a gift for each previous user based on the relative relationship between the user's usage status represented by the previous usage status information of the user and the usage status represented by the previous usage status information of other users; a gift giving unit is used to execute a lottery process and give a gift for each previous user based on at least one of the user's previous winning probability and a previous gift; once the previous user During the promotional activity period, when a user uses the pre-recorded service, the predetermined lottery process will be executed, and the winning user will be given a gift: Each time the pre-recorded user uses the pre-recorded service, the pre-recorded usage status information is updated; the pre-recorded determination unit determines the user's winning probability and at least one of the gifts based on the relative relationship between the user's usage status and the usage status of other users indicated by the pre-recorded updated usage status information each time the pre-recorded user uses the pre-recorded service; the pre-recorded gift giving unit executes the pre-recorded lottery process and gives the pre-recorded gift based on at least one of the pre-recorded winning probability and the gift each time the pre-recorded user uses the pre-recorded service.

Images