11 citations · 21 across the 6 of their papers we have counts for
Showing 2013Show all
3 papers · 1 filter
cs.DS2013★ 11 cited
Approximation Algorithms for the Incremental Knapsack Problem via Disjunctive Programming
Daniel Bienstock, Jay Sethuraman, Chun Ye
In the incremental knapsack problem ($\IK$), we are given a knapsack whose capacity grows weakly as a function of time. There is a time horizon of periods and the capacity of t…
cs.GT2013
Cake Cutting Algorithms for Piecewise Constant and Piecewise Uniform Valuations
Haris Aziz, Chun Ye
Cake cutting is one of the most fundamental settings in fair division and mechanism design without money. In this paper, we consider different levels of three fundamental goals in…
cs.GT2013★ 8 cited
Approximately Optimal Mechanisms for Strategyproof Facility Location: Minimizing Norm of Costs
Itai Feigenbaum, Jay Sethuraman, Chun Ye
We consider the problem of locating a single facility on the real line. This facility serves a set of agents, each of whom is located on the line, and incurs a cost equal to his di…