Publication | Date of Publication | Type |
---|
Characterizing the TTC rule via pair-efficiency: a short proof | 2024-03-20 | Paper |
Scarf's algorithm and stable marriages | 2023-03-01 | Paper |
(Un)stable matchings with blocking costs | 2021-12-13 | Paper |
Equal-quantile rules in resource allocation with uncertain needs | 2021-09-29 | Paper |
Convergence of the Core in Assignment Markets | 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 | 2018-11-13 | Paper |
A note on the assignment problem with uniform preferences | 2018-09-28 | Paper |
An alternative proof of a characterization of the TTC mechanism | 2018-09-28 | Paper |
Balancing supply and demand under bilateral constraints | 2018-09-11 | Paper |
A NonCooperative Approach to Cost Allocation in Joint Replenishment | 2018-01-11 | Paper |
Groupstrategyproofness of the egalitarian mechanism for constrained rationing problems | 2017-11-22 | Paper |
The size of the core in assignment markets | 2017-10-05 | Paper |
Approximately Optimal Mechanisms for Strategyproof Facility Location: Minimizing Lp Norm of Costs | 2017-06-02 | Paper |
The Complexity of Computing the Random Priority Allocation Matrix | 2016-01-29 | Paper |
https://portal.mardi4nfdi.de/entity/Q5501851 | 2015-08-14 | Paper |
https://portal.mardi4nfdi.de/entity/Q2934598 | 2014-12-18 | Paper |
Online scheduling of packets with agreeable deadlines | 2014-12-05 | Paper |
https://portal.mardi4nfdi.de/entity/Q2921743 | 2014-10-13 | Paper |
The Bipartite Rationing Problem | 2014-06-26 | Paper |
A note on object allocation under lexicographic preferences | 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 | 2012-02-19 | Paper |
House allocation with fractional endowments | 2011-09-06 | Paper |
Lotteries in student assignment: An equivalence result | 2011-03-08 | Paper |
A note on the inefficiency of bidding over the price of a share | 2010-11-19 | Paper |
Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques | 2010-05-26 | Paper |
From Fluid Relaxations to Practical Algorithms for High-Multiplicity Job-Shop Scheduling: The Holding Cost Objective | 2009-07-09 | Paper |
Stochastic scheduling in an in-forest | 2008-10-29 | Paper |
Efficient Algorithms for Separated Continuous Linear Programs: The Multicommodity Flow Problem with Holding Costs and Extensions | 2008-05-27 | Paper |
Many-to-One Stable Matching: Geometry and Fairness | 2008-05-27 | Paper |
Stochastic Search in a Forest Revisited | 2008-05-27 | Paper |
A solution to the random assignment problem on the full preference domain | 2007-01-09 | Paper |
Anonymous monotonic social welfare functions | 2006-07-12 | Paper |
Effective routing and scheduling in adversarial queueing networks | 2006-03-21 | Paper |
Integer Programming and Arrovian Social Welfare Functions | 2005-11-11 | Paper |
A Note on Bandits with a Twist | 2005-02-28 | Paper |
https://portal.mardi4nfdi.de/entity/Q4737528 | 2004-08-11 | Paper |
https://portal.mardi4nfdi.de/entity/Q4471274 | 2004-07-28 | Paper |
Ideal preemptive schedules on two processors | 2004-03-11 | Paper |
https://portal.mardi4nfdi.de/entity/Q4793347 | 2003-02-11 | Paper |
A polynomial-time algorithm for the bistable roommates problem | 2002-07-04 | Paper |
From fluid relaxations to practical algorithms for job shop scheduling: The makespan objective | 2002-01-01 | Paper |
The Geometry of Fractional Stable Matchings and Its Applications | 2001-11-26 | Paper |
https://portal.mardi4nfdi.de/entity/Q2741495 | 2001-10-24 | Paper |
https://portal.mardi4nfdi.de/entity/Q4263729 | 2001-07-31 | Paper |
https://portal.mardi4nfdi.de/entity/Q4517111 | 2000-11-23 | Paper |
On a cutting plane heuristic for the stable roommates problem and its applications | 2000-08-30 | Paper |
https://portal.mardi4nfdi.de/entity/Q4252432 | 1999-06-17 | Paper |