40 citations · 242 across the 33 of their papers we have counts for
40 papers
Submodular Maximization over Bipartite Perfect Matchings and Matroid Intersection Bases
Chandra Chekuri, Lars Rohwedder, Neta Singer +2
Motivated by applications in fairness and foundational questions, we consider the problem of maximizing a monotone submodular function over m…
Universal set families for maximization of nonnegative submodular and XOS functions
Chandra Chekuri, Richard Ueltzen, Jan Vondrak
We consider the question of designing a universal family of sets such that for any function in a certain class, we have $$\max_{S \in…
Fairness and Incentive Compatibility via Percentage Fees
Shahar Dobzinski, Sigal Oren, Jan Vondrak
We study incentive-compatible mechanisms that maximize the Nash Social Welfare. Since traditional incentive-compatible mechanisms cannot maximize the Nash Social Welfare even appro…
Faster Submodular Maximization for Several Classes of Matroids
Monika Henzinger, Paul Liu, Jan Vondrak +1
The maximization of submodular functions have found widespread application in areas such as machine learning, combinatorial optimization, and economics, where practitioners often w…
Cardinality constrained submodular maximization for random streams
Paul Liu, Aviad Rubinstein, Jan Vondrak +1
We consider the problem of maximizing submodular functions in single-pass streaming and secretaries-with-shortlists models, both with random arrival order. For cardinality constrai…
Estimating the Nash Social Welfare for coverage and other submodular valuations
Wenzheng Li, Jan Vondrak
We study the Nash Social Welfare problem: Given agents with valuation functions , partition into so as to maximize $…