We consider the problem of maximizing a non-negative submodular set function f: 2N-> RR+
over a ground set N subject to a variety of packing type constraints including (multiple) …

Constrained submodular maximization problems have long been studied, most recently in
the context of auctions and computational advertising, with near-optimal results known …

Most previous studies on reliable facility location design assume that disruptions at different
locations are independent. In this paper, we present a model that allows disruptions to be …

For revenue and welfare maximization in single-dimensional Bayesian settings, Chawla et
al.(STOC10) recently showed that sequential posted-price mechanisms (SPMs), though …

This text provides a look at select topics in economic mechanism design through the lens of
approximation. It reviews the classical economic theory of mechanism design wherein a …

Algorithms for learning to rank Web documents, display ads, or other types of items
constitute a fundamental component of search engines and more generally of online …

When decisions are made in the presence of high-dimensional stochastic data, handling
joint distribution of correlated random variables can present a formidable task, both in terms …

Motivated by civic problems such as participatory budgeting and multiwinner elections, we
consider the problem of public good allocation: Given a set of indivisible projects (or …

A stochastic probing problem consists of a set of elements whose values are independent
random variables. The algorithm knows the distributions of these variables, but not the …

The influence maximization paradigm has been used by researchers in various fields in
order to study how information spreads in social networks. While previously the attention …