The first event transcends the start of the third event, right?

By "transcend" do you mean 'overlaps'? And why is that a question. Are you unsure?

I hope its clearer now. If not, let the problem statement rest and comment on the algorithm that I coded.

Sorry, but quite how you've selected a convex hull algorithm applied to a 2D reduction of 3D coordinate system as an appropriate approach to solving what seems to be a very simple scheduling problem, is quite beyond me.

Reducing start & end times to a time period throws away all the inter-dependancy information between events, renders any results produced devoid of any time-based restrictions. And conflating a time period with money as a 2D coordinate is the proverbial mixing of apples and oranges. (Simpler to divide money by time to get a single number and sort.)

Quite frankly, I don't see any application for convex hulls to the problem description; so I'll back-the-f-off and leave you to it.