We study the design of embeddings into Euclidean space with outliers. Gi...
In the Time-Windows TSP (TW-TSP) we are given requests at different loca...
We design fair sponsored search auctions that achieve a near-optimal tra...
A recent line of research has established a novel desideratum for design...
Double-blind conferences have engaged in debates over whether to allow
a...
Citations play an important role in researchers' careers as a key factor...
The Pandora's Box problem asks to find a search strategy over n
alternat...
Theoretical computer science (TCS) is a subdiscipline of computer scienc...
We study the revenue guarantees and approximability of item pricing. Rec...
We investigate non-adaptive algorithms for matroid prophet inequalities....
We study a pricing problem where a seller has k identical copies of a
pr...
We study the tradeoff between social welfare maximization and fairness i...
We study the multi-item mechanism design problem where a monopolist sell...
Classical algorithm design is geared towards worst case instances and fa...
Buying and selling of data online has increased substantially over the l...
Modern distributed machine learning (ML) training workloads benefit
sign...
Fairness in advertising is a topic of particular concern motivated by
th...
Fairness in advertising is a topic of particular interest in both the
co...
Multi-item mechanisms can be very complex offering many different bundle...
Multi-item mechanisms can be very complex offering many different bundle...
This paper develops the theory of mechanism redesign by which an auction...
We consider the problem of truthful online resource allocation to maximi...