Jay Sethuraman

From MaRDI portal
Revision as of 11:47, 12 December 2023 by AuthorDisambiguator (talk | contribs) (AuthorDisambiguator moved page Jay Sethuraman to Jay Sethuraman: Duplicate)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Person:607261

Available identifiers

zbMath Open sethuraman.jayMaRDI QIDQ607261

List of research outcomes





PublicationDate of PublicationType
Characterizing the TTC rule via pair-efficiency: a short proof2024-03-20Paper
Scarf's algorithm and stable marriages2023-03-01Paper
(Un)stable matchings with blocking costs2021-12-13Paper
Equal-quantile rules in resource allocation with uncertain needs2021-09-29Paper
Convergence of the Core in Assignment Markets2020-10-12Paper
A note on the rationing of divisible and indivisible goods in a general network2020-01-17Paper
How much inequality in income is fair? A microeconomic game theoretic perspective2018-11-13Paper
A note on the assignment problem with uniform preferences2018-09-28Paper
An alternative proof of a characterization of the TTC mechanism2018-09-28Paper
Balancing supply and demand under bilateral constraints2018-09-11Paper
A NonCooperative Approach to Cost Allocation in Joint Replenishment2018-01-11Paper
Groupstrategyproofness of the egalitarian mechanism for constrained rationing problems2017-11-22Paper
The size of the core in assignment markets2017-10-05Paper
Approximately Optimal Mechanisms for Strategyproof Facility Location: Minimizing Lp Norm of Costs2017-06-02Paper
The Complexity of Computing the Random Priority Allocation Matrix2016-01-29Paper
https://portal.mardi4nfdi.de/entity/Q55018512015-08-14Paper
https://portal.mardi4nfdi.de/entity/Q29345982014-12-18Paper
Online scheduling of packets with agreeable deadlines2014-12-05Paper
https://portal.mardi4nfdi.de/entity/Q29217432014-10-13Paper
The Bipartite Rationing Problem2014-06-26Paper
A note on object allocation under lexicographic preferences2014-03-24Paper
Bounded Size Graph Clustering with Applications to Stream Processing2012-10-24Paper
Gale-Shapley Stable Marriage Problem Revisited: Strategic Issues and Applications2012-02-19Paper
House allocation with fractional endowments2011-09-06Paper
Lotteries in student assignment: An equivalence result2011-03-08Paper
A note on the inefficiency of bidding over the price of a share2010-11-19Paper
Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques2010-05-26Paper
From Fluid Relaxations to Practical Algorithms for High-Multiplicity Job-Shop Scheduling: The Holding Cost Objective2009-07-09Paper
Stochastic scheduling in an in-forest2008-10-29Paper
Efficient Algorithms for Separated Continuous Linear Programs: The Multicommodity Flow Problem with Holding Costs and Extensions2008-05-27Paper
Many-to-One Stable Matching: Geometry and Fairness2008-05-27Paper
Stochastic Search in a Forest Revisited2008-05-27Paper
A solution to the random assignment problem on the full preference domain2007-01-09Paper
Anonymous monotonic social welfare functions2006-07-12Paper
Effective routing and scheduling in adversarial queueing networks2006-03-21Paper
Integer Programming and Arrovian Social Welfare Functions2005-11-11Paper
A Note on Bandits with a Twist2005-02-28Paper
https://portal.mardi4nfdi.de/entity/Q47375282004-08-11Paper
https://portal.mardi4nfdi.de/entity/Q44712742004-07-28Paper
Ideal preemptive schedules on two processors2004-03-11Paper
https://portal.mardi4nfdi.de/entity/Q47933472003-02-11Paper
A polynomial-time algorithm for the bistable roommates problem2002-07-04Paper
From fluid relaxations to practical algorithms for job shop scheduling: The makespan objective2002-01-01Paper
The Geometry of Fractional Stable Matchings and Its Applications2001-11-26Paper
https://portal.mardi4nfdi.de/entity/Q27414952001-10-24Paper
https://portal.mardi4nfdi.de/entity/Q42637292001-07-31Paper
https://portal.mardi4nfdi.de/entity/Q45171112000-11-23Paper
On a cutting plane heuristic for the stable roommates problem and its applications2000-08-30Paper
https://portal.mardi4nfdi.de/entity/Q42524321999-06-17Paper

Research outcomes over time

This page was built for person: Jay Sethuraman