1 / 5

Assignment

Assignment.

cobrien
Download Presentation

Assignment

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. Assignment Question 1. Two networks decide schedules of TV shows to different time slots, respectively. Each TV show has a distinct rating. A network wins a time slot if the show it schedules for that slot has a larger rating than the show the other network schedules for that slot. The goal of each network is to win as many time slot as possible. We say a pair of schedules (S,T), where S and T are the schedules of the two networks, is stable if no network can unilaterally change its own schedule to win more slots. For every set of TV shows and ratings, is there always a stable pair of schedules? 1

  2. Assignment Question 2. A shipping company has n ships and provides service to n ports. Each ship has a schedule which says, for each day of the month (with m > n days), which port it’s currently at, or whether it’s out at sea. Each ship visits each post exactly one day during the month. For safety reasons, we have the following rule:No two ships can be in the same port on the same day!The company wants to perform maintenance on all the ships this month, via the following scheme. They want to truncate each ship's schedule: for each ship S, there will be some day when it arrives in its scheduled port and simply remains there for the rest of the month (for maintenance). 2

  3. Assignment This means that S will not visit the remaining ports on its schedule (if any) that month. So the truncation of S's schedule will simply consist of its original schedule up to a certain specified day on which it is in a port P; the remainder of the truncated schedule simply has it remain in port P. Now the company's question to you is the following: Given the schedule for each ship, find a truncation of each so that the condition (in red color) continues to hold: no two ships are ever in the same port on the same day. Show that such a truncation can always be found, and give an algorithm to find one. 3

  4. Assignment Example: Suppose we have two ships and two ports, and the “month” has four days. Suppose the first ship's schedule is port P1; at sea; port P2; at sea and the second ship's schedule is at sea; port P1; at sea; port P2 Then the (only) way to choose truncations would be to have the first ship remain in port P2 starting on day 3,and have the second ship remain in port P1 starting on day 2. 4

  5. Reading Assignment Y. Chen, J. Lai, D. Parkes, A. Procaccia, Truth, justice, and cake cutting. AAAI 2010, 756–761. X. Bei, N. Chen, X. Hua, B. Tao, E. Yang,Optimal proportional cake cutting with connected pieces, AAAI 2012. 5

More Related