Offline v.s. Online 5 1 1 2 1. Full bipartite graph cannot u be known 2. The new arrival object needs to be immediately assigned based on partial information 2 The offline optimal cost is 20 Offline scenario Online ScenarioOffline Scenario 3 1. Full bipartite graph cannot be known. 2. The new arrival object needs to be immediately assigned based on partial information. 3 5 7 9 2 1 11 6 7 Offline v.s. Online The offline optimal cost is 20 Online Scenario 14