default search action
Jay Sethuraman
Person information
- affiliation: Columbia University, New York City, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c23]Carlos Bonet, Nick Arnosti, Jay Sethuraman:
Explainable Affirmative Action. EC 2024: 310 - 2023
- [j38]Agostino Capponi, Garud Iyengar, Jay Sethuraman:
Decentralized Finance: Protocols, Risks, and Governance. Found. Trends Priv. Secur. 5(3): 144-188 (2023) - [j37]Garud Iyengar
, Fahad Saleh
Economics of Permissioned Blockchain Adoption. Manag. Sci. 69(6): 3415-3436 (2023) - [i11]Yuri Faenza, Chengyue He, Jay Sethuraman:
Scarf's algorithm and stable marriages. CoRR abs/2303.00791 (2023) - [i10]Agostino Capponi, Garud Iyengar, Jay Sethuraman:
Decentralized Finance: Protocols, Risks, and Governance. CoRR abs/2312.01018 (2023) - 2021
- [j36]Yan Long, Jay Sethuraman, Jingyi Xue:
Equal-quantile rules in resource allocation with uncertain needs. J. Econ. Theory 197: 105350 (2021) - [j35]Humoud Alsabah
Multiregional Oligopoly with Capacity Constraints. Manag. Sci. 67(8): 4789-4808 (2021) - [j34]Yuri Faenza, Ioannis Mourtos
(Un)stable matchings with blocking costs. Oper. Res. Lett. 49(5): 655-662 (2021) - [c22]Enrique Lelo de Larrea, Henry Lam, Elioth Sanabria, Jay Sethuraman, Sevin Mohammadi, Audrey Olivier
Simulating New York City Hospital Load Balancing During COVID-19. WSC 2021: 1-12 - [c21]Elioth Sanabria, Henry Lam, Enrique Lelo de Larrea, Jay Sethuraman, Sevin Mohammadi, Audrey Olivier
Short-Term Adaptive Emergency Call Volume Prediction. WSC 2021: 1-12 - 2020
- [j33]Itai Feigenbaum, Minming Li
Strategic facility location problems with linear single-dipped and single-peaked preferences. Auton. Agents Multi Agent Syst. 34(2): 49 (2020) - [j32]Itai Feigenbaum, Yash Kanoria
Dynamic Matching in School Choice: Efficient Seat Reassignment After Late Cancellations. Manag. Sci. 66(11): 5341-5361 (2020) - [c20]Shipra Agrawal, Jay Sethuraman, Xingyu Zhang:
On Optimal Ordering in the Optimal Stopping Problem. EC 2020: 187-188 - [i9]Shyam S. Chandramouli, Jay Sethuraman:
A note on the rationing of divisible and indivisible goods in a general network. CoRR abs/2002.02749 (2020)
2010 – 2019
- 2019
- [i8]Shipra Agrawal, Jay Sethuraman, Xingyu Zhang:
On optimal ordering in the optimal stopping problem. CoRR abs/1911.05096 (2019) - 2018
- [j31]Yash Kanoria
Convergence of the Core in Assignment Markets. Oper. Res. 66(3): 620-636 (2018) - 2017
- [j30]Simai He
A NonCooperative Approach to Cost Allocation in Joint Replenishment. Oper. Res. 65(6): 1562-1573 (2017) - [j29]Itai Feigenbaum, Jay Sethuraman, Chun Ye:
Approximately Optimal Mechanisms for Strategyproof Facility Location: Minimizing Lp Norm of Costs. Math. Oper. Res. 42(2): 434-447 (2017) - [j28]Shyam S. Chandramouli, Jay Sethuraman:
Groupstrategyproofness of the egalitarian mechanism for constrained rationing problems. Math. Soc. Sci. 90: 111-118 (2017) - 2016
- [j27]Jay Sethuraman:
An alternative proof of a characterization of the TTC mechanism. Oper. Res. Lett. 44(1): 107-108 (2016) - [c19]Itai Feigenbaum, Yash Kanoria, Irene Lo, Jay Sethuraman:
The Magician's Shuffle: Reusing Lottery Numbers for School Seat Redistribution. WINE 2016: 475 - [r3]Jay Sethuraman:
Stochastic Scheduling. Encyclopedia of Algorithms 2016: 2110-2113 - 2015
- [j26]Daniela Sabán, Jay Sethuraman:
The Complexity of Computing the Random Priority Allocation Matrix. Math. Oper. Res. 40(4): 1005-1014 (2015) - [j25]Jay Sethuraman, Chun Ye:
A note on the assignment problem with uniform preferences. Oper. Res. Lett. 43(3): 283-287 (2015) - [c18]Itai Feigenbaum, Jay Sethuraman:
Strategyproof Mechanisms for One-Dimensional Hybrid and Obnoxious Facility Location Models. AAAI Workshop: Incentive and Trust in E-Communities 2015 - [c17]Yash Kanoria, Daniela Sabán, Jay Sethuraman:
The size of the core in assignment markets. SODA 2015: 1916-1924 - 2014
- [i7]Yash Kanoria, Daniela Sabán, Jay Sethuraman:
The size of the core in assignment markets. CoRR abs/1407.2576 (2014) - [i6]Itai Feigenbaum, Jay Sethuraman:
Strategyproof Mechanisms for One-Dimensional Hybrid and Obnoxious Facility Location. CoRR abs/1412.3414 (2014) - [i5]Jay Sethuraman, Chun Ye:
A Note on the Assignment Problem with Uniform Preferences. CoRR abs/1412.6078 (2014) - 2013
- [j24]Hervé Moulin, Jay Sethuraman:
The Bipartite Rationing Problem. Oper. Res. 61(5): 1087-1100 (2013) - [c16]Hervé Moulin, Jay Sethuraman:
Loss calibrated methods for bipartite rationing: bipartite rationing. EC 2013: 697-714 - [c15]Daniela Sabán, Jay Sethuraman:
House allocation with indifferences: a generalization and a unified view. EC 2013: 803-820 - [c14]Daniela Sabán, Jay Sethuraman:
The Complexity of Computing the Random Priority Allocation Matrix. WINE 2013: 421 - [e1]Guy Latouche, Vaidyanathan Ramaswami, Jay Sethuraman, Karl Sigman, Mark S. Squillante, David D. Yao:
Matrix-Analytic Methods in Stochastic Models, Seventh International Conference on Matrix Analytic Methods in Stochastic Models, MAM 2011, Columbia University, New York, NY, USA, 13-16 June 2011. Springer Proceedings in Mathematics & Statistics 27, Springer 2013, ISBN 978-1-4614-4908-9 [contents] - [i4]Shyam S. Chandramouli, Jay Sethuraman:
Strategyproof and Consistent Rules for Bipartite Flow Problems. CoRR abs/1304.3946 (2013) - [i3]Itai Feigenbaum, Jay Sethuraman, Chun Ye:
Approximately Optimal Mechanisms for Strategyproof Facility Location: Minimizing $L_p$ Norm of Costs. CoRR abs/1305.2446 (2013) - [i2]Daniel Bienstock, Jay Sethuraman, Chun Ye:
Approximation Algorithms for the Incremental Knapsack Problem via Disjunctive Programming. CoRR abs/1311.4563 (2013) - 2012
- [j23]Hervé Moulin, Jay Sethuraman:
Rationing problems in bipartite networks. SIGecom Exch. 11(1): 9-17 (2012) - [j22]Lukasz Jez, Fei Li, Jay Sethuraman, Clifford Stein:
Online scheduling of packets with agreeable deadlines. ACM Trans. Algorithms 9(1): 5:1-5:11 (2012) - 2011
- [j21]Stergios Athanassoglou
House allocation with fractional endowments. Int. J. Game Theory 40(3): 481-513 (2011) - [i1]Shyam S. Chandramouli, Jay Sethuraman:
Groupstrategyproofness of the Egalitarian Mechanism for Constrained Rationing Problems. CoRR abs/1107.4566 (2011) - 2010
- [j20]Stergios Athanassoglou
A note on the inefficiency of bidding over the price of a share. Math. Soc. Sci. 60(3): 191-195 (2010) - [c13]Jay Sethuraman:
Matching mechanisms and their application to school choice. BQGT 2010: 72:1
2000 – 2009
- 2009
- [c12]Rohit Khandekar, Kirsten Hildrum, Sujay S. Parekh, Deepak Rajan, Jay Sethuraman, Joel L. Wolf:
Bounded Size Graph Clustering with Applications to Stream Processing. FSTTCS 2009: 275-286 - 2008
- [j19]Uriel G. Rothblum, Jay Sethuraman:
Stochastic scheduling in an in-forest. Discret. Optim. 5(2): 457-466 (2008) - [r2]Jay Sethuraman:
Stochastic Scheduling. Encyclopedia of Algorithms 2008 - 2007
- [j18]Jay Sethuraman, John N. Tsitsiklis:
Stochastic Search in a Forest Revisited. Math. Oper. Res. 32(3): 589-593 (2007) - [c11]Fei Li, Jay Sethuraman, Clifford Stein:
Better online buffer management. SODA 2007: 199-208 - 2006
- [j17]Jay Sethuraman, Chung-Piaw Teo
Anonymous monotonic social welfare functions. J. Econ. Theory 128(1): 232-254 (2006) - [j16]Akshay-Kumar Katta, Jay Sethuraman:
A solution to the random assignment problem on the full preference domain. J. Econ. Theory 131(1): 231-250 (2006) - [j15]Jay Sethuraman, Chung-Piaw Teo
Many-to-One Stable Matching: Geometry and Fairness. Math. Oper. Res. 31(3): 581-596 (2006) - 2005
- [j14]Jay Sethuraman, Chung-Piaw Teo
Effective Routing and Scheduling in Adversarial Queueing Networks. Algorithmica 43(1-2): 133-146 (2005) - [j13]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): 916-938 (2005) - [c10]Fei Li, Jay Sethuraman, Clifford Stein:
An optimal online algorithm for packet scheduling with agreeable deadlines. SODA 2005: 801-802 - 2004
- [j12]Akshay-Kumar Katta, Jay Sethuraman:
A Note on Bandits with a Twist. SIAM J. Discret. Math. 18(1): 110-113 (2004) - [r1]Jay Sethuraman:
Convex Quadratic Relaxations in Scheduling. Handbook of Scheduling 2004 - 2003
- [j11]Edward G. Coffman Jr., Jay Sethuraman, Vadim G. Timkovsky:
Ideal preemptive schedules on two processors. Acta Informatica 39(8): 597-612 (2003) - [j10]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): 798-813 (2003) - [j9]Jay Sethuraman, Chung-Piaw Teo, Rakesh V. Vohra:
Integer Programming and Arrovian Social Welfare Functions. Math. Oper. Res. 28(2): 309-326 (2003) - [c9]Jay Sethuraman, Chung-Piaw Teo:
Effective Routing and Scheduling in Adversarial Queueing Networks. RANDOM-APPROX 2003: 153-164 - [c8]Lisa Fleischer, Jay Sethuraman:
Approximately optimal control of fluid networks. SODA 2003: 56-65 - 2002
- [j8]Dimitris Bertsimas, Jay Sethuraman:
From fluid relaxations to practical algorithms for job shop scheduling: the makespan objective. Math. Program. 92(1): 61-102 (2002) - [c7]Jay Sethuraman, Chung-Piaw Teo, Rakesh Vohra:
Integer Programming and Arrovian Social Welfare Functions. IPCO 2002: 194-211 - [c6]Joel L. Wolf, Mark S. Squillante, Philip S. Yu, Jay Sethuraman, L. Ozsen:
Optimal crawling strategies for web search engines. WWW 2002: 136-147 - 2001
- [j7]Milind Dawande, Jayant Kalagnanam, Jay Sethuraman:
Variable Sized Bin Packing With Color Constraints. Electron. Notes Discret. Math. 7: 154-157 (2001) - [j6]Jay Sethuraman, Chung-Piaw Teo
A Polynomial-time Algorithm for the Bistable Roommates Problem. J. Comput. Syst. Sci. 63(3): 486-497 (2001) - [j5]Chung-Piaw Teo
Gale-Shapley Stable Marriage Problem Revisited: Strategic Issues and Applications. Manag. Sci. 47(9): 1252-1267 (2001) - [j4]Anton Riabov, Jay Sethuraman:
Scheduling periodic task graphs with communication delays. SIGMETRICS Perform. Evaluation Rev. 29(3): 17-18 (2001) - [j3]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): 721-741 (2001) - 2000
- [j2]Chung-Piaw Teo
On a cutting plane heuristic for the stable roommates problem and its applications. Eur. J. Oper. Res. 123(1): 195-205 (2000)
1990 – 1999
- 1999
- [c5]Chung-Piaw Teo, Jay Sethuraman, Wee-Peng Tan:
Gale-Shapley Stable Marriage Problem Revisited: Strategic Issues and Applications. IPCO 1999: 429-438 - [c4]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: 88-95 - [c3]Jay Sethuraman, Mark S. Squillante:
Optimal Stochastic Scheduling in Multiclass Parallel Queues. SIGMETRICS 1999: 93-102 - [c2]Jay Sethuraman, Mark S. Squillante:
Optimal Scheduling of Multiclass Parallel Machines. SODA 1999: 963-964 - 1998
- [j1]Chung-Piaw Teo
The Geometry of Fractional Stable Matchings and Its Applications. Math. Oper. Res. 23(4): 874-891 (1998) - 1997
- [c1]Chung-Piaw Teo, Jay Sethuraman:
LP Based Approach to Optimal Stable Matchings. SODA 1997: 710-719
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-19 22:13 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: