11 citations · 30 across the 7 of their papers we have counts for
Showing 2021Show all
2 papers · 1 filter
cs.GT2021★ 2 cited
Deterministic Budget-Feasible Clock Auctions
Eric Balkanski, Pranav Garimidi, Vasilis Gkatzelis +2
We revisit the well-studied problem of budget-feasible procurement, where a buyer with a strict budget constraint seeks to acquire services from a group of strategic providers (the…
cs.LG2021★ 1 cited
Instance Specific Approximations for Submodular Maximization
Eric Balkanski, Sharon Qian, Yaron Singer
For many optimization problems in machine learning, finding an optimal solution is computationally intractable and we seek algorithms that perform well in practice. Since computati…