Recall Pigou's example discussed in class, where there are two roads that connect a source, s, and destination, t. The roads have different travel costs. Fraction ₁ of the traffic flow on route 1, and the remainder x₂ on route 2. Here consider the following scenario. • The first road has "infinite" capacity but is slow and requires 1 hour travel time, T₁ = 1. • The second road always requires at least 15 mins, which then increases as a function of traffic density, T₂ = 0.25 +0.752. If drivers act in a "selfish" manner - the user optimal scenario - all the traffic will flow on the second path, as one is never worse off. Worst case scenario for path 2, both paths take one hour. So no one is incentivized to change their behavior. 1. Assume user optimal behavior, and calculate 7 the expected travel time per car. 2. If instead we could control the flows, we could minimize the expected travel time. Using the expression in part (a), calculate the optimal allocation of flows ₁ and ₂ that minimize the expected travel time per car. 3. What is Tm, the expected travel time when the flow is optimized?

Recall Pigou's example discussed in class, where there are two roads that connect a source, s, and destination, t. The roads have different travel costs. Fraction ₁ of the traffic flow on route 1, and the remainder x₂ on route 2. Here consider the following scenario. • The first road has "infinite" capacity but is slow and requires 1 hour travel time, T₁ = 1. • The second road always requires at least 15 mins, which then increases as a function of traffic density, T₂ = 0.25 +0.752. If drivers act in a "selfish" manner - the user optimal scenario - all the traffic will flow on the second path, as one is never worse off. Worst case scenario for path 2, both paths take one hour. So no one is incentivized to change their behavior. 1. Assume user optimal behavior, and calculate 7 the expected travel time per car. 2. If instead we could control the flows, we could minimize the expected travel time. Using the expression in part (a), calculate the optimal allocation of flows ₁ and ₂ that minimize the expected travel time per car. 3. What is Tm, the expected travel time when the flow is optimized?

Operations Research : Applications and Algorithms

4th Edition

ISBN:9780534380588

Author:Wayne L. Winston

Publisher:Wayne L. Winston

Chapter14: Game Theory

Section14.4: Two-person Nonconstant-sum Games

Problem 3P

See similar textbooks

Similar questions

Major Luna is sending military troops from his base (A) to the town of G. However, there is no direct route between A and G. Instead, the troops must pass through other places, namely: B, C, D, E, and F. The following routes are possible: A to B, A to C, B to F, C to D, C to E, D to G, E to G, and F to G. For some reason, such places can only accommodate a number of soldiers going through these places. B, C, D, E, and F has a capacity of 3, 3, 9, 6, and 4 soldiers. b. Solve the problem using the Ford-Fulkerson algorithm.
A friend needs to drive from City X to City I and would like to find the shortest route between the two. The road network with the distance in kilometers between the cities is shown in the diagram below. Formulate a model that would determine which cities she should travel through to minimize distance.
The motorway management perceives that the waiting time computed in (a) above is not acceptable and it wishes to reduce it, first, by adding an extra tollbooth assistant to help improve the service rate to 250 motorists every 8-hour-day. The tollbooth attendant will be paid a monthly salary of GH¢400. The second option is that management can add a toll-operated machine which will cost GH¢3,000 and this amount is a free gift from the Minister. This option will reduce the arrival rate to 35 motorists every 2 hours. However, management will have to pay the operator who will man the toll-operated machine a monthly salary of GH¢550. Whichever option management adopts; they avoid lost sales of GH¢1,200.00 per month for every minute that average waiting time is reduced. Advise management which option it must adopt?
A group of n tourists must cross a wide and deep river with no bridge in sight. They notice two 13-year-old boys playing in a rowboat by the shore. The boat is so tiny, however, that it can only hold two boys or one tourist. How can the tourists get across the river and leave the boys in joint possession of the boat? How many times need the boat pass from shore to shore?
How exactly would I be able to paraphrase this pseudo-code so that it can make a bit more sense? 1.Initialtzation: generate a random solution X ← RandomSolution() 2. Solve the traffic assignment problem at equilibrium for each link: (flow, cost) ← NonLinearComplementary(X) 3. Evaluate the objective value for the current solution: f (X) ← EvaluateObj Val (f low, cost) 4. T ← Tmax 5 while (T > Tmin) do 6 I ← 1 7 while (t < ltermax)do 8 X' ← FindNeighborSolution(X) 9 (flow,cost) ← NonLinearComplementary(X') 10 f(X') ← EvaluateObf Val (f low, Cost) 11 Δ ←(f(x) - f(x')) 12 if(Δ<0)then 13 BoltzmannValue ← exp(-Δ/T) 14 if (BoltzmannValue < Random (0,1)) then 15 Accept the new solution: X ← X' 16 end If 17 Else I8 Accept the new solution: X ← X' 19 end if 20 i ← i+1 21 end while 22 T ←T ∞ 23 end while ________
The Manhattan Tourist Problem (1) Given setting in Figure 6.4, calculate exact number of different paths by dynamic programming. (2) For a general setting, i.e., from source(0,0) to sink (n, m), how many different paths by dynamic programming?1 4 3 3 4 1 0 4 3 N 5 1
Rohan is a huge soccer fan so he wants to catch a game of the UEFA Champions League (UCL) while he is in Europe. Assume UCL has k participating teams, where k is a positive even integer. Suppose that the organizer of the league decides that there will be a total of k2 matches this season, where no pair of teams plays more than once against each other (ie. if Paris and Barcelona play a match against each other, they never play against each another again for the rest of the season). Prove that if every team has to play at least one match this season, then there is no team that plays two or more games.
A ski rental agency has n pairs of skis, where the height of the the ith pair of skis is si . There are n skiers who wish to rent skis, where the height of the ith skier is hi. Ideally, each skier should obtain a pair of skis whose height matches her/his own height as closely as possible. We would like to assign skis to skiers so that the sum of the absolute differences of the heights of each skier and her/his skis is minimized. Design a greedy algorithm for the problem. Prove the correctness of your algorithm. (Hint: Start with two skis and two skiers. How would you match them? Continue to three skis and three skiers, and identify a strategy.)
As we all know, heuristic or approximation algorithms may not always provide the best solution to a problem, but they are very efficient in terms of polynomial time. (a) Propose an approximation method for the travelling salesman problem (TSP) and analyze the time complexity and limitations of the proposed approach. (2) Provide two examples of inputs for which the method in (a) produces the best and not-the best answers, respectively. (3) There should be between six and eight nodes in each network.
Numerous engineering and scientific applications require finding solutions to a set of equations. Ex: 8x + 7y = 38 and 3x - 5y = -1 have a solution x = 3, y = 2. Given integer coefficients of two linear equations with variables x and y, use brute force to find an integer solution for x and y in the range -10 to 10. Ex: If the input is: 8 7 38 3 -5 -1 Then the output is: x = 3 , y = 2 Use this brute force approach: For every value of x from -10 to 10 For every value of y from -10 to 10 Check if the current x and y satisfy both equations. If so, output the solution, and finish. Ex: If no solution is found, output: There is no solution Assume the two input equations have no more than one solution. Note: Elegant mathematical techniques exist to solve such linear equations. However, for other kinds of equations or situations, brute force can be handy.
Numerous engineering and scientific applications require finding solutions to a set of equations. Ex: 8x + 7y = 38 and 3x - 5y = -1 have a solution x = 3, y = 2. Given integer coefficients of two linear equations with variables x and y, use brute force to find an integer solution for x and y in the range -10 to 10. Ex: If the input is: 8 7 38 3 -5 -1 Then the output is: x = 3 , y = 2 Use this brute force approach: For every value of x from -10 to 10 For every value of y from -10 to 10 Check if the current x and y satisfy both equations. If so, output the solution, and finish. Ex: If no solution is found, output: There is no solution You can assume the two equations have no more than one solution. Note: Elegant mathematical techniques exist to solve such linear equations. However, for other kinds of equations or situations, brute force can be handy. ''' Read in first equation, ax + by = c '''a = int(input())b = int(input())c = int(input()) ''' Read in second equation, dx + ey = f '''d…
Numerous engineering and scientific applications require finding solutions to a set of equations. Ex: 8x + 7y = 38 and 3x - 5y = -1 have a solution x = 3, y = 2. Given integer coefficients of two linear equations with variables x and y, use brute force to find an integer solution for x and y in the range -10 to 10. Ex: If the input is: 8 7 38 3 -5 -1 Then the output is: x = 3 , y = 2 Use this brute force approach: For every value of x from -10 to 10 For every value of y from -10 to 10 Check if the current x and y satisfy both equations. If so, output the solution, and finish. Ex: If no solution is found, output: There is no solution You can assume the two equations have no more than one solution. Note: Elegant mathematical techniques exist to solve such linear equations. However, for other kinds of equations or situations, brute force can be handy. What is the code in python?