Consider the following computer game: you have found some items of distinct values. On turn you take one of these items while the values of the remaining items are multiplied by a f D where D>1. On the next turn, you take one of the remaining items and also the other item multiplied by D, this continues until no items are remaining. Find an optimal greedy strategy gets the maximum score you can get. Write a pseudecode for a greedy strategy that get: maximum score. What is the complexity of your algorithm?? What is the output of your algor if the input values are {your birth day, your birth month, last two digits of your birth year}, a = 2. For example if the values are {2, 5, 3}, D=2 and you choose to get them in the given order score will be like this: • After the first iteration your score is 2 and the remaining values are {10, 6}. • After the second iteration your score is 12 and the remaining values are {12} After the last iteration your score is 24 and there are no remaining values.

Consider the following computer game: you have found some items of distinct values. On turn you take one of these items while the values of the remaining items are multiplied by a f D where D>1. On the next turn, you take one of the remaining items and also the other item multiplied by D, this continues until no items are remaining. Find an optimal greedy strategy gets the maximum score you can get. Write a pseudecode for a greedy strategy that get: maximum score. What is the complexity of your algorithm?? What is the output of your algor if the input values are {your birth day, your birth month, last two digits of your birth year}, a = 2. For example if the values are {2, 5, 3}, D=2 and you choose to get them in the given order score will be like this: • After the first iteration your score is 2 and the remaining values are {10, 6}. • After the second iteration your score is 12 and the remaining values are {12} After the last iteration your score is 24 and there are no remaining values.

Operations Research : Applications and Algorithms

4th Edition

ISBN:9780534380588

Author:Wayne L. Winston

Publisher:Wayne L. Winston

Chapter14: Game Theory

Section14.3: Linear Programming And Zero-sum Games

Problem 5P

See similar textbooks

Similar questions

The classic example of following a greedy algorithm is making change. Let’s say you buy some items at the store and the change from your purchase is 63 cents. How does the clerk determine the change to give you? If the clerkfollows a greedy algorithm, he or she gives you two quarters, a dime, and three pennies. That is the smallest number of coins that will equal 63 cents (given that we don’t allow fifty-cent pieces). It has been proven that an optimal solution for coin changing can always be found using the current American denominations of coins. However, if we introduce some other denomination to the mix, the greedy algorithm doesn’t produce an optimal solution.Write a program that uses a greedy algorithm to make change (this code assumes change of less than one dollar).
For the problem below, two ”high level” greedy strategy is given. One of the strategies givesa correct solutions, and the other sometimes gives an incorrect solutions. Decide which greedy strategyproduces optimal solutions, and give a proof that it is correct and a counter-example showing the otherstrategy is incorrect.( show proof and counter example) You are given a list of classes C and a list of classrooms R. Each class c has a positive enrollment E(c)and each room r has a positive integer size S(r) which denotes its capacity. You want to assign eachclass a room in a way that minimizes the total sizes of rooms used. However, the capacity of the roomassigned to a class must be at least the enrollment of the class. You cannot assign two classes to thesame room. Greedy strategy A: Repeat until all classes are assigned, or a class cannot be included in any unassignedroom. Assign the largest unassigned class to the smallest unassigned room larger than or equal to itsenrollment. Greedy…
Let pn(x) be the probability of selling the house to the highest bidder when there are n people, and you adopt the Look-Then-Leap algorithm by rejecting the first x people. For all positive integers x and n with x < n, the probability is equal to p(n(x))= x/n (1/x + 1/(x+1) + 1/(x+2) + … + 1/(n-1)) If n = 100, use the formula above to determine the integer x that maximizes the probability n = 100 that p100(x). For this optimal value of x, calculate the probability p100(x). Briefly discuss the significance of this result, explaining why the Optimal Stopping algorithm produces a result whose probability is far more than 1/n = 1/100 = 1%.
Consider the problem of providing change for an amount of n-bahts while using the smallest possible quantity of coins. You may assume that each coin’s value is integer. Assume that the coins available for use have values that can be expressed as powers of c. To clarify, the denominations of the coins can be written as c0,c1,..., ck , where c is an integer greater than 1, and k is a positive integer. Prove that the greedy algorithm always yields an optimal solution.
A student has been asked to put some parcels on a shelf. The parcels all weigh different amounts, and the shelf has a maximum safe loading weight capacity of 150 Kg. The weight of parcels are as follows (in Kg): The student has been asked to load the maximum weight possible parcels on the shelf subject to the maximum safe loading weight. State two possible approaches for a greedy algorithm solution to solve this problem. In each case, state clearly the result you would get from applying that approach to this problem, stating whether the solution is optimal or not. If your answer does not produce an optimal solution, what algorithm could be employed to find one?
What is the solution by greedy algorithm to the change-making problem with denominations 1, 3, and 4 to return the minimum number of coins for an amount of 6? Copy and paste the following expression and replace the ? mark by a number ?(4), ?(3), ?(1) (Keep the same format) Is the solution provided by greedy algorithm to the change-making problem with denominations 1, 3, and 4 to return the minimum number of coins for an amount of 6 optimal or not? prove your answer
You are given X number of projects with their start and end times. Devise a greedy algorithm that determines the max number of projects that can be performed by one person with the following assumptions: - A person can only work on a single project at a time. - Start and finish times are integers.
Assume you are given four objects, and you should fit as many of them into a knapsack of size 15 as possible. The resulting value of the objects should be as large as possible. 1. Please select your objects using the Greedy principle according to some greedy criterion you may choose yourself (please make clear which criterion you’ve used). Is this solution optimal? 2. Please explain and apply the principle of dynamic programming using the example above.
Find the minimum number of platforms in a train station to avoid delays in the arrival of a train. In other words, given a list of train arrival and departure times, determine in principle what would be the number of operating platforms to avoid delays in the arrival of a train. What would be the greedy strategy if we used a greedy algorithm to solve the problem? To exemplify, use the following information:Arrival = {2.00,2.10,3.00,3.20,3.50,5.00}Output = {2.30,3.40,3.20,4.30,4.00,5.20}
A. One greedy strategy to solve the knapsack problem is to consider the items in order of decreasing values of where Vi and Si are the value and the size of item i. For each item, add it to the knapsack if it fits otherwise ignore it and move to the next item in the ordered list. Write a complete pseudocode for this strategy. The pseudocode should print the details of the solution (selected items, their total value and size). B. Show that this strategy does not necessarily yield optimal solutions. Take the example of exercise 1 and change the knapsack capacity to 15 (The value of the optimal solution is 54)..
You have a ticket automat which gives exchange in coins with values 1, 2, 5, 10 and 20. The dispension of theexchange can be seen as a series of coin drops until the right value is dispensed. We say a dispension is optimalwhen its coin count is minimal for its value.Let M in [1,50] be the price for the ticket T and P in [1,50] the money somebody paid for T, with P >= M. Let D=P-M.We define the benefit of a step as the difference between D and D-c with c the coin the automat dispense in thisstep.The Greedy Technique for the exchange is the following pseudo algorithmic approach:
Using the following coin denominations as an example: 1, 5, 20 and 23, explain why the greedy solution for the change-making problem does not result in an optimal solution