Jay Sethuraman

Found. Trends Priv. Secur., 2023

Scarf's algorithm and stable marriages.

[BibT_eX]

[DOI]

Yuri Faenza

Chengyue He

CoRR, 2023

2021

(Un)stable matchings with blocking costs.

[BibT_eX]

[DOI]

Oper. Res. Lett., 2021

Multiregional Oligopoly with Capacity Constraints.

[BibT_eX]

[DOI]

Manag. Sci., 2021

Equal-quantile rules in resource allocation with uncertain needs.

[BibT_eX]

[DOI]

Yan Long

Jingyi Xue

J. Econ. Theory, 2021

Short-Term Adaptive Emergency Call Volume Prediction.

[BibT_eX]

[DOI]

Elioth Sanabria

Henry Lam

Enrique Lelo de Larrea

Proceedings of the Winter Simulation Conference, 2021

Simulating New York City Hospital Load Balancing During COVID-19.

[BibT_eX]

[DOI]

Enrique Lelo de Larrea

Proceedings of the Winter Simulation Conference, 2021

2020

Dynamic Matching in School Choice: Efficient Seat Reassignment After Late Cancellations.

[BibT_eX]

[DOI]

Manag. Sci., 2020

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

[BibT_eX]

[DOI]

Shyam S. Chandramouli

CoRR, 2020

Strategic facility location problems with linear single-dipped and single-peaked preferences.

[BibT_eX]

[DOI]

Auton. Agents Multi Agent Syst., 2020

On Optimal Ordering in the Optimal Stopping Problem.

[BibT_eX]

[DOI]

Shipra Agrawal

Xingyu Zhang

Proceedings of the EC '20: The 21st ACM Conference on Economics and Computation, 2020

2018

Convergence of the Core in Assignment Markets.

[BibT_eX]

[DOI]

Yash Kanoria

Oper. Res., 2018

2017

Groupstrategyproofness of the egalitarian mechanism for constrained rationing problems.

[BibT_eX]

[DOI]

Shyam S. Chandramouli

Math. Soc. Sci., 2017

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

[BibT_eX]

[DOI]

Math. Oper. Res., 2017

A NonCooperative Approach to Cost Allocation in Joint Replenishment.

[BibT_eX]

[DOI]

Oper. Res., 2017

2016

Stochastic Scheduling.

[BibT_eX]

[DOI]

Encyclopedia of Algorithms, 2016

An alternative proof of a characterization of the TTC mechanism.

[BibT_eX]

[DOI]

Oper. Res. Lett., 2016

The Magician's Shuffle: Reusing Lottery Numbers for School Seat Redistribution.

[BibT_eX]

[DOI]

Proceedings of the Web and Internet Economics - 12th International Conference, 2016

2015

A note on the assignment problem with uniform preferences.

[BibT_eX]

[DOI]

Oper. Res. Lett., 2015

The Complexity of Computing the Random Priority Allocation Matrix.

[BibT_eX]

[DOI]

Math. Oper. Res., 2015

The size of the core in assignment markets.

[BibT_eX]

[DOI]

Yash Kanoria

Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 2015

Strategyproof Mechanisms for One-Dimensional Hybrid and Obnoxious Facility Location Models.

[BibT_eX]

[DOI]

Proceedings of the Incentive and Trust in E-Communities, 2015

2014

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

[BibT_eX]

[DOI]

CoRR, 2014

2013

The Bipartite Rationing Problem.

[BibT_eX]

[DOI]

Hervé Moulin

Oper. Res., 2013

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

[BibT_eX]

[DOI]

CoRR, 2013

Strategyproof and Consistent Rules for Bipartite Flow Problems

[BibT_eX]

[DOI]

Shyam S. Chandramouli

CoRR, 2013

Approximation Algorithms for the Incremental Knapsack Problem via Disjunctive Programming.

[BibT_eX]

[DOI]

Daniel Bienstock

CoRR, 2013

House allocation with indifferences: a generalization and a unified view.

[BibT_eX]

[DOI]

Proceedings of the fourteenth ACM Conference on Electronic Commerce, 2013

Loss calibrated methods for bipartite rationing: bipartite rationing.

[BibT_eX]

[DOI]

Hervé Moulin

Proceedings of the fourteenth ACM Conference on Electronic Commerce, 2013

2012

Online scheduling of packets with agreeable deadlines.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2012

Rationing problems in bipartite networks.

[BibT_eX]

[DOI]

Hervé Moulin

SIGecom Exch., 2012

2011

House allocation with fractional endowments.

[BibT_eX]

[DOI]

Stergios Athanassoglou

Int. J. Game Theory, 2011

2010

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

[BibT_eX]

[DOI]

Stergios Athanassoglou

Steven J. Brams

Math. Soc. Sci., 2010

Matching mechanisms and their application to school choice.

[BibT_eX]

[DOI]

Proceedings of the Behavioral and Quantitative Game Theory, 2010

2009

Bounded Size Graph Clustering with Applications to Stream Processing.

[BibT_eX]

[DOI]

Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2009

2008

Stochastic Scheduling.

[BibT_eX]

[DOI]

Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

Stochastic scheduling in an in-forest.

[BibT_eX]

[DOI]

Uriel G. Rothblum

Discret. Optim., 2008

2007

Stochastic Search in a Forest Revisited.

[BibT_eX]

[DOI]

John N. Tsitsiklis

Math. Oper. Res., 2007

Better online buffer management.

[BibT_eX]

[DOI]

Fei Li

Clifford Stein

Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2007

2006

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

[BibT_eX]

[DOI]

Liwen Qian

Math. Oper. Res., 2006

Anonymous monotonic social welfare functions.

[BibT_eX]

[DOI]

Rakesh V. Vohra

J. Econ. Theory, 2006

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

[BibT_eX]

[DOI]

Akshay-Kumar Katta

J. Econ. Theory, 2006

2005

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

[BibT_eX]

[DOI]

Lisa Fleischer

Math. Oper. Res., 2005

Effective Routing and Scheduling in Adversarial Queueing Networks.

[BibT_eX]

[DOI]

Algorithmica, 2005

An optimal online algorithm for packet scheduling with agreeable deadlines.

[BibT_eX]

[DOI]

Fei Li

Clifford Stein

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

2004

Convex Quadratic Relaxations in Scheduling.

[BibT_eX]

[DOI]

Proceedings of the Handbook of Scheduling - Algorithms, Models, and Performance Analysis., 2004

A Note on Bandits with a Twist.

[BibT_eX]

[DOI]

Akshay-Kumar Katta

SIAM J. Discret. Math., 2004

2003

Integer Programming and Arrovian Social Welfare Functions.

[BibT_eX]

[DOI]

Rakesh V. Vohra

Math. Oper. Res., 2003

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

[BibT_eX]

[DOI]

Dimitris Bertsimas

David Gamarnik

Oper. Res., 2003

Ideal preemptive schedules on two processors.

[BibT_eX]

[DOI]

Edward G. Coffman Jr.

Vadim G. Timkovsky

Acta Informatica, 2003

Approximately optimal control of fluid networks.

[BibT_eX]

[DOI]

Lisa Fleischer

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

2002

From fluid relaxations to practical algorithms for job shop scheduling: the makespan objective.

[BibT_eX]

[DOI]

Dimitris Bertsimas

Math. Program., 2002

Optimal crawling strategies for web search engines.

[BibT_eX]

[DOI]

Proceedings of the Eleventh International World Wide Web Conference, 2002

2001

Scheduling Algorithms for the Broadcast Delivery of Digital Products.

[BibT_eX]

[DOI]

IEEE Trans. Knowl. Data Eng., 2001

Scheduling periodic task graphs with communication delays.

[BibT_eX]

[DOI]

Anton Riabov

SIGMETRICS Perform. Evaluation Rev., 2001

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

[BibT_eX]

[DOI]

Wee-Peng Tan

Manag. Sci., 2001

A Polynomial-time Algorithm for the Bistable Roommates Problem.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2001

Variable Sized Bin Packing With Color Constraints.

[BibT_eX]

[DOI]

Milind Dawande

Jayant Kalagnanam

Electron. Notes Discret. Math., 2001

2000

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

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2000

1999

Optimal Scheduling of Multiclass Parallel Machines.

[BibT_eX]

[DOI]

Mark S. Squillante

Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, 1999

Optimal Stochastic Scheduling in Multiclass Parallel Queues.

[BibT_eX]

[DOI]

Mark S. Squillante

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.

[BibT_eX]

Proceedings of the MIS '99, 1999

1998

The Geometry of Fractional Stable Matchings and Its Applications.

[BibT_eX]

[DOI]

Math. Oper. Res., 1998

1997

LP Based Approach to Optimal Stable Matchings.

[BibT_eX]

[DOI]