Social Choice Functions I
Social Choice Functions II
Apportionment I
Apportionment II
Game Theory
100
This type of candidate gets a maximum of first-place votes in an election.
What is a plurality candidate?
100
In any election with more than two candidates, this method may not be the best method anymore!
What is the Plurality method?
100
This 'standard' measure is found by dividing a state's population by the total population, and then multiplying by the number of seats h.
What is the standard quota?
100
Jefferson's method, Hill's method, Dean's method, and Webster's method are all examples of this type of method
What is a divisor method?
100
A mathematical construction consisting of an array or grid of numbers.
What is a matrix?
200
This is the condition we place upon social choice functions which guarantees that there is at least one winner in any election.
What is the condition of universal domain?
200
This method searches for a majority candidate, and in the absence of one, eliminates the candidate(s) with the fewest first-place votes.
What is the Hare method?
200
Any method which assigns to each state either its upper quota or lower quota.
What is a quota method?
200
This method is the one currently in use to determine the number of representatives apportioned to each state in the U.S.
What is the Hill method?
200
This strategy can also be thought of as the 'hope for the best' strategy.
What is the naive strategy?
300
With this method, any candidate with an even number of votes is a winner!
What is the parity method?
300
Any social choice function which satisfies this criterion will never penalize a candidate who receives additional first-place votes in a re-vote.
What is monotonicity?
300
This is the number which is obtained by adding two numbers and dividing by two.
What is the arithmetic mean?
300
This type of point in a matrix represents some best-case cooperation or compromise between two players.
What is a saddle point?
400
A social choice function satisfies this criterion if it always selects a unique winner.
What is decisiveness?
400
This criterion is satisfied by any social choice function which depends only upon tabulated profiles.
What is anonymity?
400
This criterion guarantees that no state is penalized if, all other things remaining equal, the size of the house h increases.
What is house monotonicity?
400
This is the number which is obtained by multiplying two numbers and then taking the square root.
What is the geometric mean?
400
This particular outcome was agreed upon by all but one of us to be the worst possible outcome when playing 'the arms race'.
What is mutual annihilation?
500
This theorem guarantees that, in a two-candidate election, any voting method that is anonymous, neutral, monotone, and nearly decisive must be the simple majority method.
What is May's Theorem?
500
This criterion must be violated by any social choice function which satisfies anonymity and neutrality.
What is decisiveness?
500
This criterion guarantees that no state is penalized if, all other things remaining equal, its population increases.
What is population monotonicity?
500
The Theorem of Balinski and Young states that it is impossible for any method satisfying this criterion to satisfy both the quota rule and population monotonicity.
What is neutrality?
500
In this game, both players have dominant strategies, but would benefit more if they simultaneously rejected those dominant strategies.
What is the prisoner's dilemma?
M
e
n
u