| Publication | Date of Publication | Type |
|---|
Characterizing the TTC rule via pair-efficiency: a short proof
Economics Letters | 2024-03-20 | Paper |
| Scarf's algorithm and stable marriages | 2023-03-01 | Paper |
(Un)stable matchings with blocking costs
Operations Research Letters | 2021-12-13 | Paper |
Equal-quantile rules in resource allocation with uncertain needs
Journal of Economic Theory | 2021-09-29 | Paper |
Convergence of the Core in Assignment Markets
Operations Research | 2020-10-12 | Paper |
| A note on the rationing of divisible and indivisible goods in a general network | 2020-01-17 | Paper |
How much inequality in income is fair? A microeconomic game theoretic perspective
Physica A | 2018-11-13 | Paper |
An alternative proof of a characterization of the TTC mechanism
Operations Research Letters | 2018-09-28 | Paper |
A note on the assignment problem with uniform preferences
Operations Research Letters | 2018-09-28 | Paper |
Balancing supply and demand under bilateral constraints
Theoretical Economics | 2018-09-11 | Paper |
A noncooperative approach to cost allocation in joint replenishment
Operations Research | 2018-01-11 | Paper |
Groupstrategyproofness of the egalitarian mechanism for constrained rationing problems
Mathematical Social Sciences | 2017-11-22 | Paper |
The size of the core in assignment markets
Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms | 2017-10-05 | Paper |
Approximately Optimal Mechanisms for Strategyproof Facility Location: Minimizing Lp Norm of Costs
Mathematics of Operations Research | 2017-06-02 | Paper |
The complexity of computing the random priority allocation matrix
Mathematics of Operations Research | 2016-01-29 | Paper |
| scientific article; zbMATH DE number 6472649 (Why is no real title available?) | 2015-08-14 | Paper |
| Better online buffer management | 2014-12-18 | Paper |
Online scheduling of packets with agreeable deadlines
ACM Transactions on Algorithms | 2014-12-05 | Paper |
| An optimal online algorithm for packet scheduling with agreeable deadlines | 2014-10-13 | Paper |
The Bipartite Rationing Problem
Operations Research | 2014-06-26 | Paper |
A note on object allocation under lexicographic preferences
Journal of Mathematical Economics | 2014-03-24 | Paper |
| Bounded size graph clustering with applications to stream processing | 2012-10-24 | Paper |
Gale-Shapley stable marriage problem revisited: strategic issues and applications
Management Science | 2012-02-19 | Paper |
House allocation with fractional endowments
International Journal of Game Theory | 2011-09-06 | Paper |
Lotteries in student assignment: an equivalence result
Theoretical Economics | 2011-03-08 | Paper |
A note on the inefficiency of bidding over the price of a share
Mathematical Social Sciences | 2010-11-19 | Paper |
Effective routing and scheduling in adversarial queueing networks
Lecture Notes in Computer Science | 2010-05-26 | Paper |
From Fluid Relaxations to Practical Algorithms for High-Multiplicity Job-Shop Scheduling: The Holding Cost Objective
Operations Research | 2009-07-09 | Paper |
Stochastic scheduling in an in-forest
Discrete Optimization | 2008-10-29 | Paper |
Efficient Algorithms for Separated Continuous Linear Programs: The Multicommodity Flow Problem with Holding Costs and Extensions
Mathematics of Operations Research | 2008-05-27 | Paper |
Many-to-One Stable Matching: Geometry and Fairness
Mathematics of Operations Research | 2008-05-27 | Paper |
Stochastic Search in a Forest Revisited
Mathematics of Operations Research | 2008-05-27 | Paper |
A solution to the random assignment problem on the full preference domain
Journal of Economic Theory | 2007-01-09 | Paper |
Anonymous monotonic social welfare functions
Journal of Economic Theory | 2006-07-12 | Paper |
Effective routing and scheduling in adversarial queueing networks
Algorithmica | 2006-03-21 | Paper |
Integer Programming and Arrovian Social Welfare Functions
Mathematics of Operations Research | 2005-11-11 | Paper |
A Note on Bandits with a Twist
SIAM Journal on Discrete Mathematics | 2005-02-28 | Paper |
| scientific article; zbMATH DE number 2086923 (Why is no real title available?) | 2004-08-11 | Paper |
| scientific article; zbMATH DE number 2079321 (Why is no real title available?) | 2004-07-28 | Paper |
Ideal preemptive schedules on two processors
Acta Informatica | 2004-03-11 | Paper |
| scientific article; zbMATH DE number 1867262 (Why is no real title available?) | 2003-02-11 | Paper |
A polynomial-time algorithm for the bistable roommates problem
Journal of Computer and System Sciences | 2002-07-04 | Paper |
From fluid relaxations to practical algorithms for job shop scheduling: The makespan objective
Mathematical Programming. Series A. Series B | 2002-01-01 | Paper |
The geometry of fractional stable matchings and its applications
Mathematics of Operations Research | 2001-11-26 | Paper |
| Variable sized bin packing with color constraints | 2001-10-24 | Paper |
| scientific article; zbMATH DE number 1342147 (Why is no real title available?) | 2001-07-31 | Paper |
| scientific article; zbMATH DE number 1534302 (Why is no real title available?) | 2000-11-23 | Paper |
On a cutting plane heuristic for the stable roommates problem and its applications
European Journal of Operational Research | 2000-08-30 | Paper |
| scientific article; zbMATH DE number 1305540 (Why is no real title available?) | 1999-06-17 | Paper |
