Greedy Algorithm Basic idea Match all triples when it is possible Match Utility Score (t2p1,w1) (t1,p1,W2) (t2,p1,Ww2) 19122 80000 p1 and t1 are occupied⚫ Basic idea ⚫ Match all triples when it is possible. Greedy Algorithm Match Utility Score (𝑡1 ,𝑝1 , 𝑤1 ) 18 (𝑡2 ,𝑝1 , 𝑤1 ) 90 (𝑡1 ,𝑝1 , 𝑤2 ) 10 (𝑡2 ,𝑝1 , 𝑤2 ) 20 (𝑡2 ,𝑝2 ,𝑤2 ) 20 𝑡1 𝑡2 𝑝1 𝑤1 𝑝2 𝑤2 38 p1 and t1 are occupied