A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf
.
Maximizing Profit with Convex Costs in the Random-order Model
2018
International Colloquium on Automata, Languages and Programming
Suppose a set of requests arrives online: each request gives some value v i if accepted, but requires using some amount of each of d resources. Our cost is a convex function of the vector of total utilization of these d resources. Which requests should be accept to maximize our profit, i.e., the sum of values of the accepted demands, minus the convex cost? We consider this problem in the random-order a.k.a. secretary model, and show an O(d)competitive algorithm for the case where the convex
doi:10.4230/lipics.icalp.2018.71
dblp:conf/icalp/GuptaMM18
fatcat:y4tzqvo6cvap7jjmskmzwjwoza