Online and stochastic variants of welfare maximization

Details Online and stochastic variants of welfare maximization Online and stochastic variants of welfare maximization

2012-04-04

arxiv.org/abs/1204.1025v1

Computer Science

Data Structures and Algorithms

Scientific paper

We prove that there is no $(1/2+\Omega(1))$-competitive algorithm (even randomized, against an oblivious adversary) for online welfare maximization with coverage valuations, unless $NP = RP$. On the other hand, we prove that the greedy algorithm in a stochastic setting with valuations satisfying diminishing returns is $(1-1/e)$-competitive, which is optimal even for coverage valuations, unless $NP=RP$.

Affiliated with

Also associated with

No associations

Rating

Online and stochastic variants of welfare maximization does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Online and stochastic variants of welfare maximization, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Online and stochastic variants of welfare maximization will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-32820