In class, we looked at the goal of attending as many parties as possible, when you...
Fantastic news! We've Found the answer you've been seeking!
Question:
Transcribed Image Text:
In class, we looked at the goal of attending as many parties as possible, when you couldn't be at two parties at the same time. There, we assumed that you had to stay for the entire time. An opposite type of problem is one where you just quickly want to "show your face" at each party, but don't intend to stay around at all. But in return, you now want to attend all of the parties, to win the "party animal" badge. Let's assume that you live far enough off campus that getting to USC is really the bottleneck. Once you're on campus, the locations of all parties on campus are close enough to each other that you can - for our purposes - drop in on a party in 0 time, and in 0 time go to any other party that may be happening, too. We'll model this as follows. There are n parties, with party i starting at time s; and finishing at time fi. Our model is that one "party trip" at time t means that you drive to campus, get there at time t, visit all parties that are ongoing at that time, and then immediately drive back home. So you never stay around on campus. You would like to find a smallest (minimum-cardinality) set of times at which to visit campus, so that you quickly drop in on every one of the parties. Give (and of course analyze, meaning prove correct and analyze the running time) an algorithm that runs in time O(n log n) and finds a smallest set of times to visit campus so that you can visit all parties. (2) [10 points] Solving this problem will likely be easier after Friday's Review Session, and even more so after Monday's lecture. Or you could read ahead in the textbook on the analysis of the Earliest Deadline First algorithm. In this problem, we will look at how to manipulate the outcome of an election. In many elections, voters can only vote for one candidate if so, there is really only one reasonable voting rule, which is to choose the candidate with the largest total. But as you probably know, this leads to a lot of speculating to avoid wasting one's vote on a candidate who won't win anyway. For that reason, some elections ask voters to rank all candidates from most favorite to least favorite; with this extra information, one can then do a better job picking a "good" candidate. There are a lot of different voting rules for choosing a candidate you may have heard about Single Transferable Vote (STV), also known as Ranked Choice voting. Another well-known method, and the one we will consider here, is the Borda Count, named after Jean-Charles de Borda, who invented it in the late 18th century. Assume that there are m 2 candidates and n voters. Each voter ranks all m candidates from most to least favorite. For voter v = 1,..., n, their order is a permutation Tv, and we write (i) for the candidate that voter v has in position i. Voter v's most favorite candidate is (1), and their least favorite is (m). Under the Borda count rule, candidate c gets m - 1 points for each first-place vote they get, m - 2 for each second-place vote they get, and so on; with 0 points for each last-place vote they get. The points are added up, and the candidate with the largest total number of points wins. As an example, suppose that there are three voters and four candidates, and the rankings of the voters are (A, B, C, D), (B, C, A, D), (C, D, A, B). Because m = 4, candidate A gets 3 + 1 + 1 = 5 points, B gets 2+3+0 = 5 points, C gets 1+2+3 = 6 points, and D gets 0+0+2 = 2 points. Here, C would win. Now assume that you are voter n, and your favorite candidate would be A. You would like A to win. You can see all the ballots of all other voters. The question is: is there some ranking you can put on your ballot such that A is the unique winner, i.e., A gets strictly more points than every other candidate (no ties)? Clearly, sometimes this will be impossible, and other times, it is possible. For instance, in the example above, if you were the fourth voter, you could write (A, B, D, C) on the ballot, and now, A would have 8 points, would have 7 points, C would have 6 points, and D would have Let's not worry about tie breaking for now. 3 points, so A would win. On the other hand, if everyone else had ranked A last and B first, there would have been nothing you could do. Give a polynomial-time algorithm to compute a ballot you can submit to make A win, or correctly conclude that no such ballot exists. Prove the correctness of your algorithm, and analyze its running time. In class, we looked at the goal of attending as many parties as possible, when you couldn't be at two parties at the same time. There, we assumed that you had to stay for the entire time. An opposite type of problem is one where you just quickly want to "show your face" at each party, but don't intend to stay around at all. But in return, you now want to attend all of the parties, to win the "party animal" badge. Let's assume that you live far enough off campus that getting to USC is really the bottleneck. Once you're on campus, the locations of all parties on campus are close enough to each other that you can - for our purposes - drop in on a party in 0 time, and in 0 time go to any other party that may be happening, too. We'll model this as follows. There are n parties, with party i starting at time s; and finishing at time fi. Our model is that one "party trip" at time t means that you drive to campus, get there at time t, visit all parties that are ongoing at that time, and then immediately drive back home. So you never stay around on campus. You would like to find a smallest (minimum-cardinality) set of times at which to visit campus, so that you quickly drop in on every one of the parties. Give (and of course analyze, meaning prove correct and analyze the running time) an algorithm that runs in time O(n log n) and finds a smallest set of times to visit campus so that you can visit all parties. (2) [10 points] Solving this problem will likely be easier after Friday's Review Session, and even more so after Monday's lecture. Or you could read ahead in the textbook on the analysis of the Earliest Deadline First algorithm. In this problem, we will look at how to manipulate the outcome of an election. In many elections, voters can only vote for one candidate if so, there is really only one reasonable voting rule, which is to choose the candidate with the largest total. But as you probably know, this leads to a lot of speculating to avoid wasting one's vote on a candidate who won't win anyway. For that reason, some elections ask voters to rank all candidates from most favorite to least favorite; with this extra information, one can then do a better job picking a "good" candidate. There are a lot of different voting rules for choosing a candidate you may have heard about Single Transferable Vote (STV), also known as Ranked Choice voting. Another well-known method, and the one we will consider here, is the Borda Count, named after Jean-Charles de Borda, who invented it in the late 18th century. Assume that there are m 2 candidates and n voters. Each voter ranks all m candidates from most to least favorite. For voter v = 1,..., n, their order is a permutation Tv, and we write (i) for the candidate that voter v has in position i. Voter v's most favorite candidate is (1), and their least favorite is (m). Under the Borda count rule, candidate c gets m - 1 points for each first-place vote they get, m - 2 for each second-place vote they get, and so on; with 0 points for each last-place vote they get. The points are added up, and the candidate with the largest total number of points wins. As an example, suppose that there are three voters and four candidates, and the rankings of the voters are (A, B, C, D), (B, C, A, D), (C, D, A, B). Because m = 4, candidate A gets 3 + 1 + 1 = 5 points, B gets 2+3+0 = 5 points, C gets 1+2+3 = 6 points, and D gets 0+0+2 = 2 points. Here, C would win. Now assume that you are voter n, and your favorite candidate would be A. You would like A to win. You can see all the ballots of all other voters. The question is: is there some ranking you can put on your ballot such that A is the unique winner, i.e., A gets strictly more points than every other candidate (no ties)? Clearly, sometimes this will be impossible, and other times, it is possible. For instance, in the example above, if you were the fourth voter, you could write (A, B, D, C) on the ballot, and now, A would have 8 points, would have 7 points, C would have 6 points, and D would have Let's not worry about tie breaking for now. 3 points, so A would win. On the other hand, if everyone else had ranked A last and B first, there would have been nothing you could do. Give a polynomial-time algorithm to compute a ballot you can submit to make A win, or correctly conclude that no such ballot exists. Prove the correctness of your algorithm, and analyze its running time.
Expert Answer:
Related Book For
Data Analysis and Decision Making
ISBN: 978-0538476126
4th edition
Authors: Christian Albright, Wayne Winston, Christopher Zappe
Posted Date:
Students also viewed these algorithms questions
-
Planning is one of the most important management functions in any business. A front office managers first step in planning should involve determine the departments goals. Planning also includes...
-
From the attached article: 1) Introduction - Describe the case. What happened? When did that happen? Who got involved? 2) Identify the link between the case and global market changes?...
-
The symmetrical three-phase load is A-connected, with Z-(4+ j3) 22 and the phase voltage 220 V, find IL, IP, UL and P of the three loads. 7.(10 score) The symmetrical three-phase load is Y-connected....
-
Describe three influence tactics Raj Gupta used to close the deal with Andrew Liveris and Dow Chemical.
-
Daniel Morris purchased a 42-inch plasma television, manufactured by TVCO, from a local electronics store that permits customers to return defective products within 30 days of purchase. Approximately...
-
Prim launched in mid-2013, after passing through the prestigious Y Combinator business accelerator program earlier that year. Heres how Prims laundry service worked. Customers bagged their laundry...
-
The Ewert Exploration Company is considering two mutually exclusive plans for extracting oil on property for which it has mineral rights. Both plans call for the expenditure of $10 million to drill...
-
In a jurisdiction where assisted suicide is illegal, a terminally ill patient with no chance of recovery seeks assistance in ending their life. What legal and ethical considerations come into play,...
-
Your company makes BBQ's from scratch - that is to say, you currently make all of the components for the BBQ's from their raw materials (sheet metal, paint, nuts & bolts, etc.) Component "A", of...
-
Answer each question with the length of a paragraph. Use external sources for each question. 1) Define blockchain technology using the textbook, and describe how it could be utilized in your industry...
-
Required. Give a detailed explanation of what this chart, directly above, is illustrating in correlation to the given data set for home renovation savings (client: 'John Doe'). Include key values...
-
A 110-kg tackler moving at a speed of 2.7 m/s meets head-on (and holds on to) an 86-kg halfback moving at a speed of 5.0 m/s. -0 < < Previous n. appropriate units. v' Submit HA LTML. 0.68 m/s...
-
1. What are some major problems with implementing the ideas of a human service model of employee supervision in criminal justice organizations? How would employees react to such a supervision model?...
-
Dressing the ethical problem issues faced by Nikeand solution focusing on decision-making concept. Information Nike concentrated on product design and product marketing but did not actually produce...
-
The owner of a service station wants to determine if owners of new cars (two years old or less) change their cars oil more frequently than owners of older cars (more than two years old). From his...
-
Prove the following D,(cos x) = - sin x (Hint: Apply the identity cos(A + B) = cos A cos B sin A sin B)
-
Continuing the previous problem in a slightly different direction, continue to use the Money_allocated cell as a changing cell, but add a constraint that it must be less than or equal to any value,...
-
Suppose that you have sued your employer for damages suffered when you recently slipped and fell on an icy surface that should have been treated by your companys physical plant department....
-
Nicklaus Electronics manufactures electronic components used in the computer and space industries. The annual rate of return on the market portfolio and the annual rate of return on Nicklaus...
-
An investor is considering adding three new securities to her internationally focused, fixed-income portfolio. She considers the following non-callable securities: 1-year government bond 10-year...
-
An Australian investor currently holds an A$240 million equity portfolio. He is considering rebalancing the portfolio based on an assessment of the risk and return prospects facing the Australian...
-
An analyst is reviewing various asset alternatives and is presented with the following information relating to the broad equity market of Switzerland and various industries within the Swiss market...
Study smarter with the SolutionInn App