JP2013168042A - Contest server device - Google Patents

Abstract

PROBLEM TO BE SOLVED: To provide a contest server device for a contest in which registration and vote is possible by accessing through network from a communications terminal.SOLUTION: A contest server device comprises: an entry program to enter from a communications terminal; a grouping program to group entries into groups; a vote program to determine a winner by a tournament system; and a CPU to executes these programs. In a first preliminary of the tournament, the grouping program groups entries received within an entry time into groups targeted for examination each including a predetermined number (n) of entries. In a second preliminary and later, the grouping program executes temporary grouping to group the winner entries into groups each including the predetermined number (n) of entries in such a manner that entries with many votes are not concentrated in a certain group, and executes reorganization of groups to calculate a difference (p2) between a number (m2) of entries included in the last temporary group and the number (n) of entries to be included in one group, to choose the entries defeated in a preceding preliminary by a number equal to the difference (p2) in descending order of the number of votes and to incorporate the chosen entries in the last group.

Description

  The present invention relates to a contest server device that automatically processes up to the final match for application / voting from a mobile terminal or PC terminal via a network.

  As a contest system for voting via a network using a server device, those listed in Patent Documents 1 to 3 are known.

  Patent Document 1 discloses a contest server via an Internet communication network, a packet processing unit for performing NTT DOCOMO's “i-mode” (registered trademark) communication via a packet communication network, a display for displaying images and characters, and character input. A contest system is disclosed that includes a mobile phone having an input unit for performing the above.

  In particular, in Patent Document 1, an audition applicant and voter operate the mobile phone to execute an audition application and voting program for access via the communication interface unit, and the voter operates. The mobile phone displays, on the display unit, a screen for simultaneously displaying images of all applicants who are a plurality of selected people in a format in which one image corresponds to one key button, There is a description that an image of a specific applicant is displayed on the display unit in an enlarged manner by selecting the image by a key button on the screen.

  In Patent Document 2, examination by voting at each stage of the audition is divided into examination groups that are subject to voting consisting of multiple applicants, and the applicants selected in the low-level examination are gathered to conduct high-level examination. A program that leads to the final game, a program that prevents duplicate registration from the same mobile phone in the screening group unit by identifying the ID, and a screening group for higher screening in the middle of a lower screening There are descriptions including a first-in first-out multiple voting program in which low-level screening is continued while the number of cases to be collected continues, and a program that excludes screening groups that have been screened from being displayed.

  Patent Document 3 uses an application server connected to a network and a mobile phone provided with an ID, and the application server includes a CPU for executing an audition application and voting program. Dividing the screening by stage voting into screening groups consisting of multiple applicants, collecting the applicants selected in the low-level screening, conducting a high-level screening and leading to the final game, A program that prevents duplicate registration from the same mobile phone in the examination group unit by identifying the ID, and the number of cases that constitute the examination group of the higher examination in the middle of the lower examination, The first-in, first-out multiple voting program, which continues the screening of the high-level screening, and the applicants who were not selected in the low-level screening There is a description that contains the consolation of programs incorporating the applicants selected from among the higher-order of examination.

JP 2010-157020 (Patent No. 431824) JP 2010-282313 (Patent No. 4338779) JP 2010-282321 A

  In the above-mentioned patent documents 1 to 3, when one group displayed on the screen of a communication terminal such as a mobile phone is composed of n persons and the total number of applications is N, N is not necessarily a multiple of n. Since it is not limited, the last remaining group is not necessarily composed of n cases, and a problem remains in the processing.

  In addition, when a contest is conducted in a tournament format, the same problem as described above occurs when a transition is made from a low-level screening to a high-level screening. In particular, even if the total number of applications N is a multiple of n, even if the first round can be judged as it is, it may not be a multiple of n in the high order examination.

  In the present invention, even when the total number of applications at each level when a contest is conducted in a tournament format is not a multiple of the number of cases that constitute each group, the number of wins (number of people) is less than the number n that constitutes one group. However, the task was to make the contest run smoothly automatically.

In order to solve the above-described problems, the present invention configures the contest server device so that the communication terminal can enter and vote for the contest by accessing a predetermined server computer via the network.
The server device includes an application program for receiving an application from a communication terminal, a grouping program for grouping the submitted works for each group, a voting program for deciding whether to win by a tournament method, these application programs, a grouping program, and A CPU for executing a voting program;
The application program accepts user registration and application from the communication terminal,
In the first qualifying tournament, the grouping program constitutes a temporary grouping that divides the applications received during the application period into groups to be voted for a predetermined number (n1) and a final group that has been temporarily grouped. The difference (p1) between the number of cases (m1) and the number of group members (n1) is calculated, p1 pairs are randomly selected from other than the final group, and one application is selected from the selected group and reorganized. And sending the reorganization content to the applicants of the reorganized group,
In addition, after the second round of the tournament, the grouping program is divided into a predetermined number of groups (n2) and temporary grouping so that entries with a large number of winning votes are not biased to one group. Calculate the difference (p2) between the number (m2) and group number (n2) that make up the final set, and use this difference (p2) for the number of votes that were lost in the previous qualifying session. Selected in the order they were selected, incorporated into the final set and reorganized, and the reorganization content sent to the applicants of the reorganized group,
The voting program stocks data for each group generated by the grouping program, transmits data for each group to the communication terminal in response to a request from the communication terminal, and the same period for qualifying belonging to the same level If the number of winning entries that advance to the next screening level is n or less, the next screening level will be the final round, and if the number of screening objects is (n + 1) or more, qualifying The examination was continued.

In the reorganization of the grouping program in the first preliminary round of the above tournament, if the p1 group is randomly selected from other than the final group, and the entries are included in the final group one by one from the selected group, the selected group is composed Instead of reducing the number of cases, a dummy application created in advance is replenished for traces that have missed the final group. As a result, the program determines that the group satisfies the determined number of components.
This dummy application will not win, but it is desirable to inform the voter that it is a dummy.

  In the present invention, the communication terminal includes a terminal capable of bidirectional communication, such as a mobile phone, a smartphone, a notebook personal computer, and a desktop personal computer.

  The minimum number of applications constituting one group in the grouping program is three. In addition, when the number of cases (m1 or m2) constituting the final set is the same as the number of group constituents (n1 or n2), the difference (p1 or p2) is 0, but the system is reorganized with p = 0. .

In addition, after the second qualifying, as a method to divide into a group so that the number of votes that won the winning application is not biased to one group, create a list from the acquired voting data created using the voting program and acquire Votes to say that the application with the highest number of votes will be assigned to the first group, the application with the second highest number of votes will be assigned to the second group, and the application with the third highest number of votes will be assigned to the third group. Make sure that many applications do not enter the same group.
In this respect, unlike a simple tournament system, when there are multiple qualifying sessions, the grouping is performed again for each qualifying session.

  A program for preventing duplicate voting from the same communication terminal may be added to the voting program. The winning conditions for each group in the voting program can be based on conditions such as the maximum number of votes in a voting period, the arrival of the earliest to a predetermined number of votes.

According to the contest server apparatus according to the present invention, when a contest is performed in a tournament format, even if there is a remainder without dividing the total number of applications into a group consisting of a predetermined number, the group is automatically reorganized. The contest is fair because it does not require a lot of time and effort, and there is no arbitrary choice.
In addition, although only one set of groups is displayed on the screen of the communication terminal, voting at the same level (such as the first qualifying) is performed for the same period (for example, 12) in order to display any group that is accepting votes at the request of the voter. It can be completed within a predetermined period (for example, 3 days) without any trouble even if there are tens of thousands of applications.

  In addition, the voting program is divided into qualifying and final rounds, and if the number of entries to advance to the next examination level becomes n or less, the next examination level is regarded as the final round, and the number of examination objects is (n + 1) or more. In such a case, the qualifying examination is continued, so that the program can proceed smoothly from the qualifying to the final round.

Figure of contest server device according to the present invention Diagram showing time series process of contest system The figure which shows the flowchart of the communication terminal of the applicant and the server device The figure which shows the flowchart of a communication terminal and server apparatus of a voter Figure showing mobile display screen Figure showing mobile display screen Figure showing mobile display screen Figure showing mobile display screen

  The best mode for carrying out the present invention will be described below in detail with reference to the drawings. In the following description, components having the same function are denoted by the same reference numerals, and repeated description thereof is omitted.

FIG. 1 is an overall view of an application and voting system incorporating a contest server device 1 according to the present invention. This system includes a network 2 such as the Internet,
A base station 3 that communicates with the network 2 via a center, and a communication terminal 4 (including a desktop type PC 4c and a notebook type PC 4d) such as a mobile phone 4a and a smartphone 4b that communicate with the base station 3, It comprises a database 5 having storage means connected to the server device 1.

Examples of the network 2 include i-mode (registered trademark), EZweb (registered trademark), and Yahoo (registered trademark).
As the contest server device 1 connected to the network 2, a general-purpose computer can be used. In addition to a CPU that executes contest application, grouping, and voting programs, ROM, RAM, HDD, BIOS, communication interface unit ( COM I / F), keyboard KB, mouse MS, and display DSP. Of these, ROM, RAM, HDD, BIOS, and communication interface unit (COM I / F) are connected to the CPU via a bus, and keyboard KB and mouse MS are connected to the CPU via a human interface HI / F. Yes.

  The ROM is a read-only storage device that stores a system program, and the CPU is activated by a system program stored in the BIOS or ROM, and has a function of executing various processes according to the program expanded in the RAM.

  The contest server device 1 also functions as a WWW server that provides a Web site for providing Web pages on the Internet WWW. The database 5 connected to the contest server device 1 includes communication terminals for applicants and voters. Stores IDs and the like possessed.

Next, an application and voting system incorporating the contest server device 1 will be described with reference to FIGS.
FIG. 2 is a diagram for explaining the outline from the first qualifying to the final match, in which the horizontal axis indicates the flow of the application time, and the vertical axis indicates the level of the contest (higher as it goes up).
Further, in the embodiment, there are 141 applications within the determined application period, and 9 people constitute one group to be voted, and 3 applications win from 1 group.

First, as shown in FIG. 3, when an application is accessed from the applicant's communication terminal to the contest server device 1, the ID of the communication terminal is confirmed. If the ID cannot be confirmed, the process is terminated. If the ID is confirmed, the name of the contest being held is transmitted to the applicant. An example of the transmission screen is shown in FIG.
In the ID detection of the access terminal, identification information is obtained from a communication terminal such as a mobile phone as an access source or a personal computer. For example, a SIM card is contained in a mobile phone. Since the SIM card stores a unique ID number for identifying the telephone number of a mobile phone of a system such as GSM or W-CDMA, if the command is sent from the outside to the SIM card, the ID number is Sent out.

  In response to the transmission from the contest server device 1, the applicant selects a contest that he / she wishes to apply from “Recruiting works”. Then, since it replaces the transmission mail screen to the contest server device 1, the user's work is attached to the mail and transmitted.

  In the contest server device 1 that has received the work from the applicant, the content of the applied work is checked. The manager mainly checks whether this check includes things that are offensive to public order and morals. As a result of the content check, an inappropriate application is notified to the applicant and “terminated”.

  If the content of the application is OK, the applicant is again asked whether the content can be posted. If the content is OK, the content of the application is stored.

As described above, applications are accepted for a certain period. In the example shown in FIG. 1, there were 141 applications within the application period.
The primary screening grouping consists of temporary grouping and reorganization. In the provisional grouping, the total number of applications received within the application period is divided into groups to be voted by a predetermined number (n). In the case of the present embodiment, the total number of applications is 141 and the predetermined number (n) is 9. When 141 is divided by 9, the number of constituents is nine up to the fifteenth group, but the number of constituents is six in the sixteenth group.
Depending on the total number of entries, the number of entries that make up the last group may be one.

Therefore, reorganization is performed after provisional grouping. The reorganization calculates the difference (p1) between the number (m1) of the final group and the number of group members (n), randomly selects the p1 group from other than the final group, and applies one by one from the selected group Include in the final set.
When applied to the embodiment, since m1 = 6 and n1 = 9, p1 = 3. To fill this 3rd place, the 9th application of the 1st group, the 7th application of the 4th group, and the 2nd application of the 6th group indicated by a dotted circle are included in the 16th group, and the average number of members To do.
The first group, the fourth group, and the sixth group will have an actual configuration number of 8, but if this is the case, the computer will determine that the group is not configured, and the program may stop. A dummy application is put in the missing trace, and each group is judged to be grouped from a predetermined number.

As a result, the first group, the fourth group, and the sixth group are slightly advantageous, but since they are determined at random, fairness is ensured.

Returning to FIG. 3, when the grouping of the primary examination is completed as described above, the applicant is notified of the number of the group to which his application belongs and from when the qualifying starts.
Note that the data is stored for each group so that the data for each group can be individually taken out after the grouping of the primary examination is completed.

  Once the qualifying starts, you will receive a vote. As shown in FIG. 4, when the voter accepts access to the contest server device 1 from the voter's communication terminal, the ID of the communication terminal is confirmed. If the ID cannot be confirmed, the process is terminated. If the ID is confirmed, the name of the contest being held is transmitted to the applicant. This screen is the same as in the case of the application shown in FIG.

In response to the transmission from the contest server device 1, the voter selects a contest that he / she wishes to apply from “voting”. In the case of this embodiment, a “landscape contest” and a “new year contest”.
When “Scenery contest” is selected, the number of the group currently being voted for in the contest is displayed as shown in FIG. 6, so the voter selects the number of the group that he / she wishes to vote for. .
In most cases, applicants and voters often have some kind of connection, and in most cases, applicants are informed of the group number of the entry, but voters who have no connection have their favorite numbers. Or select all groups in order.

When the group number is selected by the voter, the content is transmitted to the contest server device 1, and the data for each group is transmitted from the contest server device 1 to the voter and displayed.
In the embodiment, as shown in FIG. 7, since the voter has selected the fifteenth group, images of nine entries belonging to the fifteenth group are displayed.

  When one of the nine submitted submission images is selected, the image is enlarged as shown in FIG. The voter looks at the enlarged image and decides whether or not to vote, and when voting, selects a voting button at the bottom of the screen.

When the voting button is selected, the contest server device 1 receives it and counts it.
The winning condition is determined by the number of votes cast within a predetermined period for each group, and for example, the top three are transferred to the second qualifying for each group. Note that the winning condition is arbitrary, such as a work that has reached a certain number of votes first. The applicant is notified of the result of the primary examination.

Returning to FIG. 2, when the primary examination is completed, the process proceeds to the secondary examination. In the second screening, the grouping is first performed. The grouping of the secondary examination also consists of temporary grouping and reorganization.
Temporary grouping ensures that works that have won the first round of screening are those with a large number of votes in one group.
Although it is possible to simply distribute randomly, it is possible to correct the bias by distributing the work with the largest number of votes to the first group and the work with the next largest number of votes to the second group.

In the present embodiment, the number of entries (n2) constituting the group for the secondary examination is also set to nine. The total number of entries that won the first round of screening was 33.
As a result, in the provisional grouping, the number of constituents is nine up to the fifth group of the second preliminary round, but the number of constituents of the sixth group is three.

Therefore, in the reorganization in the second qualifying, the difference (p2) between the number of cases (m2) and the number of group formations (n2) constituting the final group that was provisionally grouped is calculated, and this difference (p2) is calculated by the previous one. The entries that were defeated in qualifying will be selected in the order of the most votes, and will be included in the final group.
Specifically, in the case of the example, m2 = 3, n2 = 9, and p2 = 6, and therefore, six submitted works are incorporated into the sixth group when the loser is revived. The conditions for losing a loser are included in order of the number of votes cast in the first round.

  In this way, when the grouping in the second qualifying is completed, the data for each group is sent so that the winning applicant can be notified of the new group number and the data for each group can be retrieved individually. Remember.

Thereafter, a secondary examination is performed in the same manner as described above. In the case of this example, the number of winning entries that remain after the second qualifying is 18 (first group and second group).
In this way, qualifying is repeated, and when the number of winning applications that advance to the next examination level becomes n or less, the next examination level is judged as the final game.
Therefore, the third qualifying will be held only in the first group and the second group, and 6 cases will be transferred to the final round.

  By using screen listing on mobile phones with a high penetration rate and conducting multiple stages of screening simultaneously, it is possible to automatically process all contests that require a short time for screening from the qualifying to the final round.

DESCRIPTION OF SYMBOLS 1 ... Contest server apparatus 2 ... Network 3 ... Base station 4 of mobile telephone ... Communication terminal 4a ... Mobile telephone 4b ... Mobile terminal 4c ... Desktop computer 4d ... Notebook computer 5 ... Database

Claims (2)

In a contest server device configured to allow entry and voting for a contest by accessing via a network from a communication terminal,
The server device includes an application program for receiving an application from a communication terminal, a grouping program for grouping the submitted works for each group, a voting program for deciding whether to win by a tournament method, these application programs, a grouping program, and A CPU for executing a voting program;
The application program accepts user registration and application from the communication terminal,
In the first qualifying tournament, the grouping program constitutes a temporary grouping that divides the applications received within the application period into groups to be voted for a predetermined number (n) and a final group that has been temporarily grouped. The difference (p1) between the number of cases (m1) and the number of group members (n) is calculated, p1 pairs are randomly selected from other than the final group, and one application is selected from the selected group and reorganized. And sending the reorganization content to the applicants of the reorganized group,
In addition, after the second qualifying of the tournament, the grouping program is divided into a predetermined number of groups (n) and temporary grouping so that applications with a large number of winning votes are not biased to one group. Calculate the difference (p2) between the number (m2) of the final group and the number (n) of the group, and use this difference (p2) for the number of votes that were lost in the previous qualifying session. Selected in the order they were selected, incorporated into the final set and reorganized, and the reorganization content sent to the applicants of the reorganized group,
The voting program stocks data for each group generated by the grouping program, transmits data for each group to the communication terminal in response to a request from the communication terminal, and the same period for qualifying belonging to the same level If the number of winning entries that advance to the next screening level is n or less, the next screening level will be the final round, and if the number of screening objects is (n + 1) or more, qualifying A contest server device characterized by continuing examination.   2. The contest server apparatus according to claim 1, wherein in the reorganization of the grouping program for grouping the first preliminary round of the tournament, a dummy application is used as a trace of a missing application in which one application is included in the final group. Contest server device characterized by replenishing.

Images