11 citations · 21 across the 6 of their papers we have counts for
6 papers
A Note on the Assignment Problem with Uniform Preferences
Jay Sethuraman, Chun Ye
Motivated by a problem of scheduling unit-length jobs with weak preferences over time-slots, the random assignment problem (also called the house allocation problem) is considered…
Structure and complexity of ex post efficient random assignments
Haris Aziz, Simon Mackenzie, Lirong Xia +1
In the random assignment problem, objects are randomly assigned to agents keeping in view the agents' preferences over objects. A random assignment specifies the probability of an…
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…
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…
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…
Rigidity of Graph Joins and Hendrickson's Conjecture
Timothy Sun, Chun Ye
Whiteley \cite{wh} gives a complete characterization of the infinitesimal flexes of complete bipartite frameworks. Our work generalizes a specific infinitesimal flex to include joi…