%0 Book Section %B Approximation, Randomization and Combinatorial Optimization. Algorithms and TechniquesApproximation, Randomization and Combinatorial Optimization. Algorithms and Techniques %D 2008 %T Budgeted Allocations in the Full-Information Setting %A Srinivasan, Aravind %E Goel,Ashish %E Jansen,Klaus %E Rolim,José %E Rubinfeld,Ronitt %X We build on the work of Andelman & Mansour and Azar, Birnbaum, Karlin, Mathieu & Thach Nguyen to show that the full-information (i.e., offline) budgeted-allocation problem can be approximated to within 4/3: we conduct a rounding of the natural LP relaxation, for which our algorithm matches the known lower-bound on the integrality gap. %B Approximation, Randomization and Combinatorial Optimization. Algorithms and TechniquesApproximation, Randomization and Combinatorial Optimization. Algorithms and Techniques %S Lecture Notes in Computer Science %I Springer Berlin / Heidelberg %V 5171 %P 247 - 253 %8 2008/// %@ 978-3-540-85362-6 %G eng %U http://dx.doi.org/10.1007/978-3-540-85363-3_20