# Jay Sethuraman

According to our database

Collaborative distances:

^{1}, Jay Sethuraman authored at least 49 papers between 1997 and 2018.Collaborative distances:

## Timeline

#### Legend:

Book In proceedings Article PhD thesis Other## Links

#### On csauthors.net:

## Bibliography

2018

Convergence of the Core in Assignment Markets.

Operations Research, 2018

2017

Groupstrategyproofness of the egalitarian mechanism for constrained rationing problems.

Mathematical Social Sciences, 2017

Approximately Optimal Mechanisms for Strategyproof Facility Location: Minimizing

*L*Norm of Costs._{p}
Math. Oper. Res., 2017

A NonCooperative Approach to Cost Allocation in Joint Replenishment.

Operations Research, 2017

2016

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

2015

A note on the assignment problem with uniform preferences.

Oper. Res. Lett., 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

2013

The Bipartite Rationing Problem.

Operations Research, 2013

The Complexity of Computing the Random Priority Allocation Matrix.

Proceedings of the Web and Internet Economics - 9th International Conference, 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

2012

Online scheduling of packets with agreeable deadlines.

ACM Trans. Algorithms, 2012

Rationing problems in bipartite networks.

SIGecom Exchanges, 2012

2011

House allocation with fractional endowments.

Int. J. Game Theory, 2011

2010

A note on the inefficiency of bidding over the price of a share.

Mathematical Social Sciences, 2010

Matching mechanisms and their application to school choice.

Proceedings of the Behavioral and Quantitative Game Theory, 2010

2009

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

2008

Stochastic Scheduling.

Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

Stochastic scheduling in an in-forest.

Discrete Optimization, 2008

2007

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

2006

Many-to-One Stable Matching: Geometry and Fairness.

Math. Oper. Res., 2006

Anonymous monotonic social welfare functions.

J. Economic Theory, 2006

A solution to the random assignment problem on the full preference domain.

J. Economic Theory, 2006

2005

Efficient Algorithms for Separated Continuous Linear Programs: The Multicommodity Flow Problem with Holding Costs and Extensions.

Math. Oper. Res., 2005

An optimal online algorithm for packet scheduling with agreeable deadlines.

Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2005

2004

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. Discrete Math., 2004

2003

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

Operations Research, 2003

Ideal preemptive schedules on two processors.

Acta Inf., 2003

Approximately optimal control of fluid networks.

Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2003

Effective Routing and Scheduling in Adversarial Queueing Networks.

Proceedings of the Approximation, 2003

2002

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

Integer Programming and Arrovian Social Welfare Functions.

Proceedings of the Integer Programming and Combinatorial Optimization, 2002

2001

Scheduling Algorithms for the Broadcast Delivery of Digital Products.

IEEE Trans. Knowl. Data Eng., 2001

Scheduling periodic task graphs with communication delays.

SIGMETRICS Performance Evaluation Review, 2001

A Polynomial-time Algorithm for the Bistable Roommates Problem.

J. Comput. Syst. Sci., 2001

Variable Sized Bin Packing With Color Constraints.

Electronic Notes in Discrete Mathematics, 2001

2000

On a cutting plane heuristic for the stable roommates problem and its applications.

European Journal of Operational Research, 2000

1999

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

Gale-Shapley Stable Marriage Problem Revisited: Strategic Issues and Applications.

Proceedings of the Integer Programming and Combinatorial Optimization, 1999

1998

The Geometry of Fractional Stable Matchings and Its Applications.

Math. Oper. Res., 1998

1997

LP Based Approach to Optimal Stable Matchings.

Proceedings of the Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 1997