Jay Sethuraman

Publication Activity (10 Years)

Years Active: 1997-2023
Publications (10 Years): 24

Top Topics

Facility Location

Top Venues

Oper. Res. Lett.

Math. Oper. Res.

Publications

Garud Iyengar, Fahad Saleh, Jay Sethuraman, Wenjun Wang
Economics of Permissioned Blockchain Adoption. Manag. Sci. 69 (6) (2023)
Yuri Faenza, Chengyue He, Jay Sethuraman
Scarf's algorithm and stable marriages. CoRR (2023)
Agostino Capponi, Garud Iyengar, Jay Sethuraman
Decentralized Finance: Protocols, Risks, and Governance. CoRR (2023)
Agostino Capponi, Garud Iyengar, Jay Sethuraman
Decentralized Finance: Protocols, Risks, and Governance. Found. Trends Priv. Secur. 5 (3) (2023)
Elioth Sanabria, Henry Lam, Enrique Lelo de Larrea, Jay Sethuraman, Sevin Mohammadi, Audrey Olivier, Andrew W. Smyth, Edward M. Dolan, Nicholas E. Johnson, Timothy R. Kepler, Afsan Quayyum, Kathleen S. Thomson
Short-Term Adaptive Emergency Call Volume Prediction. WSC (2021)
Yuri Faenza, Ioannis Mourtos, Michalis Samaris, Jay Sethuraman
(Un)stable matchings with blocking costs. Oper. Res. Lett. 49 (5) (2021)
Humoud Alsabah, Benjamin Bernard, Agostino Capponi, Garud Iyengar, Jay Sethuraman
Multiregional Oligopoly with Capacity Constraints. Manag. Sci. 67 (8) (2021)
Yan Long, Jay Sethuraman, Jingyi Xue
Equal-quantile rules in resource allocation with uncertain needs. J. Econ. Theory 197 (2021)
Enrique Lelo de Larrea, Henry Lam, Elioth Sanabria, Jay Sethuraman, Sevin Mohammadi, Audrey Olivier, Andrew W. Smyth, Edward M. Dolan, Nicholas E. Johnson, Timothy R. Kepler, Afsan Quayyum, Kathleen S. Thomson
Simulating New York City Hospital Load Balancing During COVID-19. WSC (2021)
Itai Feigenbaum, Minming Li, Jay Sethuraman, Fangzhou Wang, Shaokun Zou
Strategic facility location problems with linear single-dipped and single-peaked preferences. Auton. Agents Multi Agent Syst. 34 (2) (2020)
Shipra Agrawal, Jay Sethuraman, Xingyu Zhang
On Optimal Ordering in the Optimal Stopping Problem. EC (2020)
Shyam S. Chandramouli, Jay Sethuraman
A note on the rationing of divisible and indivisible goods in a general network. CoRR (2020)
Itai Feigenbaum, Yash Kanoria, Irene Lo, Jay Sethuraman
Dynamic Matching in School Choice: Efficient Seat Reassignment After Late Cancellations. Manag. Sci. 66 (11) (2020)
Shipra Agrawal, Jay Sethuraman, Xingyu Zhang
On optimal ordering in the optimal stopping problem. CoRR (2019)
Yash Kanoria, Daniela Sabán, Jay Sethuraman
Convergence of the Core in Assignment Markets. Oper. Res. 66 (3) (2018)
Itai Feigenbaum, Jay Sethuraman, Chun Ye
Norm of Costs. Math. Oper. Res. 42 (2) (2017)
Simai He, Jay Sethuraman, Xuan Wang, Jiawei Zhang
A NonCooperative Approach to Cost Allocation in Joint Replenishment. Oper. Res. 65 (6) (2017)
Shyam S. Chandramouli, Jay Sethuraman
Groupstrategyproofness of the egalitarian mechanism for constrained rationing problems. Math. Soc. Sci. 90 (2017)
Itai Feigenbaum, Yash Kanoria, Irene Lo, Jay Sethuraman
The Magician's Shuffle: Reusing Lottery Numbers for School Seat Redistribution. WINE (2016)
Jay Sethuraman
An alternative proof of a characterization of the TTC mechanism. Oper. Res. Lett. 44 (1) (2016)
Jay Sethuraman, Chun Ye
A note on the assignment problem with uniform preferences. Oper. Res. Lett. 43 (3) (2015)
Yash Kanoria, Daniela Sabán, Jay Sethuraman
The size of the core in assignment markets. SODA (2015)
Itai Feigenbaum, Jay Sethuraman
Strategyproof Mechanisms for One-Dimensional Hybrid and Obnoxious Facility Location Models. AAAI Workshop: Incentive and Trust in E-Communities (2015)
Daniela Sabán, Jay Sethuraman
The Complexity of Computing the Random Priority Allocation Matrix. Math. Oper. Res. 40 (4) (2015)
Itai Feigenbaum, Jay Sethuraman
Strategyproof Mechanisms for One-Dimensional Hybrid and Obnoxious Facility Location. CoRR (2014)
Jay Sethuraman, Chun Ye
A Note on the Assignment Problem with Uniform Preferences. CoRR (2014)
Yash Kanoria, Daniela Sabán, Jay Sethuraman
The size of the core in assignment markets. CoRR (2014)
Hervé Moulin, Jay Sethuraman
The Bipartite Rationing Problem. Oper. Res. 61 (5) (2013)
Daniela Sabán, Jay Sethuraman
House allocation with indifferences: a generalization and a unified view. EC (2013)
Daniela Sabán, Jay Sethuraman
The Complexity of Computing the Random Priority Allocation Matrix. WINE (2013)
Itai Feigenbaum, Jay Sethuraman, Chun Ye
Approximately Optimal Mechanisms for Strategyproof Facility Location: Minimizing $L_p$ Norm of Costs CoRR (2013)
Daniel Bienstock, Jay Sethuraman, Chun Ye
Approximation Algorithms for the Incremental Knapsack Problem via Disjunctive Programming. CoRR (2013)
Shyam S. Chandramouli, Jay Sethuraman
Strategyproof and Consistent Rules for Bipartite Flow Problems CoRR (2013)
Hervé Moulin, Jay Sethuraman
Loss calibrated methods for bipartite rationing: bipartite rationing. EC (2013)
Hervé Moulin, Jay Sethuraman
Rationing problems in bipartite networks. SIGecom Exch. 11 (1) (2012)
Lukasz Jez, Fei Li, Jay Sethuraman, Clifford Stein
Online scheduling of packets with agreeable deadlines. ACM Trans. Algorithms 9 (1) (2012)
Stergios Athanassoglou, Jay Sethuraman
House allocation with fractional endowments. Int. J. Game Theory 40 (3) (2011)
Shyam S. Chandramouli, Jay Sethuraman
Groupstrategyproofness of the Egalitarian Mechanism for Constrained Rationing Problems CoRR (2011)
Stergios Athanassoglou, Steven J. Brams, Jay Sethuraman
A note on the inefficiency of bidding over the price of a share. Math. Soc. Sci. 60 (3) (2010)
Jay Sethuraman
Matching mechanisms and their application to school choice. BQGT (2010)
Rohit Khandekar, Kirsten Hildrum, Sujay Parekh, Deepak Rajan, Jay Sethuraman, Joel L. Wolf
Bounded Size Graph Clustering with Applications to Stream Processing. FSTTCS (2009)
Uriel G. Rothblum, Jay Sethuraman
Stochastic scheduling in an in-forest. Discret. Optim. 5 (2) (2008)
Fei Li, Jay Sethuraman, Clifford Stein
Better online buffer management. SODA (2007)
Jay Sethuraman, John N. Tsitsiklis
Stochastic Search in a Forest Revisited. Math. Oper. Res. 32 (3) (2007)
Jay Sethuraman, Chung-Piaw Teo, Rakesh V. Vohra
Anonymous monotonic social welfare functions. J. Econ. Theory 128 (1) (2006)
Akshay-Kumar Katta, Jay Sethuraman
A solution to the random assignment problem on the full preference domain. J. Econ. Theory 131 (1) (2006)
Jay Sethuraman, Chung-Piaw Teo, Liwen Qian
Many-to-One Stable Matching: Geometry and Fairness. Math. Oper. Res. 31 (3) (2006)
Jay Sethuraman, Chung-Piaw Teo
Effective Routing and Scheduling in Adversarial Queueing Networks. Algorithmica 43 (1-2) (2005)
Lisa Fleischer, Jay Sethuraman
Efficient Algorithms for Separated Continuous Linear Programs: The Multicommodity Flow Problem with Holding Costs and Extensions. Math. Oper. Res. 30 (4) (2005)
Fei Li, Jay Sethuraman, Clifford Stein
An optimal online algorithm for packet scheduling with agreeable deadlines. SODA (2005)
Akshay-Kumar Katta, Jay Sethuraman
A Note on Bandits with a Twist. SIAM J. Discret. Math. 18 (1) (2004)
Edward G. Coffman Jr., Jay Sethuraman, Vadim G. Timkovsky
Ideal preemptive schedules on two processors. Acta Informatica 39 (8) (2003)
Lisa Fleischer, Jay Sethuraman
Approximately optimal control of fluid networks. SODA (2003)
Jay Sethuraman, Chung-Piaw Teo
Effective Routing and Scheduling in Adversarial Queueing Networks. RANDOM-APPROX (2003)
Jay Sethuraman, Chung-Piaw Teo, Rakesh V. Vohra
Integer Programming and Arrovian Social Welfare Functions. Math. Oper. Res. 28 (2) (2003)
Dimitris Bertsimas, David Gamarnik, Jay Sethuraman
From Fluid Relaxations to Practical Algorithms for High-Multiplicity Job-Shop Scheduling: The Holding Cost Objective. Oper. Res. 51 (5) (2003)
Joel L. Wolf, Mark S. Squillante, Philip S. Yu, Jay Sethuraman, L. Ozsen
Optimal crawling strategies for web search engines. WWW (2002)
Dimitris Bertsimas, Jay Sethuraman
From fluid relaxations to practical algorithms for job shop scheduling: the makespan objective. Math. Program. 92 (1) (2002)
Jay Sethuraman, Chung-Piaw Teo, Rakesh Vohra
Integer Programming and Arrovian Social Welfare Functions. IPCO (2002)
Anton Riabov, Jay Sethuraman
Scheduling periodic task graphs with communication delays. SIGMETRICS Perform. Evaluation Rev. 29 (3) (2001)
Joel L. Wolf, Mark S. Squillante, John Turek, Philip S. Yu, Jay Sethuraman
Scheduling Algorithms for the Broadcast Delivery of Digital Products. IEEE Trans. Knowl. Data Eng. 13 (5) (2001)
Milind Dawande, Jayant Kalagnanam, Jay Sethuraman
Variable Sized Bin Packing With Color Constraints. Electron. Notes Discret. Math. 7 (2001)
Jay Sethuraman, Chung-Piaw Teo
A Polynomial-time Algorithm for the Bistable Roommates Problem. J. Comput. Syst. Sci. 63 (3) (2001)
Chung-Piaw Teo, Jay Sethuraman, Wee-Peng Tan
Gale-Shapley Stable Marriage Problem Revisited: Strategic Issues and Applications. Manag. Sci. 47 (9) (2001)
Chung-Piaw Teo, Jay Sethuraman
On a cutting plane heuristic for the stable roommates problem and its applications. Eur. J. Oper. Res. 123 (1) (2000)
Jay Sethuraman, Mark S. Squillante
Optimal Stochastic Scheduling in Multiclass Parallel Queues. SIGMETRICS (1999)
Charu C. Aggarwal, Mark S. Squillante, Joel L. Wolf, Philip S. Yu, Jay Sethuraman
Optimizing Profits in the Broadcast Delivery of Multimedia Products. Multimedia Information Systems (1999)
Jay Sethuraman, Mark S. Squillante
Optimal Scheduling of Multiclass Parallel Machines. SODA (1999)
Chung-Piaw Teo, Jay Sethuraman, Wee-Peng Tan
Gale-Shapley Stable Marriage Problem Revisited: Strategic Issues and Applications. IPCO (1999)
Chung-Piaw Teo, Jay Sethuraman
The Geometry of Fractional Stable Matchings and Its Applications. Math. Oper. Res. 23 (4) (1998)
Chung-Piaw Teo, Jay Sethuraman
LP Based Approach to Optimal Stable Matchings. SODA (1997)