The Online Stochastic Generalized Assignment Problem
Authors:
- 1 January 2013
- book chapter
- Published by Springer Nature
- p. 11-25
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- Online prophet-inequality matching with applications to ad allocation2012
- Bayesian Combinatorial Auctions: Expanding Single Buyer Mechanisms to Many Buyers2011
- Near optimal online algorithms and fast approximation algorithms for resource allocation problems2011
- Improved Approximation Results for Stochastic Knapsack Problems2011
- AdCell: Ad Allocation in Cellular NetworksLecture Notes in Computer Science, 2011
- Online Ad Assignment with Free Disposal2009
- A combinatorial allocation mechanism with penalties for banner advertising2008
- Tight approximation algorithms for maximum general assignment problems2006
- Approximation algorithms for allocation problems: Improving the factor of 1 - 1/e2006
- Greedy facility location algorithms analyzed using dual fitting with factor-revealing LPJournal of the ACM, 2003