Jay Sethuraman

According to our database1, Jay Sethuraman authored at least 57 papers between 1997 and 2020.

Collaborative distances:



In proceedings 
PhD thesis 


On csauthors.net:


Dynamic Matching in School Choice: Efficient Seat Reassignment After Late Cancellations.
Manag. Sci., 2020

A note on the rationing of divisible and indivisible goods in a general network.
CoRR, 2020

Strategic facility location problems with linear single-dipped and single-peaked preferences.
Auton. Agents Multi Agent Syst., 2020

On Optimal Ordering in the Optimal Stopping Problem.
Proceedings of the EC '20: The 21st ACM Conference on Economics and Computation, 2020

Convergence of the Core in Assignment Markets.
Oper. Res., 2018

Groupstrategyproofness of the egalitarian mechanism for constrained rationing problems.
Math. Soc. Sci., 2017

Approximately Optimal Mechanisms for Strategyproof Facility Location: Minimizing <i>L<sub>p</sub></i> Norm of Costs.
Math. Oper. Res., 2017

A NonCooperative Approach to Cost Allocation in Joint Replenishment.
Oper. Res., 2017

Stochastic Scheduling.
Encyclopedia of Algorithms, 2016

An alternative proof of a characterization of the TTC mechanism.
Oper. Res. Lett., 2016

The Magician's Shuffle: Reusing Lottery Numbers for School Seat Redistribution.
Proceedings of the Web and Internet Economics - 12th International Conference, 2016

A note on the assignment problem with uniform preferences.
Oper. Res. Lett., 2015

The Complexity of Computing the Random Priority Allocation Matrix.
Math. Oper. Res., 2015

The size of the core in assignment markets.
Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 2015

Strategyproof Mechanisms for One-Dimensional Hybrid and Obnoxious Facility Location Models.
Proceedings of the Incentive and Trust in E-Communities, 2015

Strategyproof Mechanisms for One-Dimensional Hybrid and Obnoxious Facility Location.
CoRR, 2014

The Bipartite Rationing Problem.
Oper. Res., 2013

Approximately Optimal Mechanisms for Strategyproof Facility Location: Minimizing $L_p$ Norm of Costs
CoRR, 2013

Strategyproof and Consistent Rules for Bipartite Flow Problems
CoRR, 2013

Approximation Algorithms for the Incremental Knapsack Problem via Disjunctive Programming.
CoRR, 2013

House allocation with indifferences: a generalization and a unified view.
Proceedings of the fourteenth ACM Conference on Electronic Commerce, 2013

Loss calibrated methods for bipartite rationing: bipartite rationing.
Proceedings of the fourteenth ACM Conference on Electronic Commerce, 2013

Online scheduling of packets with agreeable deadlines.
ACM Trans. Algorithms, 2012

Rationing problems in bipartite networks.
SIGecom Exch., 2012

House allocation with fractional endowments.
Int. J. Game Theory, 2011

A note on the inefficiency of bidding over the price of a share.
Math. Soc. Sci., 2010

Matching mechanisms and their application to school choice.
Proceedings of the Behavioral and Quantitative Game Theory, 2010

Bounded Size Graph Clustering with Applications to Stream Processing.
Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2009

Stochastic Scheduling.
Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

Stochastic scheduling in an in-forest.
Discret. Optim., 2008

Stochastic Search in a Forest Revisited.
Math. Oper. Res., 2007

Better online buffer management.
Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2007

Many-to-One Stable Matching: Geometry and Fairness.
Math. Oper. Res., 2006

Anonymous monotonic social welfare functions.
J. Econ. Theory, 2006

A solution to the random assignment problem on the full preference domain.
J. Econ. Theory, 2006

Efficient Algorithms for Separated Continuous Linear Programs: The Multicommodity Flow Problem with Holding Costs and Extensions.
Math. Oper. Res., 2005

Effective Routing and Scheduling in Adversarial Queueing Networks.
Algorithmica, 2005

An optimal online algorithm for packet scheduling with agreeable deadlines.
Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2005

Convex Quadratic Relaxations in Scheduling.
Proceedings of the Handbook of Scheduling - Algorithms, Models, and Performance Analysis., 2004

A Note on Bandits with a Twist.
SIAM J. Discret. Math., 2004

Integer Programming and Arrovian Social Welfare Functions.
Math. Oper. Res., 2003

From Fluid Relaxations to Practical Algorithms for High-Multiplicity Job-Shop Scheduling: The Holding Cost Objective.
Oper. Res., 2003

Ideal preemptive schedules on two processors.
Acta Informatica, 2003

Approximately optimal control of fluid networks.
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2003

From fluid relaxations to practical algorithms for job shop scheduling: the makespan objective.
Math. Program., 2002

Optimal crawling strategies for web search engines.
Proceedings of the Eleventh International World Wide Web Conference, 2002

Scheduling Algorithms for the Broadcast Delivery of Digital Products.
IEEE Trans. Knowl. Data Eng., 2001

Scheduling periodic task graphs with communication delays.
SIGMETRICS Perform. Evaluation Rev., 2001

Gale-Shapley Stable Marriage Problem Revisited: Strategic Issues and Applications.
Manag. Sci., 2001

A Polynomial-time Algorithm for the Bistable Roommates Problem.
J. Comput. Syst. Sci., 2001

Variable Sized Bin Packing With Color Constraints.
Electron. Notes Discret. Math., 2001

On a cutting plane heuristic for the stable roommates problem and its applications.
Eur. J. Oper. Res., 2000

Optimal Scheduling of Multiclass Parallel Machines.
Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, 1999

Optimal Stochastic Scheduling in Multiclass Parallel Queues.
Proceedings of the 1999 ACM SIGMETRICS international conference on Measurement and modeling of computer systems, 1999

Optimizing Profits in the Broadcast Delivery of Multimedia Products.
Proceedings of the MIS '99, 1999

The Geometry of Fractional Stable Matchings and Its Applications.
Math. Oper. Res., 1998

LP Based Approach to Optimal Stable Matchings.
Proceedings of the Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 1997