1 / 34

Honors vs Regular what’s the difference

Honors vs Regular what’s the difference. 1.) Work at a faster pace. 2.) More explanations of WHY on tests and quizzes, instead of just numerical answers. 3.) Honors project. 4.) Grading of quizzes and tests. Example:

reneen
Download Presentation

Honors vs Regular what’s the difference

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Honors vs Regularwhat’s the difference 1.) Work at a faster pace. 2.) More explanations of WHY on tests and quizzes, instead of just numerical answers. 3.) Honors project. 4.) Grading of quizzes and tests. .

  2. Example: Anthony, EJ, and Seth have inherited part of their aunt’s estate: a new computer, a 60 inch TV, a Playstaion 3, and $4500. The group submits the following bids for the items: Anthony computer - $2700, TV - $3000, Playstation - $100; EJ computer - $3200, TV - $3200, Playstation - $200; Seth computer - $2800, TV - $3500, Playstation - $250. a.) Find each person’s fair share. b.) Find each person’s final settlement Fair Share Final Settlement A: $3433.33 $3500 and no items E: $3000 $750.11 and computer S: $3600.33 $200 and tv and playstation Regular 7 out of 10 points 70% Honors 3 out of 6 point 50%

  3. Recurrence Relations A Recurrence Relation is a mathematical sentence that describes that next term by using a previous term. Tn (dependent variable) think of this as your answer n (independent variable) this variable represent which term number you are using. The first, second, third, … number in the sequence.

  4. Sw = 3(S w -1 ) + w 2 This means use the row number in the table. This means use the previous answer in the table This means the answer on each row of the table. The variables that you use in each of the recurrence relations does not matter (just like in Algebra class).

  5. Recurrence Relations 1.) Complete the table for the following recurrence relation. Sw = 3(S w -1 ) + w2 w Sw 1 -6 2 3 4 5

  6. Recurrence Relations 2.) Complete the table for the following recurrence relation. Tn = T n-1 + 2n n Tn 1 10 2 3 4 5

  7. What is your favorite food?

  8. Preference Schedule A Preference Schedule is a way to represent the order in which people like (prefer) certain items. The top of the preference schedule is the item they like the most and the bottom of the preference schedule represents the item they like the least. The number at the bottom is the total number of people who organized their preferences in that same exact order. Most A B C D Least E Total of this chart 10

  9. Ranking Methods Plurality – The item that receives the most First Place votes. (All items receive the same number of total votes) If an item receives over half of the total first place votes, then they are the majority winner. The schedule does not have to have a majority winner. The majority winner must be the plurality winner but the opposite is not true. Borda Count – A method where a point value is assigned to each place an item placed on the preference chart and a total is obtain from all charts. Highest point total wins. If there are n items on the chart, then the first place item receives n points and second receives n-1 points all the way down to last place receiving 1 point. Remember to multiply the points received for the place the item is by the number at the bottom of the chart.

  10. Ranking Methods Runoff Method - The two choices with the most first place voters are kept and all other choices are eliminated. The number of first place votes are now recalculated using only the two remaining choices. Example: 25 people audition for a part in a movie and 5 producers are choosing the person for the part. Two people get a callback and the producers must make their choice from those two. Sequential Runoff – The choice with the fewest first place votes is eliminated from the schedules. The number of first place votes is now recalculated with the remaining choices. This process is repeated until a winner is found. Example: Think American Idol, if only the same people could vote each week until one winner is named.

  11. Algorithm – the step by step process of how to complete a task. Example: How do I get to the cafeteria?

  12. Consider the following set of preferences. A B B C C A D A D D C B B C A D 6 8 4 7 A.) Determine the 4-3-2-1 Borda winner. B.) Determine the plurality winner. C.) Determine the runoff winner. D.) Determine the sequential runoff winner.

  13. 4 points 3 points 2 points 1 point Borda Winner A B B C C A D A D D C B B C A D 6 8 4 7 A = B = C = D =

  14. Plurality A B B C C A D A D D C B B C A D 6 8 4 7 First Place votes: A = B = C = D =

  15. Runoff Method A B B C C A D A D D C B B C A D 6 8 4 7 First Place votes: A = B = C = D =

  16. Sequential Runoff A B B C C A D A D D C B B C A D 6 8 4 7 First Place votes: A = B= C = D =

  17. More Ranking Methods Condorcet – Compare each choice with every other choice. (Whichever choice is ranked higher on the preference schedule receives the number of votes listed at the bottom of the preference schedule.) The choice that receives the most votes is the winner in that comparison. To be the Condorcet winner a choice must win each comparison (go undefeated). Example: Five teams are having a round robin tournament (playing every other team) the Condorcet winner would need to have a record of 4 wins and 0 losses.

  18. Pairwise voting – Choose any two of the choices and compare them (in same way as Condorcet method). Once a choice loses a comparison it is eliminated from the method. The winner is then compared to another choice and again the winner advances and the loser is eliminated. Repeat this pattern until only one choice remains. Example: Think of a bracket type tournament (the Super Bowl), the winner of the Super Bowl advanced to the last game of the year and won and is the champion but did not necessarily beat every team in the tournament.

  19. Condorcet Method Choose any two to compare. A B B C C A D A D D C B B C A D 6 8 4 7

  20. Pairwise Method Choose two and compare them, winner advances and the loser goes home. A B B C C A D A D D C B B C A D 6 8 4 7

  21. D C B D B A A C D D A B B A C C 8 10 7 5 Find the Condorcet winner. Find the Pair-wise winner.

  22. Paradox – is a statement that leads to a contradiction. The outcome does not logically make sense. or In this case where we did the process correctly but were unable to find a winner.

  23. Consider the following set of preferences. C A D B A B C A B C B D D D A C 12 10 13 21 A.) Determine the 4-3-2-1 Borda winner. B.) Determine the runoff winner. C.) Determine the sequential runoff winner. D.) Determine the Condorcet winner. E.) What does the fact that there is a Condorcet winner tell us about the pairwise winner?

  24. Arrow’s Conditions 1.) Nondictatorship – The preference of a single individual should not become the group ranking without considering the preference of the others. 2.) Individual Sovereignty – Each individual should be allowed to order the choices in any way and to indicate ties. 3.) Unanimity – If every individual prefers one choice to another, then the group ranking should do the same. 4.) Freedom from Irrelevant Alternative – The winning choice should still win if one of the other choices is removed. (The choice removed is the irrelevant alternative) 5.) Uniqueness of the Group Ranking – The method of producing the group ranking should give the same result whenever it is applied to a given set of preferences. The group ranking should also be transitive.

  25. Arrow’s Examples 1.) I like Twix more than Kit Kats, Kit Kats more than Snickers, and Snickers more than Twix. 2.) Everyone decided that we would take the test on Friday until little miss teachers pet showed up and said she wanted to take it on Monday, so of course I “caved” and moved the test to Monday. 3.) I tell you to put all four of your classes in order from most to least favorite but you are not allowed to put my class last 4.) The reigning Miss American is “stripped” of her crown and the votes are recounted and the second runner-up is the new Miss America, not the first runner-up. 5.) We use pairwise voting and choice D beats choice A for the overall win because B eliminate choice C earlier, even though C would have beaten D if they had been compared.

  26. Unanimity A C B B D C C A D D B A 4 3 3 Use Pair-wise to find a winner.

  27. Approval Voting All the choices are listed and each person is allowed to vote for as many choices as they want. The person may even vote for all of the choices or none of the choices. After everybody has voted, the total number of votes is tallied and the choice with the most votes wins. If there is a tie, then two choices may win. Example: What your favorite movie?

  28. Weighted Voting Weighted voting – is where some members of a voting body have more votes than others. Example: Corporate share holders (more shares – more votes) Coalitions – a collection of voters, small as one voter all the way up to the group including all the voters The number of votes needed to pass an issue will be set in each problem, if a number is not set use the simple majority. Winning Coalitions – all the coalitions that have enough votes to pass an issue. Power Index – the true measure of power a voter has in the group

  29. Finding the power index 1.) List all winning coalitions and their total votes. 2.) Select any voter and if once the selected voter is removed from the winning coalition that coalition no longer has enough votes to pass the issue that selection receives one point on their index. If the coalition still has enough to pass even after your selection has been removed, then the selection does not receive a point for that coalition. 3.) Continue with the same selection until you have tested it in all the winning coalitions. 4.) Select a different voter and following steps 2 and 3, continue until all voters have been selected.

  30. Consider a situation in which A, B, C, D have 5, 4, 2, and 2 votes, respectively, and in which 6 votes are needed to pass an issue. a.) List all possible coalitions. b.) Mark off the non-winning coalitions. c.) Determine the power index for each voter.

  31. a.) All possible coalitions.

  32. b.) Mark off all non-winning coalitions.

  33. The Power Index. A – B – C – D –

  34. Weighted Voting and Voting Power 1.) Consider a situation in which A, B, C, D have 4, 2, 2, and 1 votes, respectively, and in which 5 votes are needed to pass an issue. a.) List all possible winning coalitions. b.) Determine the power index for each voter. c.) What group or groups is this situation the least fair for? And Why? 2.) Consider a situation in which A, B, and C have 10, 5, and 4 votes respectively, and a simple majority is needed to pass an issue. a.) List all possible winning coalitions. b.) Determine the power index for each voter. c.) What term is used to describe voter A and the what term for voter B and C?

More Related