| Multiregional Oligopoly With Capacity Constraints | 0 | 0.34 | 2021 |
| Equal-quantile rules in resource allocation with uncertain needs | 0 | 0.34 | 2021 |
| Dynamic Matching In School Choice: Efficient Seat Reassignment After Late Cancellations | 0 | 0.34 | 2020 |
| On optimal ordering in the optimal stopping problem | 1 | 0.36 | 2020 |
| Convergence of the Core in Assignment Markets | 0 | 0.34 | 2018 |
| Approximately Optimal Mechanisms for Strategyproof Facility Location: Minimizing Lp Norm of Costs | 1 | 0.37 | 2017 |
| A NonCooperative Approach to Cost Allocation in Joint Replenishment | 0 | 0.34 | 2017 |
| An alternative proof of a characterization of the TTC mechanism. | 2 | 0.42 | 2016 |
| The Magician's Shuffle: Reusing Lottery Numbers for School Seat Redistribution. | 0 | 0.34 | 2016 |
| A Note on the Assignment Problem with Uniform Preferences. | 0 | 0.34 | 2014 |
| The size of the core in assignment markets | 2 | 0.43 | 2014 |
| Strategyproof Mechanisms for One-Dimensional Hybrid and Obnoxious Facility Location. | 3 | 0.55 | 2014 |
| Strategyproof and Consistent Rules for Bipartite Flow Problems | 0 | 0.34 | 2013 |
| The Bipartite Rationing Problem. | 8 | 0.76 | 2013 |
| Loss calibrated methods for bipartite rationing: bipartite rationing | 1 | 0.40 | 2013 |
| 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. | 0 | 0.34 | 2013 |
| Approximation Algorithms for the Incremental Knapsack Problem via Disjunctive Programming. | 4 | 0.45 | 2013 |
| The Complexity of Computing the Random Priority Allocation Matrix. | 10 | 0.75 | 2013 |
| House allocation with indifferences: a generalization and a unified view | 8 | 1.13 | 2013 |
| Approximately Optimal Mechanisms for Strategyproof Facility Location: Minimizing $L_p$ Norm of Costs | 3 | 0.46 | 2013 |
| Online scheduling of packets with agreeable deadlines | 7 | 0.51 | 2012 |
| Rationing problems in bipartite networks | 0 | 0.34 | 2012 |
| House allocation with fractional endowments | 4 | 0.50 | 2011 |
| Groupstrategyproofness of the Egalitarian Mechanism for Constrained Rationing Problems | 3 | 0.54 | 2011 |
| Matching mechanisms and their application to school choice | 0 | 0.34 | 2010 |
| A note on the inefficiency of bidding over the price of a share | 0 | 0.34 | 2010 |
| Bounded Size Graph Clustering with Applications to Stream Processing | 2 | 0.39 | 2009 |
| Stochastic scheduling in an in-forest | 2 | 0.36 | 2008 |
| Better online buffer management | 28 | 1.38 | 2007 |
| Stochastic Search in a Forest Revisited | 1 | 0.41 | 2007 |
| Many-to-One Stable Matching: Geometry and Fairness | 29 | 1.50 | 2006 |
| Anonymous monotonic social welfare functions | 0 | 0.34 | 2006 |
| A solution to the random assignment problem on the full preference domain | 62 | 4.59 | 2006 |
| Effective Routing and Scheduling in Adversarial Queueing Networks | 2 | 0.38 | 2005 |
| Efficient Algorithms for Separated Continuous Linear Programs: The Multicommodity Flow Problem with Holding Costs and Extensions | 14 | 0.87 | 2005 |
| An optimal online algorithm for packet scheduling with agreeable deadlines | 41 | 1.87 | 2005 |
| A Note on Bandits with a Twist | 5 | 0.90 | 2004 |
| From Fluid Relaxations to Practical Algorithms for High-Multiplicity Job-Shop Scheduling: The Holding Cost Objective | 18 | 1.07 | 2003 |
| Ideal preemptive schedules on two processors. | 10 | 1.04 | 2003 |
| Approximately optimal control of fluid networks | 2 | 0.42 | 2003 |
| From fluid relaxations to practical algorithms for job shop scheduling: the makespan objective | 20 | 1.26 | 2002 |
| Integer Programming and Arrovian Social Welfare Functions | 3 | 0.55 | 2002 |
| Gale-Shapley Stable Marriage Problem Revisited: Strategic Issues and Applications. | 32 | 2.57 | 2001 |
| Scheduling Algorithms for the Broadcast Delivery of Digital Products | 7 | 1.14 | 2001 |
| Scheduling periodic task graphs with communication delays | 2 | 0.39 | 2001 |
| A Polynomial-time Algorithm for the Bistable Roommates Problem | 4 | 0.58 | 2001 |
| Variable Sized Bin Packing With Color Constraints | 12 | 1.01 | 2001 |
| On a cutting plane heuristic for the stable roommates problem and its applications | 3 | 0.51 | 2000 |
| Gale-Shapley Stable Marriage Problem Revisited: Strategic Issues and Applications. | 0 | 0.34 | 1999 |
| Optimal scheduling of multiclass parallel machines | 16 | 1.06 | 1999 |
