Proceedings of the fourth ACM international conference on Web search and data mining
Discrete Applied Mathematics
Proceedings of the sixth ACM international conference on Web search and data mining
Optimal Auctions with Positive Network Externalities
ACM Transactions on Economics and Computation - Special Issue on Algorithmic Game Theory
| Hi-index | 0.00 |
Given a universe $\U$ of $n$ elements and a weighted collection $\c$ of $m$ subsets of $\U$, the \emph{universal set cover} problem is to a-priori map each element $u \in \U$ to a set $\MAP(u) \in \c$ containing $u$, so that $X\subseteq U$ is covered by $\MAP(X)=\cup_{u\in X}\MAP(u)$. The aim is finding a mapping such that the cost of $\MAP(X)$ is as close as possible to the optimal set-cover cost for $X$. (Such problems are also called \emph{oblivious} or \emph{a-priori} optimization problems.) Unfortunately, for every universal mapping, the cost of $\MAP(X)$ can be $\Omega(\sqrt{n})$ times larger than optimal if the set $X$ is adversarially chosen.In this paper we study the \emph{performance on average}, when $X$ is a set of randomly chosen elements from the universe: we show how to efficiently find a universal map whose expected cost is $O(\log mn)$ times the expected optimal cost. In fact, we give a slightly improved analysis and show that this is the best possible.We generalize these ideas to weighted set cover and show similar guarantees to (non-metric) facility location, where we have to balance the facility opening cost with the cost of connecting clients to the facilities. We show applications of our results to universal multi-cut and disc-covering problems, and show how all these universal mappings give us \emph{stochastic online algorithms} with the same competitive factors.