We present a constant-factor approximation algorithm for the Nash social...
The maximization of submodular functions have found widespread applicati...
For any ε>0, we give a simple, deterministic
(6+ε)-approximation algorit...
In this paper, we study contention resolution schemes for matchings. Giv...
In this paper, we investigate two variants of the secretary problem. In ...
We study the communication complexity of dominant strategy implementatio...
It is known from the work of Shearer (1985) (and also Scott and Sokal (2...
We consider the problem of maximizing submodular functions in single-pas...
We consider the bilateral trade problem, in which two agents trade a sin...
We present a 380-approximation algorithm for the Nash Social Welfare
pro...
We study the Nash Social Welfare problem: Given n agents with valuation
...
In large-data applications, it is desirable to design algorithms with a ...
In this paper, we introduce a novel technique for constrained submodular...
Algorithmic stability is a classical approach to understanding and analy...
Uniform stability of a learning algorithm is a classical notion of
algor...
Submodular optimization has received significant attention in both pract...