In this paper we introduce the concept of online tradeoff scheduling to minimize two objective functions f1 and f2 simultaneously. An online algorithm A is called (ρ1,ρ2)-competitive for minimizing f1 and f2 if A is ρ1-competitive for minimizing f1 and ρ2-competitive for minimizing f2. A...

Given a seller with <InlineEquation ID="IEq1"> <EquationSource Format="TEX">$$k$$</EquationSource> </InlineEquation> types of items, <InlineEquation ID="IEq2"> <EquationSource Format="TEX">$$m$$</EquationSource> </InlineEquation> of each, a sequence of users <InlineEquation ID="IEq3"> <EquationSource Format="TEX">$$\{u_1, u_2,\ldots \}$$</EquationSource> </InlineEquation> arrive one by one. Each user is single-minded, i.e., each user is interested only in a particular bundle of items. The seller must set the price and assign some amount of bundles to each...</equationsource></inlineequation></equationsource></inlineequation></equationsource></inlineequation>