EP0726165B1 - Ballot sets and method of printing ballots - Google Patents
Ballot sets and method of printing ballots Download PDFInfo
- Publication number
- EP0726165B1 EP0726165B1 EP19950300833 EP95300833A EP0726165B1 EP 0726165 B1 EP0726165 B1 EP 0726165B1 EP 19950300833 EP19950300833 EP 19950300833 EP 95300833 A EP95300833 A EP 95300833A EP 0726165 B1 EP0726165 B1 EP 0726165B1
- Authority
- EP
- European Patent Office
- Prior art keywords
- ballots
- ballot
- candidate
- names
- name
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Expired - Lifetime
Links
Images
Classifications
-
- B—PERFORMING OPERATIONS; TRANSPORTING
- B42—BOOKBINDING; ALBUMS; FILES; SPECIAL PRINTED MATTER
- B42D—BOOKS; BOOK COVERS; LOOSE LEAVES; PRINTED MATTER CHARACTERISED BY IDENTIFICATION OR SECURITY FEATURES; PRINTED MATTER OF SPECIAL FORMAT OR STYLE NOT OTHERWISE PROVIDED FOR; DEVICES FOR USE THEREWITH AND NOT OTHERWISE PROVIDED FOR; MOVABLE-STRIP WRITING OR READING APPARATUS
- B42D15/00—Printed matter of special format or style not otherwise provided for
Definitions
- This invention relates generally to improvements in ballots for use in the electoral process and a method for producing such ballots.
- Ill-advised voters further tend to be influenced not only by the position of a candidate's name relative to the ballot but also relative to the other names on the ballot. For example, if there is one outstanding candidate, voters tend to prefer candidates whose names are adjacent that outstanding candidate. Similarly, if there is a particular candidate which a majority of voters would tend to avoid, ill-informed voters would tend also not to choose a candidate whose name appears adjacent to the one being avoided.
- a method of producing sets of ballots comprising the steps of:
- a sufficient number of groups of said ballots is produced so that, in the ballots of said set taken collectively, each candidate's name appears substantially an equal number of times in each of said discrete locations.
- a sufficient number of groups of said ballots may be produced so that, in the ballots of said set taken collectively, each of said names appears adjacent each other of said names generally an equal number of times.
- the sets of ballots may be produced by programme means, computer means and printer means.
- a group of ballots in which each ballot has a plurality of discrete locations in each of which is received the name of one candidate, a number of said ballots forming a group of ballots, characterised in that the candidate names received in said location in each ballot in said group is different from the candidate name received in said location in each other ballot in said group, and there are a number of said groups of ballots forming a set of ballots, said number being sufficient so that, taken collectively, the name of each candidate appears generally an equal number of times in each of said discrete locations, whereby to reduce the effect of possible voter tendency to check a particular location such as the top of the ballot when a voter marks said ballot.
- each of said names appears adjacent each other of said names on generally an equal number of ballots in said set, whereby to reduce the effect of possible voter tendency to avoid or prefer names adjacent to a given name.
- FIG. 1 there are shown four ballots identified by reference numbers 10, 12, 14 and 16. Each ballot is divided into two adjacent columns, 18 and 20 respectively. The columns are divided into four rows, 22, 24, 26 and 28 respectively.
- the rows 22 through 28 of the columns 18 each contain one of the letters A, B, C, or D marked thereon. Each of these letters denotes the name of a different candidate on the ballot.
- Each row 22, 24, 26 and 28 of column 18 on each ballot 10, 12, 14 and 16, represents a different discrete location on the ballot. Rows 22, 24, 26 and 28 of column 20 are left blank for insertion of a mark by the voter to indicate which candidate they have selected.
- the sequential order of names remains the same.
- the letter C is always adjacent at least one of the letters B or D and is never adjacent the letter A.
- the letter A is always adjacent one of the letters D or B and never adjacent the letter C, and so forth. Accordingly, if the candidate whose name is represented by the letter A would be particularly undesirable to a large number of voters, and if ill-informed voters are disinclined to select a candidate whose name appears adjacent the name of this undesirable candidate, then such ill-informed voters would be more inclined to pick the candidate represented by the letter C over either of the candidates represented by letters D or B respectively. In this manner, the candidate represented by letter C has an unfair advantage over the candidate represented by letters B or D respectively.
- Figure 2 illustrates six ballots, 32, 34, 36, 38, 40 and 42 respectively, each of which has a different sequence of candidates' names represented by letters A, B, C and D, thereon.
- the letter A appears adjacent each of the remaining letters B, C and D two times.
- each of the six sequences shown on ballots 32, 34, 36, 38, 40 and 42 is rotated four times as discussed above concerning the ballots of Figure 1, twenty-four ballots will be produced in which each candidate's name will occupy a given one of the four rows 22, 24, 26, or 28 of column 18 an equal number of times and as well, each candidate's name will be adjacent another candidate's name an equal number of times.
- the set of ballots will contain an equal number of each of these twenty- four different ballots.
- Sets of ballots can be produced by separately printing batches of ballots corresponding to each desired arrangement of names and subsequently collating the ballots into groups. In each group, each ballot representing a different arrangement. With this method, any desired number of groups can be compiled to form a set of ballots containing a desired number of ballots.
- the ballots can be printed sequentially with each subsequent ballot having a different arrangement of names thereon until all of the permutations have been exhausted at which point the cycle would again be repeated.
- One way of accomplishing this latter method is to program the sequence of names into a computer which controls a printer, such as a laser printer. The computer would then drive the laser printer to print out the ballots in sequence.
- a further refinement of the latter method is, as diagrammatically indicated in Figure 3, to enter an appropriate program 50 into a computer 52 which is connected to a printer (e.g. a laser printer) 54.
- the program 50 functions such that when a series of names is entered into a computer, the program arranges the names in all possible combinations, as shown in Figure 2, so that each name appears adjacent each other name an equal number of times.
- the program then causes the names to be rotated so that in addition, each name appears in each location generally an equal number of times.
- the computer then directs the printer 54 to print sets of ballots meeting the above explained criteria.
- the sets of ballots emerge into a paper tray 56 and are repeated until a desired number of ballots has been printed.
Landscapes
- Time Recorders, Dirve Recorders, Access Control (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Description
- This invention relates generally to improvements in ballots for use in the electoral process and a method for producing such ballots.
- Studies have shown that a large percentage of voters who are ill-informed as to the candidates in an election tend to mark the names listed toward the top of the ballot, rather than those listed toward the bottom. This frustrates the democratic process as persons whose names appear at the top of the list are preferentially selected over those whose names appear at the bottom. Since many elections are won or lost by only a few votes, the bias introduced by this effect can be major. Furthermore, candidates names are not infrequently listed alphabetically on ballots. Accordingly, persons whose last names begin with, for example, the letters A or B would have their names appearing toward the top of the ballot and would tend to be preferentially picked by ill-advised voters over persons whose names begin, for example, with the letters T or W.
- Ill-advised voters further tend to be influenced not only by the position of a candidate's name relative to the ballot but also relative to the other names on the ballot. For example, if there is one outstanding candidate, voters tend to prefer candidates whose names are adjacent that outstanding candidate. Similarly, if there is a particular candidate which a majority of voters would tend to avoid, ill-informed voters would tend also not to choose a candidate whose name appears adjacent to the one being avoided.
- The prior art, including US Patent No. 4,807,908 for a ballot for use in an automatic tallying apparatus, fails to address the potential bias described above, since every ballot lists the candidate's names in the same sequence.
- It would be desirable to be able to reduce or eliminate this bias.
- According to a first aspect of the present invention there is provided a method of producing sets of ballots, said method comprising the steps of:
- i) receiving in each one of a plurality of discrete locations on each ballot the name of one candidate, and
- ii) repeating said step (i) so as to produce a
said group of ballots,
the method being characterised by: - iii) the candidate name received in each said location in each ballot of said group being different from the candidate name received in said location in each other ballot of said group, and,
- iv) producing a desired number of said groups, said groups together forming a set of ballots.
-
- Preferably, a sufficient number of groups of said ballots is produced so that, in the ballots of said set taken collectively, each candidate's name appears substantially an equal number of times in each of said discrete locations.
- Additionally or alternatively, a sufficient number of groups of said ballots may be produced so that, in the ballots of said set taken collectively, each of said names appears adjacent each other of said names generally an equal number of times.
- The sets of ballots may be produced by programme means, computer means and printer means.
- According to a second aspect of the present invention there is provided a group of ballots in which each ballot has a plurality of discrete locations in each of which is received the name of one candidate, a number of said ballots forming a group of ballots, characterised in that the candidate names received in said location in each ballot in said group is different from the candidate name received in said location in each other ballot in said group, and there are a number of said groups of ballots forming a set of ballots, said number being sufficient so that, taken collectively, the name of each candidate appears generally an equal number of times in each of said discrete locations, whereby to reduce the effect of possible voter tendency to check a particular location such as the top of the ballot when a voter marks said ballot.
- Preferably each of said names appears adjacent each other of said names on generally an equal number of ballots in said set, whereby to reduce the effect of possible voter tendency to avoid or prefer names adjacent to a given name.
- According to a further aspect of the present invention, there is provided a method of producing sets of ballots, said method comprising the steps of:
- i) printing in each one of a plurality of discrete locations on each ballot the name of one candidate, and
- ii) repeating said step so as to produce a group
of ballots,
the method being characterised by: - iii) printing a first ballot in which the names of the candidates appear in said plurality of discrete locations in a given sequence;
- iv) printing a second ballot in which the names of the candidates appear in said plurality of discrete locations in a different sequence from the first ballot;
- v) repeating step iv) until all the permutations of said different sequences are exhausted thereby to produce a group of ballots;
- vi) repeating steps iii) to v) until a desired number of groups of ballots have been printed, and
- viii) collating said ballots into a set of ballots.
-
- For a better understanding of the present invention, and to show more clearly how it may be carried into effect, reference will now be made, by way of example, to the accompanying drawings, which show preferred embodiments of the present invention and in which:
- Figure 1 illustrates the front of four individual ballots of a bundle of ballots provided according to the first aspect of the present invention;
- Figure 2 illustrates six ballots of a bundle of ballots produced according to the further aspect of the present invention; and,
- Figure 3 is a diagramatical representation of a system for carrying out a method according to the present invention.
-
- Referring to Figure 1, there are shown four ballots identified by
reference numbers - The
rows 22 through 28 of thecolumns 18 each contain one of the letters A, B, C, or D marked thereon. Each of these letters denotes the name of a different candidate on the ballot. Eachrow column 18 on eachballot Rows column 20 are left blank for insertion of a mark by the voter to indicate which candidate they have selected. - Comparing
ballot 10 toballot 12, it can be seen that the last three letters ofballot 10, namely, B, C and D, have been shifted one row upward to the position inballot 12 and the first letter, A, has been shifted from the top row to the bottom row. This pattern of shifting the last three letters upward one row and moving the letter occupying the top row to the bottom row is further repeated in going fromballot 12 toballot 14 and again fromballot 14 toballot 16. In this manner, each of the letters A, B, C and D appears once in each of the discrete locations defined byrows column 18 in this group of four ballots. Each bundle of ballots would contain an equal number of ballots according toballot number - Although only four letters, each of which represents a candidate's name, are illustrated on the ballots of Figure 1, it will be appreciated that this system is readily adaptable to any number of candidates' names.
- Referring still to Figure 1, it can be seen that despite the rotation of names, the sequential order of names remains the same. For example, the letter C is always adjacent at least one of the letters B or D and is never adjacent the letter A. Similarly, the letter A is always adjacent one of the letters D or B and never adjacent the letter C, and so forth. Accordingly, if the candidate whose name is represented by the letter A would be particularly undesirable to a large number of voters, and if ill-informed voters are disinclined to select a candidate whose name appears adjacent the name of this undesirable candidate, then such ill-informed voters would be more inclined to pick the candidate represented by the letter C over either of the candidates represented by letters D or B respectively. In this manner, the candidate represented by letter C has an unfair advantage over the candidate represented by letters B or D respectively.
- Figure 2 illustrates six ballots, 32, 34, 36, 38, 40 and 42 respectively, each of which has a different sequence of candidates' names represented by letters A, B, C and D, thereon. In the six ballots, the letter A appears adjacent each of the remaining letters B, C and D two times.
- If each of the six sequences shown on
ballots rows column 18 an equal number of times and as well, each candidate's name will be adjacent another candidate's name an equal number of times. The set of ballots will contain an equal number of each of these twenty- four different ballots. - Sets of ballots, according to the present invention, can be produced by separately printing batches of ballots corresponding to each desired arrangement of names and subsequently collating the ballots into groups. In each group, each ballot representing a different arrangement. With this method, any desired number of groups can be compiled to form a set of ballots containing a desired number of ballots.
- Alternatively, the ballots can be printed sequentially with each subsequent ballot having a different arrangement of names thereon until all of the permutations have been exhausted at which point the cycle would again be repeated. One way of accomplishing this latter method is to program the sequence of names into a computer which controls a printer, such as a laser printer. The computer would then drive the laser printer to print out the ballots in sequence.
- A further refinement of the latter method is, as diagrammatically indicated in Figure 3, to enter an
appropriate program 50 into acomputer 52 which is connected to a printer (e.g. a laser printer) 54. Theprogram 50 functions such that when a series of names is entered into a computer, the program arranges the names in all possible combinations, as shown in Figure 2, so that each name appears adjacent each other name an equal number of times. The program then causes the names to be rotated so that in addition, each name appears in each location generally an equal number of times. - The computer then directs the
printer 54 to print sets of ballots meeting the above explained criteria. The sets of ballots emerge into apaper tray 56 and are repeated until a desired number of ballots has been printed. - Variations and modifications to the present invention may be apparent to one skilled in the art without departing from the scope of the present claims.
Claims (7)
- A method of producing sets of ballots (10 to 16), said method comprising the steps of:i) receiving in each one of a plurality of discrete locations (22 to 28) on each ballot the name (A to D) of one candidate, andii) repeating said step (i) so as to produce a group of ballots,
the method being characterised by:iii) the candidate name (A to D) received in each said location (22 to 28) in each ballot (10 to 16) of said group being different from the candidate name (A to D) received in said location (22 to 28) in each other ballot (10 to 16) of said group, and,iv) producing a desired number of said groups, said groups together forming a set of ballots. - A method according to claim 1 wherein a sufficient number of groups of said ballots (10 to 16) is produced so that, in the ballots of said set taken collectively, each candidate's name (A to D) appears substantially an equal number of times in each of said discrete locations (22 to 28).
- A method according to claim 1 or claim 2 wherein a sufficient number of groups of said ballots (10 to 16) is produced so that, in the ballots of said set taken collectively, each of said names (A to D) appears adjacent each other of said names (A to D) generally an equal number of times.
- A method according to claim 1 wherein said set of ballots (10 to 16) is produced by programme means (50), computer means (52) and printer means (54).
- A group of ballots (10 to 16) in which each ballot (10 to 16) has a plurality of discrete locations (22 to 28) in each of which is received the name (A to D) of one candidate, a number of said ballots forming a group of ballots, characterised in that the candidate names (A to D) received in said locations (22 to 28) in each ballot (10 to 16) in said group is different from the candidate name (A to D) received in said location (22 to 28) in each other ballot (10 to 16) in said group, and there are a number of said groups of ballots forming a set of ballots, said number being sufficient so that, taken collectively, the name (A to D) of each candidate appears generally an equal number of times in each of said discrete locations (22 to 28), whereby to reduce the effect of possible voter tendency to check a particular location such as the top of the ballot (10 to 16) when a voter marks said ballot.
- A set of ballots according to claim 5 wherein each of said names (A to D) appears adjacent each other of said names (A to D) on generally an equal number of ballots (10 to 16) in said set, whereby to reduce the effect of possible voter tendency to avoid or prefer names adjacent to a given name.
- A method of producing sets of ballots (10 to 16), said method comprising the steps of:i) printing in each one of a plurality of discrete locations (22 to 28) on each ballot (10 to 16) the name (A to D) of one candidate, andii) repeating said step (i) so as to produce a group of ballots (10 to 16),
the method being characterised by:iii) printing a first ballot (10 to 16) in which the names (A to D) of the candidates appear in said plurality of discrete locations in a given sequence;iv) printing a second ballot (10 to 16) in which the names (A to D) of the candidates appear in said plurality of discrete locations in a different sequence from the first ballot;v) repeating step iv) until all the permutations of said different sequences are exhausted thereby to produce a group of ballots (10 to 16);vi) repeating steps iii) to v) until a desired number of groups of ballots (10 to 16) have been printed, andviii) collating said ballots (10 to 16) into a set of ballots.
Priority Applications (2)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
EP19950300833 EP0726165B1 (en) | 1995-02-10 | 1995-02-10 | Ballot sets and method of printing ballots |
DE1995612883 DE69512883T2 (en) | 1995-02-10 | 1995-02-10 | Election papers and their printing processes |
Applications Claiming Priority (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
EP19950300833 EP0726165B1 (en) | 1995-02-10 | 1995-02-10 | Ballot sets and method of printing ballots |
Publications (2)
Publication Number | Publication Date |
---|---|
EP0726165A1 EP0726165A1 (en) | 1996-08-14 |
EP0726165B1 true EP0726165B1 (en) | 1999-10-20 |
Family
ID=8221080
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
EP19950300833 Expired - Lifetime EP0726165B1 (en) | 1995-02-10 | 1995-02-10 | Ballot sets and method of printing ballots |
Country Status (2)
Country | Link |
---|---|
EP (1) | EP0726165B1 (en) |
DE (1) | DE69512883T2 (en) |
Family Cites Families (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US4807908A (en) * | 1987-03-02 | 1989-02-28 | Business Records Corporation | Ballot for use in automatic tallying apparatus |
JPH01210395A (en) * | 1988-02-19 | 1989-08-23 | Marukei:Kk | Ballot paper |
-
1995
- 1995-02-10 EP EP19950300833 patent/EP0726165B1/en not_active Expired - Lifetime
- 1995-02-10 DE DE1995612883 patent/DE69512883T2/en not_active Expired - Fee Related
Also Published As
Publication number | Publication date |
---|---|
DE69512883T2 (en) | 2000-03-09 |
EP0726165A1 (en) | 1996-08-14 |
DE69512883D1 (en) | 1999-11-25 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
US5577727A (en) | Instantaneous bingo tracking method and apparatus | |
DE69406951T2 (en) | GAMBLING | |
US5116049A (en) | Lottery game system and method of playing | |
USRE34673E (en) | Two level scratch game | |
US5590507A (en) | Process and apparatus for processing sheets of notes to form bundles of notes | |
US4807908A (en) | Ballot for use in automatic tallying apparatus | |
GB2182469A (en) | Method of making bingo cards | |
EP0864429B1 (en) | Random printmasks in a multilevel inkjet printer | |
WO2000009227A1 (en) | Device for manufacturing playing counters and drawing sequences in a lottery | |
WO2005076870A2 (en) | Scratch-off ticket or playing card | |
US7216583B2 (en) | Numbering process and numbering box to carry out the process | |
GB1563756A (en) | Pattern matching method and apparatus | |
CA1235820A (en) | Method of making bingo cards | |
CA2182210C (en) | Method for printing books of bingo paper | |
EP0726165B1 (en) | Ballot sets and method of printing ballots | |
EP0160504B2 (en) | Numbered documents and methods of and means for production thereof | |
CA1334985C (en) | Ballot sets and method of printing ballots | |
JPH06278353A (en) | Numbering method and device therefor | |
Perring | Data-processing for the Atlas of the British Flora | |
DE4339792C2 (en) | Procedure for saving the current state of the game | |
JP2000197723A (en) | Printing matter and booklet | |
US7429036B2 (en) | Method and system for efficiently printing and sorting multiple orders of transaction cards | |
US5083787A (en) | Combinational logic system | |
GB2107250A (en) | Printing process and printing press | |
CA1313202C (en) | Combinational logic system |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
PUAI | Public reference made under article 153(3) epc to a published international application that has entered the european phase |
Free format text: ORIGINAL CODE: 0009012 |
|
AK | Designated contracting states |
Kind code of ref document: A1 Designated state(s): DE FR GB |
|
17P | Request for examination filed |
Effective date: 19961126 |
|
17Q | First examination report despatched |
Effective date: 19971107 |
|
GRAG | Despatch of communication of intention to grant |
Free format text: ORIGINAL CODE: EPIDOS AGRA |
|
GRAG | Despatch of communication of intention to grant |
Free format text: ORIGINAL CODE: EPIDOS AGRA |
|
GRAH | Despatch of communication of intention to grant a patent |
Free format text: ORIGINAL CODE: EPIDOS IGRA |
|
GRAH | Despatch of communication of intention to grant a patent |
Free format text: ORIGINAL CODE: EPIDOS IGRA |
|
GRAA | (expected) grant |
Free format text: ORIGINAL CODE: 0009210 |
|
AK | Designated contracting states |
Kind code of ref document: B1 Designated state(s): DE FR GB |
|
REF | Corresponds to: |
Ref document number: 69512883 Country of ref document: DE Date of ref document: 19991125 |
|
ET | Fr: translation filed | ||
PLBE | No opposition filed within time limit |
Free format text: ORIGINAL CODE: 0009261 |
|
STAA | Information on the status of an ep patent application or granted ep patent |
Free format text: STATUS: NO OPPOSITION FILED WITHIN TIME LIMIT |
|
26N | No opposition filed | ||
REG | Reference to a national code |
Ref country code: GB Ref legal event code: IF02 |
|
PGFP | Annual fee paid to national office [announced via postgrant information from national office to epo] |
Ref country code: FR Payment date: 20030219 Year of fee payment: 9 |
|
PGFP | Annual fee paid to national office [announced via postgrant information from national office to epo] |
Ref country code: DE Payment date: 20030224 Year of fee payment: 9 |
|
PGFP | Annual fee paid to national office [announced via postgrant information from national office to epo] |
Ref country code: GB Payment date: 20040204 Year of fee payment: 10 |
|
PG25 | Lapsed in a contracting state [announced via postgrant information from national office to epo] |
Ref country code: DE Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES Effective date: 20040901 |
|
PG25 | Lapsed in a contracting state [announced via postgrant information from national office to epo] |
Ref country code: FR Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES Effective date: 20041029 |
|
REG | Reference to a national code |
Ref country code: FR Ref legal event code: ST |
|
PG25 | Lapsed in a contracting state [announced via postgrant information from national office to epo] |
Ref country code: GB Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES Effective date: 20050210 |
|
GBPC | Gb: european patent ceased through non-payment of renewal fee |
Effective date: 20050206 |