Secretary Problems with Convex Cost | Julia – A language for technical computing
*** William’s talk: Title: Secretary Problems with Convex Cost We consider online resource allocation problems where given a set of requests our goal is to select a subset that maximizes a value minus cost type of objective function. Requests are presented online in random order, and each request possesses an …