16 citations · 40 across the 12 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★ 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…
math.OC2013★ 2 cited
Strategyproof and Consistent Rules for Bipartite Flow Problems
Shyam S Chandramouli, Jay Sethuraman
We continue the study of Bochet et al. and Moulin and Sethuraman on fair allocation in bipartite networks. In these models, there is a moneyless market, in which a non-storable, ho…