|
|
|
|
|
Working/Submitted Papers
-
A Note on the Average Rank of Rank-Optimal Assignments,
-
Economics of Permissioned Blockchain Adoption,
with Garud Iyengar, Fahad Saleh, and Wenjun Wang.
-
Clearinghouse Default Waterfalls: Risk-Sharing, Incentives, and Systemic Risk,
with Agostino Capponi and W. Cheng.
-
On optimal ordering in the optimal stopping problem,
with Shipra Agrawal and Xingyu Zhang.
A one page
abstract
appeared in ACM EC 2020.
-
Equivalence results in the allocation of indivisible objects: A
unified view,
with Thiam Lee.
-
Cooperation in Queues,
with Akshay-Kumar Katta.
-
Pricing strategies and service differentiation in queues --- A profit
maximization perspective,
with Akshay-Kumar Katta.
Publications
-
Multiregional Oligopoly with Capacity Constraints,
with Humoud Alsabah, Benjamin Bernard, Agostino Capponi, and Garud Iyengar.
Management Science, forthcoming.
-
Strategic facility location problems with linear single-dipped
and single-peaked preferences,
with Itai Feigenbaum, Minming Li, Fangzhou Wang, and Shaokun Zou.
Autonomous Agents and Multi-Agent Systems, forthcoming.
-
Dynamic Matching in School Choice: Efficient Seat Reassignment
After Late Cancellations,
with Itai Feigenbaum, Irene Lo, and Yash Kanoria.
Management Science, forthcoming.
(A
preliminary version entitled
The Magician's Shuffle: Reusing Lottery Numbers for School Seat Redistribution appeared
in WINE 2016 as a one-page abstract.)
-
Convergence of the Core in Assignment Markets,
with Daniela Saban and Yash Kanoria.
Operations Research, 66(3):620--636, 2018.
(A
preliminary version entitled
The size of the core in assignment markets appeared
in SODA 2015.)
-
Group Strategyproofness of the Egalitarian Mechanism for
Constrained Rationing Problems,
with S. Chandramouli.
Mathematical Social Sciences, 90:111--118, 2017.
(An earlier version.)
-
A Non-cooperative Approach to Cost Allocation in Joint Replenishment
,
with Simai He, Xuan Wang, and Jiawei Zhang.
Operations Research, 65(6):1562--1573, 2017.
-
Approximately Optimal Mechanisms for Strategyproof Facility
Location: Minimizing L_p Norms of Costs
,
with Itai Feigenbaum and Chun Ye.
Mathematics of Operations Research, forthcoming.
-
An alternative proof of a characterization of the TTC mechanism
.
Operations Research Letters, 44(1):107--108, 2016.
-
The Complexity of Computing the Random Priority Allocation Matrix
,
with Daniela Saban.
Mathematics of Operations Research, 40(4):1005--1014, 2015.
-
A note on the assignment problem with uniform preferences
, with Chun Ye.
Operations Research Letters, 43(3):283--287, 2015.
-
A note on object allocation under lexicographic preferences
,
with Daniela Saban.
Journal of Mathematical Economics, 50:283--289, 2014.
-
Loss Calibarated Rationing Methods,
with Herve Moulin.
ACM EC 2013, , 697--714, 2013.
-
The Bipartite Rationing Problem,
with H. Moulin.
Operations Research , 61(5):1087--1100, 2013.
-
House Allocation with Indifferences: A generalization and a unified view,
with Daniela Saban.
ACM EC 2013, , 803--820, 2013.
-
Balancing Supply and Demand under Bilateral Constraints,
with O. Bochet, R. Ilkilic, and H. Moulin.
Theoretical Economics , 7(3): 395-423, 2012.
-
Lotteries in Student Assignment: An Equivalence Result,
with Parag Pathak.
Theoretical Economics , 6(1):1-17, 2011.
(An earlier version was distributed as
An equivalence result in school choice.)
-
House Allocation with Fractional Endowments,
with Stergios Athanassoglou.
International Journal of Game Theory , 40(3):481-513, 2011.
-
Stochastic scheduling in an in-forest,
with Uri Rothblum.
Discrete Optimization , 5(2):457-466, 2008.
-
Better online buffer management,
with Fei Li and Cliff Stein. SODA 2007, pp. 199-208.
-
Stochastic search in a forest revisited ,
with John Tsitsiklis.
Mathematics of Operations Research, 32(3):580-593, 2007.
-
Many-to-one stable matching: Geometry and Fairness,
with Chung-Piaw Teo and Liwen Qian.
Mathematics of Operations Research, 31(3):581-596, 2006.
-
A solution to the random assignment problem on
the full preference domain,
with Akshay-Kumar Katta.
Journal of Economic Theory, 131(1):231-250, 2006.
-
Efficient Algorithms for SCLP: the Multicommodity
Flow Problem with Holding Cost and Extensions,
with Lisa Fleischer.
Mathematics of Operations Research , 30(4):916-938, 2005.
(A
preliminary version entitled
Approximately optimal control of fluid networks appeared
in SODA 2003.)
-
Anonymous monotonic social welfare functions,
with Chung-Piaw Teo and Rakesh Vohra.
Journal of Economic Theory, 128:232-254, 2006.
-
An optimal online algorithm for scheduling packets with
agreeable deadlines,
with Fei Li and Cliff Stein,
SODA 2005, pp. 801-802.
-
Effective routing and scheduling in adversarial queueing networks,
with Chung-Piaw Teo.
Algorithmica, 43(1-2):133-146, 2005.
(A
preliminary version appeared in APPROX 2003, pages 153-164.)
-
A note on bandits with a twist,
with Akshay-Kumar Katta,
SIAM J. Disc. Math., 18(1):110-113, 2005.
-
From fluid relaxations to practical algorithms for
high-multiplicity job shop scheduling: the holding cost objective,
with Dimitris Bertsimas and David Gamarnik,
Operations Research, 51(5):798-813, 2003.
-
Ideal preemptive schedules on two processors, with Ed Coffman
and Vadim Timkovsky,
Acta Informatica, 39(8):597-612, 2003.
-
Integer programming and Arrovian social welfare functions,
with Chung-Piaw Teo and Rakesh Vohra,
Math. of O.R., 28(2):309-326, 2003.
(A
preliminary version appeared in IPCO 2002, pages 194-211.)
-
Analysis of parallel-server queues under spacesharing and
timesharing disciplines,
Matrix-Analytic Methods in Stochastic Models, 2002.
-
Optimal crawling strategies for web search engines, with Joel Wolf,
Mark Squillante, Philip Yu, and Leyla Ozsen,
WWW 2002, pages 136-147.
-
From fluid relaxations to practical algorithms for job shop
scheduling: the makespan objective, with Dimitris Bertsimas,
Mathematical Programming , 92(1):61-102, 2002.
-
Scheduling periodic task-graphs with communication delays, with
Anton Riabov, Third workshop on mathematical performance modeling and
analysis, extended abstract appeared in
Performance Evaluation Review,
December 2002.
-
A polynomial-time algorithm for the bistable roommates problem,
with Chung-Piaw Teo,
Journal of Computer and Systems Sciences,
63(3):486-497, 2001.
-
Scheduling algorithms for the broadcast delivery of digital
products, with Joel Wolf, Philip Yu, John Turek, and Mark Squillante,
IEEE Trans. on Knowledge Engineering, 13(5):721-741, 2001.
-
Variable-sized bin packing with color constraints, with Milind
Dawande and Jayant Kalagnanam,
Brazilian Symposium on Graphs, Algorithms,
and Combinatorics, Extended abstract appeard in
Electronic Notes in Discrete
Mathematics, 7, 2001.
-
Optimizing profits in the broadcast delivery of multimedia
products, with Charu Aggarwal, Mark Squillante, Joel Wolf, and Philip Yu,
Proceedings of the
Fifth International Workshop on Multimedia Information
Systems, pages 88-95, 1999.
-
Gale-Shapley stable marriage problem revisited: strategic issues
and applications, with Chung-Piaw Teo and Wee-Peng Tan,
Management Science,
47(9):1252-1267, 2001. A
preliminary versionappeared in
IPCO 1999, pages
429-438.
-
A cutting-plane algorithm for the stable roommates problem and its
applications, with Chung-Piaw Teo,
European Journal on Operational Research,
123(1):195-205, 2000.
-
Optimal stochastic scheduling in multiclass parallel queues,
with
Mark Squillante, SIGMETRICS 1999, pages 93-102.
-
Optimal scheduling of multiclass parallel machines, with Mark
Squillante, SODA 1999, pages 963-964.
- The geometry of fractional stable matchings and its applications, with Chung-Piaw Teo, Math. of O.R., 23(4):874-891, 1998. A preliminary version entitled LP-based approach to optimal stable matchings appeared in SODA 1997, pages 710-719.